The general schedule is shown below. All times are in CEST.
Wrong password, please try again.
Registered participants can obtain access to session teasers and session zoom link
by entering a password given to them by the organizers.
Links to teasers and zoom session will appear when hovering above a session.
Links to teasers will appear under the session or paper title.
You are logged in as a Qonfest participant.
Hovering the mouse above a session will show more information,
including links to the teaser videos.
You can access the teasers for sessions or individual papers
using the links in the programme below.
To join the conference, go to our gather.town session (same password as for this page).
Teasers and recording of sessions will be available on our YouTube channel
To join the conference, go to our gather.town session (same password as for this page).
Teasers and recording of sessions will be available on our YouTube channel
Proceedings: CONCUR • FMICS • FORMATS • QEST
Note: To enable your access to QEST papers, first click the Springer link on the QEST homepage.
Keynote Formats
12:00-13:00
Parosh Abdulla
Daniele Magazzeni
Temporal Reasoning for Intelligent Financial Services: Examples and Challenges
Keynote Concur+Qest
15:45-16:45
Alessandro Abate
Boudewijn Haverkort
Performance Evaluation: Model or Problem Driven?
Keynote Fmics
18:30-19:30
Joe Kiniry
Haunting Tales of Applied Formal Methods from Academia and Industry
Keynote Qest
15:45-16:45
Andrea Marin
François Baccelli
Stochastic Geometry based Performance Analysis of Wireless Networks
Keynote Formats
15:45-16:45
Morteza Lahijanian
Jana Tumova
Formal Methods for Robot Motion Planning with Time and Space Constraints
Opening
Closing Session
Formats Closing Session
Concur A1
14:00-15:15
Büchi Automata
Javier Esparza
Reducing (To) the Ranks: Efficient Rank-Based Büchi Automata Complementation
Inclusion Testing of Büchi Automata Based on Well-Quasiorders
Nominal Büchi Automata with Name Allocation
Concur B1
14:00-15:15
Probabilistic Models
Serge Haddad
Enforcing ω-Regular Properties in Markov Chains by Restarting
Linear-Time Model Checking Branching Processes
Quantified Linear Temporal Logic over Probabilistic Systems with an Application to Vacuity Checking
Concur A2
17:00-18:15
Games 1
Patricia Bouyer
Subgame-Perfect Equilibria in Mean-Payoff Games
Fragility and Robustness in Mean-Payoff Adversarial Stackelberg Games
Continuous Positional Payoffs
Concur A3
14:00-15:15
Nondeterministic and Probabilistic Models
Youssouf Oualhadj
Transience in Countable MDPs
Strategy Complexity of Mean Payoff, Total Payoff and Point Payoff Objectives in Countable MDPs
Model Checking Quantum Continuous-Time Markov Chains
Concur B3
14:00-15:15
Distributed Systems
Daniele Varacca
A Unifying Framework for Deciding Synchronizability
Guard Automata for the Verification of Safety and Liveness of Distributed Algorithms
Dynamic Data-Race Detection Through the Fine-Grained Lens
Concur A4
17:00-18:15
Language Theory
Bernd Finkbeiner
Adaptive Synchronisation of Pushdown Automata
Decomposing Permutation Automata
Concur A5
14:00-15:15
Semantics
Bartek Klin
Algebra and Coalgebra of Stream Products
Formally Verified Simulations of State-Rich Processes Using Interaction Trees in Isabelle/HOL
Fibrational Initial Algebra-Final Coalgebra Coincidence over Initial Algebras:Turning Verification Witnesses Upside Down
Concur B5
14:00-15:15
Temporal Logics and Model Checking
Christel Baier
SMT-Based Model Checking of Max-Plus Linear Systems
A Decidable Non-Regular Modal Fixpoint Logic
A Temporal Logic for Strategic Hyperproperties
Concur A6
17:00-18:15
Games 2
Antonin Kučera
Time Flies When Looking out of the Window: Timed Games with Window Parity Objectives
Arena-Independent Finite-Memory Determinacy in Stochastic Games
Stackelberg-Pareto Synthesis
Concur A7
14:00-15:15
Dynamical Systems
Aiswarya Cyriac
The Orbit Problem for Parametric Linear Dynamical Systems
Scope-Bounded Reachability in Valence Systems
Deciding Polynomial Termination Complexity for VASS Programs
Concur B7
14:00-15:15
Equivalences
Yuxin Deng
Bisimulation by Partitioning Is Ω((m+n)log n)
Explaining Behavioural Inequivalence Generically in Quasilinear Time
Enabling Preserving Bisimulation Equivalence
Concur A8
17:00-18:15
Session Types
Marco Carbone
Sized Types with Usages for Parallel Complexity of Pi-Calculus Processes
Generalising Projection in Asynchronous Multiparty Session Types
Separating Sessions Smoothly
Fmics 1
17:00-18:15
Verification
Ákos Hajdu
FMICS Opening Remarks
Verification of Co-Simulation Algorithms Subject to Algebraic Loops and Adaptive Steps
Automated Verification of Temporal Properties of Ladder Programs
Spatial Model Checking for Smart Stations: Research Challenges
Fmics 2
14:00-15:15
Program Safety & Education
Maurice H. ter Beek
Parametric Faults in Safety Critical Programs
Modular Transformation of Java Exceptions Modulo Errors
On Education and Training in Formal Methods for Industrial Critical Systems
Fmics 3
17:00-17:50
(Event-)B Modeling & Validation
Cristina Seceleanu
Improving SMT Solver Integrations for the Validation of B and Event-B Models
Standard Conformance-by-Construction with Event-B
Fmics 4
14:00-15:15
Formal Analysis
Simon Bliudze
Randomized Reachability Analysis in Uppaal: Fast Error Detection in Timed Systems
Verification of a Mathematical Library of an Autopilot with Frama-C
Formal Analysis of the UNISIG Safety Application Intermediate Sub-Layer
Fmics 5
17:00-18:15
Tools
Anastasia Mavridou
ProB2-UI: A Java-based User Interface for ProB
Intrepid: a Scriptable and Cloud-ready SMT-based Model Checker
Merit and Blame Assignment with Kind 2
Fmics 6
18:30-19:30
Test Generation & Probabilistic Verification
Dejan Nickovic
PSY-TaLiRo: A Python Toolbox for Search-Based Test Generation for Cyber-Physical Systems
Probabilistic Verification for Reliability of a Two-by-Two Network-on-Chip System
FMICS Closing Remarks
Formats 1
14:00-15:15
Session 1: Timed systems
Hsi-Ming Ho
Explaining Safety Violations in Real-Time Systems
On the complexity of timed pattern matching
Formats 2
17:00-18:15
Invited Presentations 1: Timed automata
Krishna S
Robust Controller Synthesis in Timed Büchi Automata: A Symbolic Approach
Urgent Partial Order Reduction for Extended Timed Automata
Formats 3
14:00-15:15
Special Session 1: Synthesis and control
Igor Potapov
Closing the Gap between Discrete Abstractions and Continuous Control: Completeness via Robustness and Controllability
Formal Abstraction and Synthesis of Parametric Stochastic Processes
Formats 4
17:00-17:50
Invited Presentations 2: Timed games
Engel Lefaucheux
On Subgame Perfect Equilibria in Turn-Based Reachability Timed Games
Timed Games and Deterministic Separability
Formats 5
14:00-15:15
Session 2: Verification of timed systems
Mickael Randour
An Integer Static Analysis for Better Extrapolation in Uppaal
Stubborn Set Reduction for Timed Reachability and Safety Games
Formats 6
17:00-18:15
Special Session 2: Verification of nonlinear systems
Sadegh Soudjani
Automatic Dynamic Parallelotope Bundles for Reachability Analysis of Nonlinear Systems
DiffRNN: Differential verification of Recurrent Neural Networks
FORMATS closing session
Qest 1
14:00-15:15
Probabilistic Model Checking
Gethin Norman
A Modest Approach to Dynamic Heuristic Search in Probabilistic Model Checking
Tweaking the Odds in Probabilistic Timed Automata
Quantifying Software Reliability via Model-Counting
Qest 2
17:00-18:15
Quantitative Models and Metamodels: Analysis and Validation
Sabina Rossi
Compositional safe approximation of response time distribution of complex workflows
Transient Analysis of Hierarchical Semi-Markov Process Models with Tool Support in Stateflow
Evaluating the Effectiveness of Metamodels in Emulating Quantitative Models
Qest 3
11:45-13:00
Queueing Systems
Tadeusz Czachorski
Network Calculus for Bounding Delays in Feedforward Networks of FIFO Queueing Systems
SEH: Size Estimate Hedging for Single-Server Queues
An Approximate Bribe Queueing Model for Bid Advising in Cloud Spot Markets
Qest 4
14:00-15:15
Learning and Verification
David Parker
DSMC Evaluation Stages: Fostering Robust and Safe Behavior in Deep Reinforcement Learning
Active and sparse methods in smoothed model checking
Safe Learning for Near-Optimal Scheduling
Qest 5
17:00-17:50
Simulation
Anne Remke
Symbolic Simulation of Railway Timetables under Consideration of Stochastic Dependencies
Simulation of n-dimensional second-order fluid models with different absorbing, reflecting and mixed barriers
Qest 6
14:00-15:15
Performance Evaluation
Marco Gribaudo
Queue Response Times with Server Speed Controlled by Measured Utilizations
Service Demand Distribution Estimation for Microservices Using Markovian Arrival Processes
Performance analysis of work stealing strategies in large scale multi-threaded computing
Qest 7
17:00-18:15
Abstractions and Aggregations
Laura Carnevali
Stationary Distribution Approximations of Markovian Population Models using Aggregation
Reasoning about Proportional Lumpability
Lumpability for Uncertain Continuous-Time Markov Chains
Qest 8
18:30-19:30
Stochastic Models
Verena Wolf
Approximate Diagnosis of Controllable Stochastic Systems Accurate Approximate Diagnosis of (Controllable) Stochastic Systems
Optimizing reachability probabilities for a restricted class of Stochastic Hybrid Automata via Flowpipe-Construction
Attack Trees vs. Fault Trees: two sides of the same coin from different currencies
Express/SOS Invited Talk 1
09:00-10:00
Valentina Castiglioni
Jan Friso Groote
Infinite choice and probability distributions. An open problem: The real hotel
Express/SOS 2
10:30-12:00
Jurriaan Rot
On Decidability of the Bisimilarity on Higher-order Processes with Parameterization
A Game Characterisation for Contrasimilarity
Separating the Expressive Power of Propositional Dynamic and Modal Fixpoint Logics
Express/SOS Invited Talk 2
13:00-14:00
Silvia Ghilezan
Dave Parker
Probabilistic Verification of Concurrent Autonomous Systems
Express/SOS 3
14:00-15:00
Silvia Ghilezan
Minimal session types for the pi-calculus
Minimal Translations from Synchronous Communication to Synchronizing Locks
Express/SOS Invited Talk 3
15:30-16:30
Ornela Dardha
Amal Ahmed
Semantic Soundness for Language Interoperability
Express/SOS 4
16:30-17:00
Ornela Dardha
Language Transformations in the Classroom
SNR Invited Talk 1
14:00-14:50
Stanley Bak
Symbolic and Numeric Challenges in Neural Network Verification Methods
SNR 1
14:50-15:30
Sampling-Based Robust Control of Autonomous Systems with Non-Gaussian noise
Safety and Robustness Verification of Autoencoder based Regression Model using NNV Tool
SNR 2
16:35-16:55
Verification of Sigmoidal Artificial Neural Networks using iSAT
SNR Invited Talk 3
17:00-17:50
Nils Jansen
Safe Planning under Epistemic Uncertainty and Partial Information
SNR 3
17:50-18:15
Model Checking for Rectangular Hybrid Systems: A Quantified Encoding Approach
Trends Invited Talk 2
15:45-16:45
Alexey Gotsman
Rigorous Design of Atomic Transaction Commit Protocols
Trends Invited Talk 3
17:00-18:00
Ilaria Castellani
Event structure semantics for asynchronous multiparty sessions
PM 1
14:00-15:15
PM deployment on large-stack systems
Predictive maintenance for Smart Buildings
System-level prognostics for management of complex assets: Opportunities and Challenges
Detecting HVAC cooling malfunctions in trains
PM 2
15:45-16:45
Data- and ML-based approaches to PM
Predictive Maintenance of COVID-19
Maintaining sleeping giants, using quantitative data to optimise system maintenance
PM 3
17:00-18:15
Boundaries and new promises of PM
Use of Monte Carlo for predicting the failure rate of leading edge CMOS integrated circuits
An interdisciplinary approach to predictive maintenance