Erinevus lehekülje "Formal methods in model-based testing and verification" redaktsioonide vahel

Allikas: Kursused
Mine navigeerimisribale Mine otsikasti
17. rida: 17. rida:
 
*** Jüri Vain "Towards context-sensitive dialogue with robot companion" (paper submitted in BEC 2014)
 
*** Jüri Vain "Towards context-sensitive dialogue with robot companion" (paper submitted in BEC 2014)
 
** 22/10/2014  
 
** 22/10/2014  
*** Kristjan Liiva "Topic TBA"
+
*** Kristjan Liiva "A note on real quantifier elimination by virtual term  substitution of unbounded degree"<br/>'''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.'''
 
***...
 
***...

Redaktsioon: 1. oktoober 2014, kell 14:21

  • 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"
      • Andrus 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 submitted in BEC 2014)
    • 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.
      • ...