| 2026 | MFCS | Regular Grammars as Effective Representations of Recognizable Sets of Series-Parallel Graphs. | Marius Bozga, Radu Iosif, Florian Zuleger |
| 2025 | CAV | Counting Abstraction and Decidability for the Verification of Structured Parameterized Networks. | Marius Bozga, Radu Iosif, Arnaud Sangnier, Neven Villani |
| 2025 | LICS | Regular Grammars for Sets of Graphs of Tree-Width 2. | Marius Bozga, Radu Iosif, Florian Zuleger |
| 2024 | LPAR | Tree-Verifiable Graph Grammars. | Mark Chimes, Radu Iosif, Florian Zuleger |
| 2023 | CONCUR | Expressiveness Results for an Inductive Logic of Separated Relations. | Radu Iosif, Florian Zuleger |
| 2022 | CADE | Decision Problems in a Logic for Reasoning About Reconfigurable Distributed Systems. | Marius Bozga, Lucas Bueri, Radu Iosif |
| 2022 | CONCUR | On an Invariance Problem for Parameterized Concurrent Systems. | Marius Bozga, Lucas Bueri, Radu Iosif |
| 2021 | CADE | Unifying Decidable Entailments in Separation Logic with Inductive Definitions. | Mnacho Echenim, Radu Iosif, Nicolas Peltier |
| 2021 | CSL | Decidable Entailments in Separation Logic with Inductive Definitions: Beyond Establishment. | Mnacho Echenim, Radu Iosif, Nicolas Peltier |
| 2020 | LPAR | Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard. | Mnacho Echenim, Radu Iosif, Nicolas Peltier |
| 2020 | TACAS | Structural Invariants for the Verification of Systems with Parameterized Architectures. | Marius Bozga, Javier Esparza, Radu Iosif, Joseph Sifakis, Christoph Welzel |
| 2019 | CAV | Alternating Automata Modulo First Order Theories. | Radu Iosif, Xiao Xu |
| 2019 | FOSSACS | The Bernays-Schnfinkel-Ramsey Class of Separation Logic on Arbitrary Domains. | Mnacho Echenim, Radu Iosif, Nicolas Peltier |
| 2019 | TABLEAUX | Prenex Separation Logic with One Selector Field. | Mnacho Echenim, Radu Iosif, Nicolas Peltier |
| 2019 | TACAS | Checking Deadlock-Freedom of Parametric Component-Based Systems. | Marius Bozga, Radu Iosif, Joseph Sifakis |
| 2019 | TACAS | SL-COMP: Competition of Solvers for Separation Logic. | Mihaela Sighireanu, Juan Antonio Navarro Prez, Andrey Rybalchenko, Nikos Gorogiannis, Radu Iosif, Andrew Reynolds, Cristina Serban, Jens Katelaan, Christoph Matheja, Thomas Noll, Florian Zuleger, Wei-Ngan Chin, Quang Loc Le, Quang-Trung Ta, Ton-Chanh Le, Thanh-Toan Nguyen, Siau-Cheng Khoo, Michal Cyprian, Adam Rogalewicz, Toms Vojnar, Constantin Enea, Ondrej Lengl, Chong Gao, Zhilin Wu |
| 2018 | LPAR | A Complete Cyclic Proof System for Inductive Entailments in First Order Logic. | Radu Iosif, Cristina Serban |
| 2018 | TACAS | Abstraction Refinement for Emptiness Checking of Alternating Data Automata. | Radu Iosif, Xiao Xu |
| 2017 | VMCAI | Reasoning in the Bernays-Schnfinkel-Ramsey Fragment of Separation Logic. | Andrew Reynolds, Radu Iosif, Cristina Serban |
| 2016 | ATVA | How Hard is It to Verify Flat Affine Counter Systems with the Finite Monoid Property? | Radu Iosif, Arnaud Sangnier |
| 2016 | ATVA | A Decision Procedure for Separation Logic in SMT. | Andrew Reynolds, Radu Iosif, Cristina Serban, Tim King |
| 2016 | TACAS | Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems. | Radu Iosif, Adam Rogalewicz, Toms Vojnar |
| 2015 | FCT | Interprocedural Reachability for Flat Integer Programs. | Pierre Ganty, Radu Iosif |
| 2014 | ATVA | Deciding Entailments in Inductive Separation Logic with Tree Automata. | Radu Iosif, Adam Rogalewicz, Toms Vojnar |
| 2014 | VMCAI | Safety Problems Are NP-complete for Flat Integer Programs with Octagonal Loops. | Marius Bozga, Radu Iosif, Filip Konecn |
| 2013 | CADE | The Tree Width of Separation Logic with Recursive Definitions. | Radu Iosif, Adam Rogalewicz, Jir Simcek |
| 2013 | TACAS | Underapproximation of Procedure Summaries for Integer Programs. | Pierre Ganty, Radu Iosif, Filip Konecn |
| 2012 | ATVA | Accelerating Interpolants. | Hossein Hojjat, Radu Iosif, Filip Konecn, Viktor Kuncak, Philipp Rmmer |
| 2012 | FM | A Verification Toolkit for Numerical Transition Systems - Tool Paper. | Hossein Hojjat, Filip Konecn, Florent Garnier, Radu Iosif, Viktor Kuncak, Philipp Rmmer |
| 2012 | TACAS | Deciding Conditional Termination. | Marius Bozga, Radu Iosif, Filip Konecn |
| 2010 | CADE | Tool Demonstration of the FLATA Counter Automata Toolset. | Marius Bozga, Radu Iosif, Filip Konecn, Toms Vojnar |
| 2010 | CAV | Fast Acceleration of Ultimately Periodic Relations. | Marius Bozga, Radu Iosif, Filip Konecn |
| 2009 | CAV | Automatic Verification of Integer Array Programs. | Marius Bozga, Peter Habermehl, Radu Iosif, Filip Konecn, Toms Vojnar |
| 2009 | TACAS | Iterating Octagons. | Marius Bozga, Codruta Grlea, Radu Iosif |
| 2008 | CADE | Quantitative Separation Logic and Programs with Lists. | Marius Bozga, Radu Iosif, Swann Perarnau |
| 2008 | FOSSACS | What Else Is Decidable about Integer Arrays?. | Peter Habermehl, Radu Iosif, Toms Vojnar |
| 2008 | LPAR | A Logic of Singly Indexed Arrays. | Peter Habermehl, Radu Iosif, Toms Vojnar |
| 2007 | ATVA | Proving Termination of Tree Manipulating Programs. | Peter Habermehl, Radu Iosif, Adam Rogalewicz, Toms Vojnar |
| 2007 | VMCAI | On Flat Programs with Lists. | Marius Bozga, Radu Iosif |
| 2006 | CAV | Programs with Lists Are Counter Automata. | Ahmed Bouajjani, Marius Bozga, Peter Habermehl, Radu Iosif, Pierre Moro, Toms Vojnar |
| 2006 | ICALP | Flat Parametric Counter Automata. | Marius Bozga, Radu Iosif, Yassine Lakhnech |
| 2006 | TACAS | Automata-Based Verification of Programs with Tree Updates. | Peter Habermehl, Radu Iosif, Toms Vojnar |
| 2005 | FOSSACS | On Decidability Within the Arithmetic of Addition and Divisibility. | Marius Bozga, Radu Iosif |
| 2004 | SAS | On Logics of Aliasing. | Marius Bozga, Radu Iosif, Yassine Lakhnech |
| 2003 | PEPM | Storeless semantics and alias logic. | Marius Bozga, Radu Iosif, Yassine Lakhnech |
| 2001 | SEKE | Temporal Logic Properties of Java Objects. | Radu Iosif, Riccardo Sisto |
| 2000 | ICSE | Formal verification applied to Java concurrent software. | Radu Iosif |