PROGRAM
Days: Monday, December 4th Tuesday, December 5th Wednesday, December 6th Thursday, December 7th Friday, December 8th
Monday, December 4th
View this program: with abstractssession overviewtalk overview
09:00-10:30 Session 1: Tutorial 1: Shaukat Ali Mahsa & Varshosaz. Testing Cyber-Physical Systems
Chair:
Location: A706
11:00-12:30 Session 2: Tutorial 1: Shaukat Ali Mahsa & Varshosaz. Testing Cyber-Physical Systems
Chair:
Location: A706
14:00-15:30 Session 3: Tutorial 2: Ina Schaefer & Maximilian Kodetzki. Correctness-by-Construction Approach to Programming
Chair:
Location: A706
16:00-17:30 Session 4: Tutorial 2: Ina Schaefer & Maximilian Kodetzki. Correctness-by-Construction Approach to Programming
Chair:
Location: A706
Tuesday, December 5th
View this program: with abstractssession overviewtalk overview
09:00-10:30 Session 5: Tutorial 3: Einar Broch Johnsen. Semantically Lifted Digital Twin
Chair:
Location: A706
11:00-12:30 Session 6: Tutorial 4: Maurice H. ter Beek. Formal Methods and Tools for Software Product Lines
Chair:
Location: A706
17:45-19:30 Reception
Location: UTEC terrasse
Wednesday, December 6th
View this program: with abstractssession overviewtalk overview
09:00-10:00 Session 10: Invited Speaker: Marijn J.H. Heule. Without Loss of Satisfaction.
Chair:
Location: SALA SUM
10:30-12:00 Session 11: Security and privacy
Chair:
Location: SALA SUM
| 10:30 | A game-theoretic approach to indistinguishability of winning objectives as user privacy (abstract) |
| 11:00 | Learning Attack Trees by Genetic Algorithms (abstract) |
| 11:30 | The Landscape of Computing Symmetric $n$-Variable Functions with $2n$ Cards (abstract) |
14:00-15:00 Session 12: Proof complexity
Chair:
Location: SALA SUM
| 14:00 | On the complexity of reasoning in Kleene algebras with commutativity conditions (abstract) |
| 14:30 | Towards the Complexity Analysis of Programming Language Proof Methods (abstract) |
Thursday, December 7th
View this program: with abstractssession overviewtalk overview
09:00-10:00 Session 13: Invited Speaker: Pedro R. D'Argenio. Optimal Route Synthesis in Space DTN using Markov Decision Processes.
Chair:
Location: SALA SUM
10:30-12:00 Session 14: Logics and languages I
Chair:
Location: SALA SUM
| 10:30 | A Dynamic Temporal Logic for Quality of Service in Choreographic Models (abstract) |
| 11:00 | Interactive Matching Logic Proofs in Coq (abstract) |
| 11:30 | An Autonomous Data Language (abstract) |
14:00-15:30 Session 15: Logics and languages II
Chair:
Location: SALA SUM
| 14:00 | Formal Language Semantics for Triggered Enable Statecharts with a Run-to-Completion Scheduling (abstract) |
| 14:30 | Strong Call-by-Value and Multi Types (abstract) |
| 15:00 | Algorithms for Checking Intersection Non-emptiness of Regular Expressions (abstract) |
16:00-17:00 Session 16: Synthesis
Chair:
Location: SALA SUM
| 16:00 | Realisability of Global Models of Interaction (abstract) |
| 16:30 | Efficient Reactive Synthesis Using Mode Decomposition (abstract) |
Friday, December 8th
View this program: with abstractssession overviewtalk overview
09:00-10:00 Session 17: Invited Speaker: Ana Cavalcanti. Learning in RoboStar.
Chair:
Location: SALA SUM
10:30-12:00 Session 18: Modeling languages
Chair:
Location: SALA SUM
| 10:30 | A Categorical Approach to Synthetic Chemistry (abstract) |
| 11:00 | Closure and Decision Properties for Higher-Dimensional Automata (abstract) |
| 11:30 | Robustness in Metric Spaces over Continuous Quantales and the Hausdorff-Smyth Monad (abstract) PRESENTER: Eugenio Moggi |
14:00-15:30 Session 19: Verification I
Chair:
Location: SALA SUM
| 14:00 | Synchronous Agents, Verification, and Blame — A Deontic View (abstract) |
| 14:30 | Store Locally, Prove Globally (abstract) |
| 15:00 | Denotational Semantics for Symbolic Execution (abstract) |
16:00-17:30 Session 20: Verification II
Chair:
Location: SALA SUM
| 16:00 | TOOL PAPER: Tessla-ROS-Bridge - Runtime Verification of Robotic Systems (abstract) |
| 16:30 | Simplifying process parameters by unfolding algebraic data types (abstract) |
| 17:00 | Modular Soundness Checking of Feature Model Evolution Plans (abstract) |