| 2013 | ||
|---|---|---|
| c25 | Pierre Ganty, Radu Iosif, Filip Konecný: Underapproximation of Procedure Summaries for Integer Programs. TACAS 2013: 245-259 | |
| i3 | Radu Iosif, Adam Rogalewicz, Jirí Simácek: The Tree Width of Separation Logic with Recursive Definitions. CoRR abs/1301.5139 (2013) | |
| i2 | Marius Bozga, Radu Iosif, Filip Konecný: Deciding Conditional Termination. CoRR abs/1302.2762 (2013) | |
| 2012 | ||
| c24 | Hossein Hojjat, Radu Iosif, Filip Konecný, Viktor Kuncak, Philipp Rümmer: Accelerating Interpolants. ATVA 2012: 187-202 | |
| c23 | Hossein Hojjat, Filip Konecný, Florent Garnier, Radu Iosif, Viktor Kuncak, Philipp Rümmer: A Verification Toolkit for Numerical Transition Systems - Tool Paper. FM 2012: 247-251 | |
| c22 | ||
| i1 | Pierre Ganty, Radu Iosif, Filip Konecný: Underapproximation of Procedure Summaries for Integer Programs. CoRR abs/1210.4289 (2012) | |
| 2011 | ||
| j9 | Ahmed Bouajjani, Marius Bozga, Peter Habermehl, Radu Iosif, Pierre Moro, Tomás Vojnar: Programs with lists are counter automata. Formal Methods in System Design 38(2): 158-192 (2011) | |
| 2010 | ||
| j8 | Peter Habermehl, Radu Iosif, Tomás Vojnar: Automata-based verification of programs with tree updates. Acta Inf. 47(1): 1-31 (2010) | |
| j7 | Marius Bozga, Radu Iosif, Swann Perarnau: Quantitative Separation Logic and Programs with Lists. J. Autom. Reasoning 45(2): 131-156 (2010) | |
| c21 | Marius Bozga, Radu Iosif, Filip Konecný: Fast Acceleration of Ultimately Periodic Relations. CAV 2010: 227-242 | |
| 2009 | ||
| j6 | Marius Bozga, Radu Iosif, Yassine Lakhnech: Flat Parametric Counter Automata. Fundam. Inform. 91(2): 275-303 (2009) | |
| c20 | Marius Bozga, Peter Habermehl, Radu Iosif, Filip Konecný, Tomás Vojnar: Automatic Verification of Integer Array Programs. CAV 2009: 157-172 | |
| c19 | ||
| c18 | ||
| 2008 | ||
| c17 | Marius Bozga, Radu Iosif, Swann Perarnau: Quantitative Separation Logic and Programs with Lists. IJCAR 2008: 34-49 | |
| c16 | Peter Habermehl, Radu Iosif, Tomás Vojnar: What Else Is Decidable about Integer Arrays?. FoSSaCS 2008: 474-489 | |
| c15 | ||
| 2007 | ||
| c14 | Peter Habermehl, Radu Iosif, Adam Rogalewicz, Tomás Vojnar: Proving Termination of Tree Manipulating Programs. ATVA 2007: 145-161 | |
| c13 | ||
| 2006 | ||
| c12 | Ahmed Bouajjani, Marius Bozga, Peter Habermehl, Radu Iosif, Pierre Moro, Tomás Vojnar: Programs with Lists Are Counter Automata. CAV 2006: 517-531 | |
| c11 | Marius Bozga, Radu Iosif, Yassine Lakhnech: Flat Parametric Counter Automata. ICALP (2) 2006: 577-588 | |
| c10 | Peter Habermehl, Radu Iosif, Tomás Vojnar: Automata-Based Verification of Programs with Tree Updates. TACAS 2006: 350-364 | |
| 2005 | ||
| j5 | Radu Iosif, Matthew B. Dwyer, John Hatcliff: Translating Java for Multiple Model Checkers: The Bandera Back-End. Formal Methods in System Design 26(2): 137-180 (2005) | |
| c9 | Marius Bozga, Radu Iosif: On Decidability Within the Arithmetic of Addition and Divisibility. FoSSaCS 2005: 425-439 | |
| 2004 | ||
| j4 | Radu Iosif: Symmetry reductions for model checking of concurrent dynamic software. STTT 6(4): 302-319 (2004) | |
| c8 | ||
| 2003 | ||
| j3 | Robby, Matthew B. Dwyer, John Hatcliff, Radu Iosif: Space-Reduction Strategies for Model Checking Dynamic Software. Electr. Notes Theor. Comput. Sci. 89(3): 499-517 (2003) | |
| j2 | Radu Iosif, Riccardo Sisto: Temporal logic properties of Java objects. Journal of Systems and Software 68(3): 243-251 (2003) | |
| c7 | ||
| 2002 | ||
| c6 | ||
| 2001 | ||
| c5 | Radu Iosif: Exploiting Heap Symmetries in Explicit-State Model Checking of Software. ASE 2001: 254-261 | |
| c4 | ||
| 2000 | ||
| c3 | ||
| c2 | ||
| 1999 | ||
| j1 | Claudio Demartini, Radu Iosif, Riccardo Sisto: A Deadlock Detection Tool for Concurrent Java Programs. Softw., Pract. Exper. 29(7): 577-603 (1999) | |
| c1 | Claudio Demartini, Radu Iosif, Riccardo Sisto: dSPIN: A Dynamic Extension of SPIN. SPIN 1999: 261-276 | |
Colors in the list of coauthors
Last update Mon May 20 18:33:31 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page