PROGRAM
Days: Tuesday, October 22nd Wednesday, October 23rd Thursday, October 24th
Tuesday, October 22nd
View this program: with abstractssession overviewtalk overview
10:30-11:00Coffee and Tea Break
11:00-12:30 Session 2: Verification 1
Chair:
Location: Inamori Hall
| 11:00 | Fast Koopman Surrogate Falsification using Linear Relaxations and Weights (abstract) |
| 11:30 | Local Search for Checking Satisfiability of Formulas with Trigonometric Functions (abstract) |
| 12:00 | Symbolic Model Checking of Hybrid CTL on Coloured Kripke Structures (abstract) |
12:30-14:00Lunch (Served On Site)
14:00-15:30 Session 3: Learning 1
Chair:
Location: Inamori Hall
| 14:00 | Deep-Reinforcement-Learning-Based Design Space Exploration for Time-Sensitive Networking (abstract) |
| 14:30 | Learning Broadcast Protocols with LeoParDS (TOOL Paper) (abstract) |
| 15:00 | Greybox Learning of Languages Recognizable by Event-Recording Automata (abstract) |
15:30-16:00Coffee and Tea Break
16:00-17:30 Session 4: Synthesis
Chair:
Location: Inamori Hall
| 16:00 | Configuration Monitor Synthesis (abstract) |
| 16:30 | Predictable and Performant Reactive Synthesis Modulo Theories via Functional Synthesis (abstract) |
| 17:00 | Policies Grow on Trees: Model Checking Families of MDPs (**Distinguished Paper**) (abstract) PRESENTER: Filip Macák |
Wednesday, October 23rd
View this program: with abstractssession overviewtalk overview
09:00-10:00 Session 5: Keynote 2
Chair:
Location: Inamori Hall
| 09:00 | Strategy Templates - Robust Certified Interfaces for Interactive Systems |
10:00-10:30Coffee and Tea Break
10:30-12:00 Session 6: Verification 2
Chair:
Location: Inamori Hall
| 10:30 | CPA-Daemon: Mitigating Tool Restarts for Java-Based Verifiers (TOOL paper) (abstract) |
| 11:00 | CTL* Verification and Synthesis using Existential Horn Clauses (abstract) |
| 11:30 | HyperSAT: Satisfiability of Hyperproperties using First-Order Logic (**Distinguished TOOL Paper**) (abstract) |
12:00-14:00Lunch (Served On Site)
14:00-15:30 Session 7: Concurrent and Distributed Systems
Chair:
Location: Inamori Hall
| 14:00 | Proving Cutoff Bounds for Safety Properties in First-Order Logic (abstract) |
| 14:30 | Distribution of Reconfiguration Languages maintaining Tree-like Communication Topology (abstract) |
| 15:00 | Dynamic Partial Order Reduction for Transactional Programs on Serializable Platforms (abstract) |
15:30-16:00Coffee and Tea Break
Thursday, October 24th
View this program: with abstractssession overviewtalk overview
09:00-10:00 Session 9: Keynote 3 (Joint with APLAS)
Chair:
Location: Inamori Hall
| 09:00 | Higher-Order Fixpoint Logic for Automated Program Verification (abstract) |
10:00-10:30Coffee and Tea Break
10:30-12:00 Session 10: Software Verification and Programming Language Semantics
Chair:
Location: Inamori Hall
| 10:30 | Formalisation of a new weak Semantics for AuDaLa (abstract) |
| 11:00 | Hedge automata revisited: Transforming texts to and from XML (abstract) PRESENTER: Akihisa Yamada |
| 11:30 | Structure Mining For Test Case Generation (abstract) |
12:00-14:00Lunch (Served On Site)
14:00-15:30 Session 11: Automata and Games
Chair:
Location: Inamori Hall
| 14:00 | Easy Complementation of History-Deterministic B\"uchi Automata (abstract) |
| 14:30 | A Decremental Algorithm for Fair Büchi Games (**Distinguished Paper**) (abstract) |
| 15:00 | Games with Weighted Multiple Objectives (abstract) |
15:30-16:00Coffee and Tea Break
16:00-17:30 Session 12: Runtime Verification and Learning 2
Chair:
Location: Inamori Hall
| 16:00 | WhyMon: A Runtime Monitoring Tool with Explanations as Verdicts (TOOL paper) (abstract) |
| 16:30 | Query Learning Bounds for Advice and Nominal Automata (abstract) |
| 17:00 | Guiding Word Equation Solving using Graph Neural Networks (abstract) |