- Storeless Semantics and Alias Logic Marius Bozga
- An Efficient Algorithm for the Computation of Optimum Paths
- Automata-based Termination Proofs Radu Iosif1 and Adam Rogalewicz2
- UNCORRECTEDPROOF 2 Temporal logic properties of Java objects
- What else is decidable about integer arrays? Peter Habermehl1, Radu Iosif2, and Tomas Vojnar3
- Software Tools for Technology Transfer manuscript No. (will be inserted by the editor)
- Proving Termination of Tree Manipulating Programs Peter Habermehl 1 , Radu Iosif 2 , Adam Rogalewicz 2 , and Tomas Vojnar 3
- Programs with Lists are Counter Automata # Ahmed Bouajjani 2 , Marius Bozga 1 , Peter Habermehl 2 , Radu Iosif 1 ,
- SoftMC'03 Preliminary Version SpaceReduction Strategies for Model Checking
- On Flat Programs with Lists Marius Bozga 1 and Radu Iosif 1
- Iterating Octagons Marius Bozga 1 , Codruta Grlea 1 , and Radu Iosif 1
- Noname manuscript No. (will be inserted by the editor)
- A Logic of Singly Indexed Arrays # Peter Habermehl 1 , Radu Iosif 2 , and Tomas Vojnar 3
- On Decidability within the Arithmetic of Addition and Divisibility
- Translating Java for Multiple Model Checkers: the Bandera Radu Iosif, Matthew B. Dwyer and John Hatcli
- Fundamenta Informaticae XX (2008) 1--29 1 Flat Parametric Counter Automata
- Automatic Verification of Integer Array Programs # Marius Bozga 1 , Peter Habermehl 2 , Radu Iosif 1 , Filip Konecny 1,3 , and Tomas Vojnar 3
- Symmetry Reduction Criteria for Software Model Checking ?
- On Model Checking Generic Topologies Marius Bozga and Radu Iosif
- On Logics of Aliasing Marius Bozga, Radu Iosif and Yassine Lakhnech
- Quantitative Separation Logic and Programs with Lists Marius Bozga, Radu Iosif, and Swann Perarnau
