Abstract is missing.
- From Hybrid Automata to DAE-Based ModelingAlbert Benveniste, Benoît Caillaud, Mathias Malandain. 3-20 [doi]
- What's Decidable About Discrete Linear Dynamical Systems?Toghrul Karimov, Edon Kelmendi, Joël Ouaknine, James Worrell 0001. 21-38 [doi]
- Symbolic Analysis of Linear Hybrid Automata - 25 Years LaterGoran Frehse, Mirco Giacobbe, Enea Zaffanella. 39-60 [doi]
- An Architecture for Safe Driving AutomationHermann Kopetz. 61-84 [doi]
- Specification and Validation of Autonomous Driving Systems: A Multilevel Semantic FrameworkMarius Bozga, Joseph Sifakis. 85-106 [doi]
- On Specifications and Proofs of Timed CircuitsMatthias Függer, Christoph Lenzen 0001, Ulrich Schmid 0001. 107-130 [doi]
- Asynchronous Correspondences Between Hybrid Trajectory SemanticsPatrick Cousot. 131-159 [doi]
- Generalizing Logical Execution TimeEdward A. Lee, Marten Lohstroh. 160-181 [doi]
- Towards a Grand Unification of Büchi Complementation ConstructionsMoshe Y. Vardi, Seth Fogarty, Yong Li 0031, Yih-Kuen Tsay. 185-207 [doi]
- A Simple Rewrite System for the Normalization of Linear Temporal LogicJavier Esparza, Rubén Rubio, Salomon Sickert. 208-227 [doi]
- A Survey on Satisfiability Checking for the μ-Calculus Through Tree AutomataDaniel Hausmann 0001, Nir Piterman. 228-251 [doi]
- Universal Algorithms for Parity Games and Nested FixpointsMarcin Jurdzinski, Rémi Morvan, K. S. Thejaswini. 252-271 [doi]
- Simulation Relations and Applications in Formal MethodsKim G. Larsen, Christian Schilling, Jirí Srba. 272-291 [doi]
- Fine-Grained Complexity Lower Bounds for Problems in Computer Aided VerificationMonika Henzinger. 292-305 [doi]
- Getting Saturated with InductionMárton Hajdú, Petra Hozzová, Laura Kovács, Giles Reger, Andrei Voronkov. 306-322 [doi]
- On Probabilistic MonitorabilityLuca Aceto, Antonis Achilleos, Elli Anastasiadi, Adrian Francalanza, Anna Ingólfsdóttir, Karoliina Lehtinen, Mathias Ruggaard Pedersen. 325-342 [doi]
- On the Foundations of Cycles in Bayesian NetworksChristel Baier, Clemens Dubslaff, Holger Hermanns, Nikolai Käfer. 343-363 [doi]
- Satisfiability of Quantitative Probabilistic CTL: Rise to the ChallengeMiroslav Chodil, Antonín Kucera 0001, Jan Kretínský. 364-387 [doi]
- Symbolic Verification and Strategy Synthesis for Turn-Based Stochastic GamesMarta Kwiatkowska, Gethin Norman, David Parker 0001, Gabriel Santos. 388-406 [doi]
- Parameter Synthesis in Markov Models: A Gentle SurveyNils Jansen 0001, Sebastian Junges, Joost-Pieter Katoen. 407-437 [doi]
- Convex Lattice Equation SystemsGiorgio Bacci, Giovanni Bacci 0001, Mathias Claus Jensen, Kim G. Larsen. 438-455 [doi]
- Variance Reduction in Stochastic Reaction Networks Using Control VariatesMichael Backenköhler, Luca Bortolussi, Verena Wolf. 456-474 [doi]
- From Interface Automata to HypercontractsInigo Incer, Albert Benveniste, Alberto L. Sangiovanni-Vincentelli, Sanjit A. Seshia. 477-493 [doi]
- Consistency and Persistency in Program Verification: Challenges and OpportunitiesParosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani, Bengt Jonsson 0001, K. Narayan Kumar, Prakash Saivasan. 494-510 [doi]
- Automated Program Repair Using Formal Verification TechniquesHadar Frenkel, Orna Grumberg, Bat-Chen Rothenberg, Sarai Sheinvald. 511-534 [doi]
- Embedded Domain Specific VerifiersRanjit Jhala. 535-553 [doi]
- Software Model Checking: 20 Years and BeyondDirk Beyer 0001, Andreas Podelski. 554-582 [doi]
- T4V: Exploring Neural Network Architectures that Improve the Scalability of Neural Network VerificationVivian Lin, Radoslav Ivanov, James Weimer, Oleg Sokolsky, Insup Lee. 585-603 [doi]
- A Framework for Transforming Specifications in Reinforcement LearningRajeev Alur, Suguman Bansal, Osbert Bastani, Kishor Jothimurugan. 604-624 [doi]
- Robustness Analysis of Continuous-Depth Models with Lagrangian TechniquesSophie A. Neubauer, Radu Grosu. 625-649 [doi]
- Correct-by-Construction Runtime Enforcement in AI - A SurveyBettina Könighofer, Roderick Bloem, Rüdiger Ehlers, Christian Pek. 650-663 [doi]