Laboratory staff investigate:
- formalization and verification of the semantics of programming languages in the context of weak memory models;
- logical and relational programming;
- the theory of formal languages and its applications;
- metaprogramming, specialization and partial computing;
- formal verification and application of SMT solvers.
The weekly workshops are attended by our staff and students as well as invited speakers. Recently, seminars have been recorded and can be viewed on Youtube . In this post we will share links and descriptions of past meetings, as well as tell you how not to miss the announcements of future events.
Past talks:
Persistent semantics of the ext4 filesystem and verification in it
A Slightly Subcubic Algorithm for the Pathfinding Problem with Context-Free Constraints
Checking models in weak memory models
Representability of invariants of programs with algebraic data types
Development of compilers of domain-specific languages for special processors
Semantics of Recursive Types with Indexed Execution Steps
The next report on November 2 will be made by Anton Trunov on the topic “Indiscernible evidence: by definition, but without the K-axiom”. Join the Google Meet at 5:30 pm here .
Seminar announcement on November 2
, , , , . « ». , , .. , — , , , . , . , , , .
: Coq. SProp . Prop . SProp .
: Coq. SProp . Prop . SProp .
To receive announcements of our seminars:
- join a Google Group ,
- join the Vk group of laboratories,
- or add yourself a seminar calendar .