PROGRAM
Days: Wednesday, September 24th Thursday, September 25th Friday, September 26th
Wednesday, September 24th
View this program: with abstractssession overviewtalk overview
09:00-09:50 Session 1: Invited talk: Daniela Kaufmann
09:00 | Verifying Arithmetic Circuits with Polynomials (abstract) |
10:10-11:40 Session 3: Presentations - Certificates and Witnesses
10:10 | Software Verification Witnesses (abstract) |
10:40 | Witness-guided verification in trace abstraction (abstract) |
11:10 | From Interleavings to Owicki–Gries via Empires: Certificates for Concurrent Program Verification (abstract) |
12:00-13:00 Session 4: Tutorial - Nikolaj Bjørner
12:00 | Arithmetic Solving in Z3 (abstract) |
14:00-15:00 Session 5: Tutorial - Andrei Voronkov
14:00 | First-Order Proof Checking (abstract) |
15:30-17:30 Session 7: Presentations - Networks and Optimizations
15:30 | Proof-based Space Explanation of Classifying Neural Networks (abstract) |
16:00 | On the Verification of Structured Parameterized Networks (abstract) |
16:30 | Hardware-Optimal Quantum Algorithms (abstract) |
17:00 | Bounding Probabilistic Loop Variables using Martingales and the Optional Stopping Theorem (abstract) |
17:30-22:00 Trip to Recas Winery and SYNASC/AVM Conference Dinner
Dinner with wine tasting at Winery Recas (organized trip by bus).
Thursday, September 25th
View this program: with abstractssession overviewtalk overview
09:00-10:30 Session 8: Presentations - Verification and Synthesis
09:00 | Formal Verification with Configurable Execution Semantics (abstract) |
09:30 | Computing abstract model-checking transitions using abstract interpretation (abstract) |
10:00 | Parameterized Infinite-State Reactive Synthesis (abstract) |
11:00-11:50 Session 10: Invited Talk: Thomas A. Henzinger
11:00 | Neural Certificates (abstract) |
14:00-16:00 Session 12: Presentations - Automata
14:00 | Regexes with Back-References using Register Set Automata (abstract) |
14:30 | Towards Minimizing Phase Event Automata (abstract) |
15:00 | Complementing Emerson-Lei Elevator Automata (abstract) |
15:30 | Leveraging Partial Redundancy in Active Automata Learning (abstract) |
16:30-18:00 Session 14: Presentations - Symbolic Execution and Static Analysis
16:30 | Accelerating Decision-diagram-based Quantum Circuit Simulation With Symbolic Execution (abstract) |
17:00 | A Novel Symbolic Execution Framework for Symbolic Timing Analysis of Digital Integrated Circuits (abstract) |
17:30 | RacerF: Lightweight Static Data Race Detection for C Code (abstract) |
19:00-22:00 AVM Dinner
AVM Dinner and Networking at Beraria 700
Friday, September 26th
View this program: with abstractssession overviewtalk overview
09:00-10:30 Session 15: Presentations - SMT and Applications
09:00 | CHCs for every occasion (abstract) |
09:30 | Current State of String Solver Z3-Noodler (abstract) |
10:00 | On User-defined Decision Guidance in SMT Solvers (abstract) |
11:00-12:30 Session 17: Presentations - SAT and Proofs
11:00 | Pseudo-Boolean Proof Logging for Optimal Classical Planning (abstract) |
11:30 | Proofs (that contain programs that contain proofs)* (abstract) |
12:00 | Robust by Design: SAT-based Automata Learning in the Presence of Noise (abstract) |