Program

September 19:

8:45 Opening
9:00-10:00 Luigia Petre, “On Teaching Formal Methods – Challenges and Prospects”
10:00-10:30 Péter Bereczky, Chen Xiaohong, Dániel Horpácsi, Lucas Pena and Jan Tusil, “Mechanizing Matching Logic In Coq”
10:30-11:00 Coffee break
11:00-12:00 Thomas Genet, “Regular Tree Languages for Verification, at last” 
12:00-12:30 Andrei Arusoaie and Dorel Lucanu,” Proof-Carrying Parameters in Certified Symbolic Execution: The Case Study of Antiunification”
12:30- 14:00 Lunch
14:00-15:00 Denisa Diaconescu, “An abstract framework for faulty distributed systems”
15:00-15:30 Coffee break
15:30-16:00 Nils Timm and Josua Botha, “Synthesis of Cost-Optimal Multi-Agent Systems for Resource Allocation”
16:00-16:30 Wolfgang Jeltsch and Javier Díaz, “Correctness of Broadcast via Multicast: Graphically and Formally”

September 20 (shared with WoLLIC 2022):

9:00-10:00 Dorel Lucanu, “How to Define Domain Specific Logics using Matching Logic”.

Comments are closed.