PROGRAM
of the
Sunday, December 09
-
rules of costs
-
rules of management
-
summary of the project
-
tasks and participants
-
schedule of meetings
11:45 Tudor Jebelean – Presentation of Theorema
12:00 Nikolaj
Popov – Functional Program Verification in
Theorema – Using Completeness for Debugging
12:20 Laura
Kovacs – Automated Generation of Polynomial
Invariants for Imperative Program Verification in Theorema
14:00 Adrian Craciun – An Implementation of
Groebner Synthesis in Theorema
–
Synthesis of a Groebner
Bases Algorithm by Lazy Thinking
15:00 Khimuri Rukhaia and
Lali Tibua – One Variant of
Assertional Programming
16:15 Igor Konnov – On Verification of Parameterized
Distributed Systems
Monday, December 10
– Software Tools for Morphological
and Syntactic Analysis of Natural Language Texts – Paper
– Example
11:15 Alexander Lyaletski
junior – Different notions
of conuity and intensional models for λ-calculus