Formal methods in model-based testing and verification

• Time: Wednesday 16:00
• Location: room ICT-411
• Syllabus:
  • 17/09/2014 Introduction to the seminar
  • 24/09/2014
    • Jüri Vain "Provably correct test generation for online testing of timed systems"
    • Andres Toom "A software product line approach for semantic specification of block libraries in dataflow language" [1]
      Dataflow modelling languages such as SCADE or Simulink are the de-facto standard for the Model Driven Development of safety critical embedded control and command systems. Software is mainly being produced by Automated Code Generators whose correctness can only be assessed meaningfully if the input language semantics is well known. These semantics share a common part but are mainly defined through block libraries. The writing of a complete formal specification for the block libraries of the usual languages is highly challenging due to the high variability of the structure and semantics of each block. This contribution relates the use of software product line principles in the design of a domain specific language targeting the formal specification of block libraries. It summarises the advantages of this DSL regarding the writing, validation and formal verification of such specifications. These experiments have been carried out in the context of the GeneAuto embedded code generator project targeting Simulink and Scicos; and are being extended and applied in its follow up projects ProjetP and Hi-MoCo.
  • 01/10/2014
    • Jaagup Irve "Simulation modelling of robot swarms and emergent behaviour experiments (based on MSc Thesis)"
  • 08/10/2014
    • Deepak Pal "Model based distributed testing, literature survey"
    • Jishu Guin "Abstraction learning: discussion on the reading list"
  • 15/10/2014
    • Gert Kanter & Evelin Halling "Joint report on European robot challenge"
    • Jüri Vain "Towards context-sensitive dialogue with robot companion" (paper published in BEC 2014)[2]
  • 22/10/2014
    • Kristjan Liiva "A note on real quantifier elimination by virtual term substitution of unbounded degree"
      We describe work in progress on constructing a complete implementation of Weispfenning's virtual term substitution method for real closed field formulas of unbounded degree. We build upon a recent high-performance library for computing over non-Archimedean real closed fields using Thom's Lemma.
  • 29/10/2014
    • TBA
  • 05/11/2014
    • Andres Toom "Verification of Block Library specifications in deductive program verification environment Why" [3] Why3 home page
  • 12/11/2014
    • TBA
    • TBA
  • 19/11/2014
    • TBA
    • TBA
  • 26/11/2014
    • TBA
    • TBA
  • 03/12/2014
    • TBA
    • TBA
  • 10/12/2014
    • TBA
    • TBA
  • 17/12/2014
    • TBA
    • TBA

• Additional Reading
  • "Online Testing of Nondeterministic Systems with the Reactive Planning Tester"
  • "Towards Establishing Relationships between Human Arousal Level and Motion Mass"