| 2019 | Syntactic Partial Order Compression for Probabilistic Reachability. | Gereon Fox, Daniel Stan, Holger Hermanns |
| 2019 | Lazy but Effective Functional Synthesis. | Grigory Fedyukovich, Arie Gurfinkel, Aarti Gupta |
| 2019 | Flat Model Checking for Counting LTL Using Quantifier-Free Presburger Arithmetic. | Normann Decker, Anton Pirogov |
| 2019 | euforia: Complete Software Model Checking with Uninterpreted Functions. | Denis Bueno, Karem A. Sakallah |
| 2019 | Disjunctive Relational Abstract Interpretation for Interprocedural Program Analysis. | Rmy Boutonnet, Nicolas Halbwachs |
| 2019 | Exploiting Pointer Analysis in Memory Models for Deductive Verification. | Quentin Bouillaguet, Franois Bobot, Mihaela Sighireanu, Boris Yakobowski |
| 2019 | Static Analysis of Binary Code with Memory Indirections Using Polyhedra. | Clment Ballabriga, Julien Forget, Laure Gonnord, Giuseppe Lipari, Jordy Ruiz |
| 2019 | Verification of an Industrial Asynchronous Leader Election Algorithm Using Abstractions and Parametric Model Checking. | tienne Andr, Laurent Fribourg, Jean-Marc Mota, Romain Soulat |
| 2019 | Parametric Timed Broadcast Protocols. | tienne Andr, Benot Delahaye, Paulin Fournier, Didier Lime |
| 2018 | P^5 : Planner-less Proofs of Probabilistic Parameterized Protocols. | Lenore D. Zuck, Kenneth L. McMillan, Jordan Torf |
| 2018 | An Abstract Interpretation Framework for the Round-Off Error Analysis of Floating-Point Programs. | Laura Titolo, Marco A. Feli, Mariano M. Moscato, Csar A. Muoz |
| 2018 | Selfless Interpolation for Infinite-State Model Checking. | Tanja Schindler, Dejan Jovanovic |
| 2018 | Revisiting MITL to Fix Decision Procedures. | Nima Roohi, Mahesh Viswanathan |
| 2018 | On Constructivity of Galois Connections. | Francesco Ranzato |
| 2018 | A Logical System for Modular Information Flow Verification. | Adi Prabawa, Mahmudul Faisal Al Ameen, Benedict Lee, Wei-Ngan Chin |
| 2018 | Generating Tests by Example. | Hila Peleg, Dan Rasin, Eran Yahav |
| 2018 | Abstraction-Based Interaction Model for Synthesis. | Hila Peleg, Shachar Itzhaky, Sharon Shoham |
| 2018 | Co-Design and Verification of an Available File System. | Mahsa Najafzadeh, Marc Shapiro, Patrick Eugster |
| 2018 | Learning to Complement Bchi Automata. | Yong Li, Andrea Turrini, Lijun Zhang, Sven Schewe |
| 2018 | Modular Analysis of Executables Using On-Demand Heyting Completion. | Julian Kranz, Axel Simon |
| 2018 | Refinement Types for Ruby. | Milod Kazerounian, Niki Vazou, Austin Bourgerie, Jeffrey S. Foster, Emina Torlak |
| 2018 | Analyzing Guarded Protocols: Better Cutoffs, More Systems, More Expressivity. | Swen Jacobs, Mouhammad Sakr |
| 2018 | Invariant Generation for Multi-Path Loops with Polynomial Assignments. | Andreas Humenberger, Maximilian Jaroschek, Laura Kovcs |
| 2018 | From Shapes to Amortized Complexity. | Toms Fiedor, Luks Holk, Adam Rogalewicz, Moritz Sinn, Toms Vojnar, Florian Zuleger |
| 2018 | On abstraction and compositionality for weak-memory linearisability. | Brijesh Dongol, Radha Jagadeesan, James Riely, Alasdair Armstrong |