| 10:30-12:30
 | TACAS: Grammatical Inference
 Room: HS1, online: link
 Chair: Delia Kesner
 
 
Frits Vaandrager, Bharat Garhewal, Jurriaan Rot and Thorsten Wissmann. A New Approach for Active Automata Learning Based on ApartnessVéronique Bruyère, Guillermo Pérez and Gaëtan Staquet. Learning Realtime One-Counter AutomataRitam Raha, Rajarshi Roy, Nathanaël Fijalkow and Daniel Neider. Scalable Anytime Algorithms for Learning Formulas in Linear Temporal LogicLuca Bortolussi, Giuseppe Maria Gallo, Jan Kretinsky and Laura Nenzi. Learning Model Checking and the Kernel Trick for Signal Temporal Logic on Stochastic Processes [nominated for EASST best paper] | FASE: Trustworthiness & Adaptability
 Room: HS2, online: link
 Chair: Marie-Christine Jakobs
 
Ezio Bartocci, Thomas Ferrère, Thomas Henzinger, Dejan Nickovic and Ana Oliveira Da Costa. Information-flow Interfaces [nominated for EASST best paper]Lukas Grätz, Reiner Hähnle and Richard Bubel. Finding Semantic Bugs FastSebastian Biewer and Holger Hermanns. On the Detection of Doped Software by FalsificationSimon Robillard and Helene Coullon. SMT-Based Planning Synthesis for Distributed System Reconfigurations | FoSSaCS: Automata, Games and Regular LanguagesRoom: Interims HS1, online: link
 Chair: Javier Esparza
 
Udi Boker and Karoliina Lehtinen. Token Games and History-Deterministic Quantitative-AutomataDana Angluin, Timos Antonopoulos, Dana Fisman and Nevin George. Representing Regular Languages of Infinite Words Using Mod 2 Multiplicity AutomataThomas Colcombet, Sam van Gool and Rémi Morvan. First-order separation over countable ordinalsUdi Boker, Karoliina Lehtinen and Salomon Sickert. On the Translation of Automata to Linear Temporal Logic |  | 
| 14:00-16:00
 | TACAS: Verification InferenceRoom: HS1, online: link
 Chair: Simon Robillard
 
Jonas Krämer, Lionel Blatter, Eva Darulova and Mattias Ulbrich. Inferring Interval-Valued Floating-Point PreconditionsDawei Sun and Sayan Mitra. NeuReach: Learning Reachability Functions from SimulationsJason Koenig, Oded Padon, Sharon Shoham and Alex Aiken. Inferring Invariants with Quantifier Alternations: Taming the Search Space ExplosionBrandon Paulsen and Chao Wang. LinSyn: Synthesizing Tight Linear Bounds for Arbitrary Neural Network Activation Functions | FASE: Model-Based EngineeringRoom: HS2, online: link
 Chair: Marielle Stoelinga
 
Alexander Knapp, Markus Roggenbach and Tobias Rosenberger. An Institutional Approach to Communicating UML State MachinesEdouard Batot, Sebastien Gerard and Jordi Cabot. A Survey-Based Feature Model for Software TraceabilityHannes Thaller, Lukas Linsbauer and Alexander Egyed. Semantic Clone Detection via Probabilistic Software ModelingHao Wu. QMaxUSE: A Query-based Verification Tool for UML Class Diagrams with OCL Invariants (Tool Demo)Hassan Hage, M Seferis, Vahid Hashemi and Frank Mantwill. SMC4PEP: Stochastic Model Checking of Product Engineering Processes (Tool Demo) | FoSSaCS: Logic and ComplexityRoom: Interims HS1, online: link
 Chair: Patricia Bouyer
 
Raul Fervari and Alessio Mansutti. Modal Logics and Local Quantifiers: A Zoo in the Elementary HierarchyReijo Jaakkola. Uniform guarded fragmentsDmitry Chistikov, Christoph Haase and Alessio Mansutti. Quantifier elimination for counting extensions of Presburger arithmeticAlessandro Cimatti, Luca Geatti, Nicola Gigante, Angelo Montanari and Stefano Tonetta. A first-order logic characterisation of safety and co-safety languages | ESOP: Semantics and RandomnessRoom: HS3, online: link
 Chair: Ilya Sergey
 
 
Geoff Cruttwell, Bruno Gavranovic, Neil Ghani, Paul Wilson, Fabio Zanasi. Categorical Foundation of Gradient-Based Learning [nominated for EATCS best paper]Daniel Lundén, Joey Öhman, Jan Kudlicka, Viktor Senderov, Fredrik Ronquist, David Broman.Compiling Universal Probabilistic Programming Languages with Efficient Parallel Sequential Monte Carlo InferenceKevin Batz, Ira Fesefeldt, Marvin Jansen, Joost-Pieter Katoen, Florian Kessler, Christoph Matheja, Thomas Noll. Foundations for Entailment Checking in Quantitative Separation LogicHideki Tsuiki, Ulrich Berger. Extracting total Amb programs from proofs | 
| 16:30-18:00
 | TACAS: Short papersRoom: HS1, online: link
 Chair: Alexander Knapp
 
Keigo Imai, Julien Lange and Rumyana Neykova. Kmclib: Automated Inference and Verification of Session Types from OCaml ProgramsIvan Perez, Anastasia Mavridou, Tom Pressburger, Alwyn Goodloe and Dimitra Giannakopoulou. Automated Translation of Natural Language Requirements to Runtime MonitorsLuciano Putruele, Ramiro Demasi, Pablo Castro and Pedro R. D'Argenio. MaskD: A Tool for Measuring Masking Fault-ToleranceAleksandar Chakarov, Aleksandr Fedchin, Zvonimir Rakamarić and Neha Rungta. Better Counterexamples for Dafny | Invited tutorial: Nicholas Lane / Pedro Porto Buarque de Gusmão
 Federated Learning with Flower Room: Interims HS1, online: linkChair: Dirk Beyer
 
   |