Formal methods in model-based testing and verification
Mine navigeerimisribale
Mine otsikasti
- Time: Wednesday 16:00
- Location: room ICT-411
- Syllabus:
- 17/09/2014 Introduction to the seminar
- 24/09/2014
- Jüri Vain "Provably Correct Online Testing Of Timed Systems"
- Andres Toom "A Software Product Line Approach for Semantics Specification of Block Libraries in Data Flow Languages"
- 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)[1]
- 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.
- Kristjan Liiva "A note on real quantifier elimination by virtual term substitution of unbounded degree"
- 29/10/2014
- TBA
- 05/11/2014
- Andres Toom "Verification of Block Library specifications in deductive program verification environment Why"
- [2] Why3 home page
- Additional Reading