default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRadu Iosif
Person information
- affiliation: IMAG, Grenoble, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c52]Mark Chimes, Radu Iosif, Florian Zuleger:
Tree-Verifiable Graph Grammars. LPAR 2024: 165-180- [i33]Lucas Bueri, Radu Iosif, Florian Zuleger:
Effective MSO-Definability for Tree-width Bounded Models of an Inductive Separation Logic of Relations. CoRR abs/2402.16150 (2024) - [i32]Mark Chimes, Radu Iosif, Florian Zuleger:
Tree-Verifiable Graph Grammars. CoRR abs/2402.17015 (2024) - [i31]Marius Bozga, Radu Iosif, Florian Zuleger:
Regular Grammars for Graph Sets of Tree-Width ≤. CoRR abs/2408.01226 (2024) - 2023
- [j18]Marius Bozga
, Radu Iosif, Joseph Sifakis:
Verification of component-based systems with recursive architectures. Theor. Comput. Sci. 940(Part): 146-175 (2023) - [c51]Radu Iosif, Florian Zuleger:
Expressiveness Results for an Inductive Logic of Separated Relations. CONCUR 2023: 20:1-20:20 - [i30]Radu Iosif, Florian Zuleger:
Expressiveness Results for an Inductive Logic of Separated Relations. CoRR abs/2307.02381 (2023) - [i29]Radu Iosif, Florian Zuleger:
Characterizations of Definable Context-Free Graphs. CoRR abs/2310.04764 (2023) - [i28]Marius Bozga, Lucas Bueri, Radu Iosif, Florian Zuleger:
The Treewidth Boundedness Problem for an Inductive Separation Logic of Relations. CoRR abs/2310.09542 (2023) - 2022
- [j17]Mnacho Echenim, Radu Iosif, Nicolas Peltier:
Entailment is Undecidable for Symbolic Heap Separation Logic Formulæ with Non-Established Inductive Rules. Inf. Process. Lett. 173: 106169 (2022) - [j16]Emma Ahrens, Marius Bozga, Radu Iosif, Joost-Pieter Katoen:
Reasoning about distributed reconfigurable systems. Proc. ACM Program. Lang. 6(OOPSLA2): 145-174 (2022) - [c50]Marius Bozga, Lucas Bueri, Radu Iosif:
Decision Problems in a Logic for Reasoning About Reconfigurable Distributed Systems. IJCAR 2022: 691-711 - [c49]Marius Bozga, Lucas Bueri, Radu Iosif:
On an Invariance Problem for Parameterized Concurrent Systems. CONCUR 2022: 24:1-24:16 - [i27]Marius Bozga, Lucas Bueri, Radu Iosif:
Decision Problems in a Logic for Reasoning about Reconfigurable Distributed Systems. CoRR abs/2202.09637 (2022) - [i26]Marius Bozga, Lucas Bueri, Radu Iosif:
On an Invariance Problem for Parameterized Concurrent Systems. CoRR abs/2204.12117 (2022) - [i25]Radu Iosif, Florian Zuleger:
On the Expressiveness of a Logic of Separated Relations. CoRR abs/2208.01520 (2022) - 2021
- [j15]Marius Bozga, Radu Iosif, Joseph Sifakis:
Checking deadlock-freedom of parametric component-based systems. J. Log. Algebraic Methods Program. 119: 100621 (2021) - [c48]Mnacho Echenim, Radu Iosif, Nicolas Peltier:
Unifying Decidable Entailments in Separation Logic with Inductive Definitions. CADE 2021: 183-199 - [c47]Mnacho Echenim, Radu Iosif, Nicolas Peltier:
Decidable Entailments in Separation Logic with Inductive Definitions: Beyond Establishment. CSL 2021: 20:1-20:18 - [c46]Marius Bozga, Radu Iosif:
Specification and Safety Verification of Parametric Hierarchical Distributed Systems. FACS 2021: 95-114 - [i24]Emma Ahrens, Marius Bozga, Radu Iosif, Joost-Pieter Katoen:
Local Reasoning about Parameterized Reconfigurable Distributed Systems. CoRR abs/2107.05253 (2021) - [i23]Marius Bozga, Radu Iosif, Joseph Sifakis:
Verification of Component-based Systems with Recursive Architectures. CoRR abs/2112.08292 (2021) - 2020
- [j14]Lukás Holík, Radu Iosif, Adam Rogalewicz, Tomás Vojnar:
Abstraction refinement and antichains for trace inclusion of infinite state systems. Formal Methods Syst. Des. 55(3): 137-170 (2020) - [j13]Mnacho Echenim, Radu Iosif, Nicolas Peltier:
The Bernays-Schönfinkel-Ramsey Class of Separation Logic with Uninterpreted Predicates. ACM Trans. Comput. Log. 21(3): 19:1-19:46 (2020) - [c45]Mnacho Echenim, Radu Iosif, Nicolas Peltier:
Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard. LPAR 2020: 191-211 - [c44]Marius Bozga, Javier Esparza, Radu Iosif, Joseph Sifakis, Christoph Welzel:
Structural Invariants for the Verification of Systems with Parameterized Architectures. TACAS (1) 2020: 228-246 - [i22]Marius Bozga, Javier Esparza, Radu Iosif, Joseph Sifakis, Christoph Welzel:
Structural Invariants for the Verification of Systems with Parameterized Architectures. CoRR abs/2002.07672 (2020) - [i21]Mnacho Echenim, Radu Iosif, Nicolas Peltier:
Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard. CoRR abs/2004.07578 (2020) - [i20]Mnacho Echenim, Radu Iosif, Nicolas Peltier:
Decidable Entailments in Separation Logic with Inductive Definitions: Beyond Established Systems. CoRR abs/2007.00502 (2020) - [i19]Marius Bozga, Radu Iosif:
Verifying Safety Properties of Inductively Defined Parameterized Systems. CoRR abs/2008.04160 (2020) - [i18]Mnacho Echenim, Radu Iosif, Nicolas Peltier:
Checking Entailment Between Separation Logic Symbolic Heaps: Beyond Connected and Established Systems. CoRR abs/2012.14361 (2020)
2010 – 2019
- 2019
- [c43]Radu Iosif, Xiao Xu:
Alternating Automata Modulo First Order Theories. CAV (2) 2019: 43-63 - [c42]Mnacho Echenim, Radu Iosif, Nicolas Peltier:
The Bernays-Schönfinkel-Ramsey Class of Separation Logic on Arbitrary Domains. FoSSaCS 2019: 242-259 - [c41]Mnacho Echenim, Radu Iosif, Nicolas Peltier:
Prenex Separation Logic with One Selector Field. TABLEAUX 2019: 409-427 - [c40]Marius Bozga, Radu Iosif, Joseph Sifakis:
Checking Deadlock-Freedom of Parametric Component-Based Systems. TACAS (2) 2019: 3-20 - [c39]Mihaela Sighireanu, Juan Antonio Navarro Pérez, 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, Tomás Vojnar, Constantin Enea, Ondrej Lengál, Chong Gao, Zhilin Wu:
SL-COMP: Competition of Solvers for Separation Logic. TACAS (3) 2019: 116-132 - [i17]Marius Bozga, Radu Iosif, Joseph Sifakis:
Structural Invariants for Parametric Verification of Systems with Almost Linear Architectures. CoRR abs/1902.02696 (2019) - [i16]Marius Bozga, Radu Iosif, Joseph Sifakis:
Local Reasoning about Parametric and Reconfigurable Component-based Systems. CoRR abs/1908.11345 (2019) - 2018
- [j12]Cristina Serban, Radu Iosif:
An Entailment Checker for Separation Logic with Inductive Definitions. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 76 (2018) - [c38]Radu Iosif, Cristina Serban:
A Complete Cyclic Proof System for Inductive Entailments in First Order Logic. LPAR 2018: 435-453 - [c37]Radu Iosif:
Program Verification with Separation Logic. SPIN 2018: 48-62 - [c36]Radu Iosif, Xiao Xu:
Abstraction Refinement for Emptiness Checking of Alternating Data Automata. TACAS (2) 2018: 93-111 - [i15]Mnacho Echenim, Radu Iosif, Nicolas Peltier:
On the Expressive Completeness of Bernays-Schönfinkel-Ramsey Separation Logic. CoRR abs/1802.00195 (2018) - [i14]Mnacho Echenim, Radu Iosif, Nicolas Peltier:
The Complexity of Prenex Separation Logic with One Selector. CoRR abs/1804.03556 (2018) - [i13]Marius Bozga, Radu Iosif, Joseph Sifakis:
Checking Deadlock-Freedom of Parametric Component-Based Systems. CoRR abs/1805.10073 (2018) - [i12]Radu Iosif, Xiao Xu:
First Order Alternation. CoRR abs/1811.02398 (2018) - 2017
- [j11]Pierre Ganty, Radu Iosif, Filip Konecný:
Underapproximation of procedure summaries for integer programs. Int. J. Softw. Tools Technol. Transf. 19(5): 565-584 (2017) - [c35]Andrew Reynolds, Radu Iosif, Cristina Serban:
Reasoning in the Bernays-Schönfinkel-Ramsey Fragment of Separation Logic. VMCAI 2017: 462-482 - [i11]Radu Iosif, Xiao Xu:
The Impact of Alternation. CoRR abs/1705.05606 (2017) - [i10]Radu Iosif, Cristina Serban:
Complete Cyclic Proof Systems for Inductive Entailments. CoRR abs/1707.02415 (2017) - 2016
- [c34]Radu Iosif, Arnaud Sangnier:
How Hard is It to Verify Flat Affine Counter Systems with the Finite Monoid Property? ATVA 2016: 89-105 - [c33]Andrew Reynolds, Radu Iosif, Cristina Serban, Tim King:
A Decision Procedure for Separation Logic in SMT. ATVA 2016: 244-261 - [c32]Radu Iosif, Adam Rogalewicz, Tomás Vojnar:
Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems. TACAS 2016: 71-89 - [i9]Andrew Reynolds, Radu Iosif, Tim King:
A Decision Procedure for Separation Logic in SMT. CoRR abs/1603.06844 (2016) - [i8]Radu Iosif, Arnaud Sangnier:
How hard is it to verify flat affine counter systems with the finite monoid property ? CoRR abs/1605.05836 (2016) - [i7]Andrew Reynolds, Radu Iosif, Cristina Serban:
Reasoning in the Bernays-Schoenfinkel-Ramsey Fragment of Separation Logic. CoRR abs/1610.04707 (2016) - 2015
- [c31]Pierre Ganty, Radu Iosif:
Interprocedural Reachability for Flat Integer Programs. FCT 2015: 133-145 - 2014
- [j10]Marius Bozga, Radu Iosif, Filip Konecný:
Deciding Conditional Termination. Log. Methods Comput. Sci. 10(3) (2014) - [c30]Radu Iosif, Adam Rogalewicz, Tomás Vojnar:
Deciding Entailments in Inductive Separation Logic with Tree Automata. ATVA 2014: 201-218 - [c29]Marius Bozga, Radu Iosif, Filip Konecný:
Safety Problems Are NP-complete for Flat Integer Programs with Octagonal Loops. VMCAI 2014: 242-261 - [i6]Radu Iosif, Adam Rogalewicz, Tomás Vojnar:
Deciding Entailments in Inductive Separation Logic with Tree Automata. CoRR abs/1402.2127 (2014) - [i5]Pierre Ganty, Radu Iosif:
Generating Bounded Languages Using Bounded Control Sets. CoRR abs/1405.3069 (2014) - [i4]Radu Iosif, Adam Rogalewicz, Tomás Vojnar:
Abstraction Refinement for Trace Inclusion of Data Automata. CoRR abs/1410.5056 (2014) - 2013
- [j9]Radu Iosif, Adam Rogalewicz:
Automata-Based Termination Proofs. Comput. Informatics 32(4): 739-775 (2013) - [c28]Radu Iosif, Adam Rogalewicz, Jirí Simácek:
The Tree Width of Separation Logic with Recursive Definitions. CADE 2013: 21-38 - [c27]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ý:
Safety Problems are NP-complete for Flat Integer Programs with Octagonal Loops. CoRR abs/1307.5321 (2013) - 2012
- [c26]Hossein Hojjat, Radu Iosif, Filip Konecný, Viktor Kuncak, Philipp Rümmer:
Accelerating Interpolants. ATVA 2012: 187-202 - [c25]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 - [c24]Marius Bozga, Radu Iosif, Filip Konecný:
Deciding Conditional Termination. TACAS 2012: 252-266 - [i1]Pierre Ganty, Radu Iosif, Filip Konecný:
Underapproximation of Procedure Summaries for Integer Programs. CoRR abs/1210.4289 (2012) - 2011
- [j8]Ahmed Bouajjani, Marius Bozga, Peter Habermehl, Radu Iosif, Pierre Moro, Tomás Vojnar:
Programs with lists are counter automata. Formal Methods Syst. Des. 38(2): 158-192 (2011) - 2010
- [j7]Peter Habermehl, Radu Iosif, Tomás Vojnar:
Automata-based verification of programs with tree updates. Acta Informatica 47(1): 1-31 (2010) - [j6]Marius Bozga, Radu Iosif, Swann Perarnau:
Quantitative Separation Logic and Programs with Lists. J. Autom. Reason. 45(2): 131-156 (2010) - [c23]Marius Bozga, Radu Iosif, Filip Konecný, Tomás Vojnar:
Tool Demonstration of the FLATA Counter Automata Toolset. WING@ETAPS/IJCAR 2010: 75 - [c22]Marius Bozga, Radu Iosif, Filip Konecný:
Fast Acceleration of Ultimately Periodic Relations. CAV 2010: 227-242
2000 – 2009
- 2009
- [j5]Marius Bozga, Radu Iosif, Yassine Lakhnech:
Flat Parametric Counter Automata. Fundam. Informaticae 91(2): 275-303 (2009) - [c21]Marius Bozga, Peter Habermehl, Radu Iosif, Filip Konecný, Tomás Vojnar:
Automatic Verification of Integer Array Programs. CAV 2009: 157-172 - [c20]Marius Bozga, Codruta Gîrlea, Radu Iosif:
Iterating Octagons. TACAS 2009: 337-351 - [c19]Radu Iosif, Adam Rogalewicz:
Automata-Based Termination Proofs. CIAA 2009: 165-177 - 2008
- [c18]Marius Bozga, Radu Iosif, Swann Perarnau:
Quantitative Separation Logic and Programs with Lists. IJCAR 2008: 34-49 - [c17]Peter Habermehl, Radu Iosif, Tomás Vojnar:
What Else Is Decidable about Integer Arrays?. FoSSaCS 2008: 474-489 - [c16]Peter Habermehl, Radu Iosif, Tomás Vojnar:
A Logic of Singly Indexed Arrays. LPAR 2008: 558-573 - 2007
- [c15]Peter Habermehl, Radu Iosif, Adam Rogalewicz, Tomás Vojnar:
Proving Termination of Tree Manipulating Programs. ATVA 2007: 145-161 - [c14]Marius Bozga, Radu Iosif:
On Flat Programs with Lists. VMCAI 2007: 122-136 - 2006
- [c13]Ahmed Bouajjani, Marius Bozga, Peter Habermehl, Radu Iosif, Pierre Moro, Tomás Vojnar:
Programs with Lists Are Counter Automata. CAV 2006: 517-531 - [c12]Marius Bozga, Radu Iosif, Yassine Lakhnech:
Flat Parametric Counter Automata. ICALP (2) 2006: 577-588 - [c11]Peter Habermehl, Radu Iosif, Tomás Vojnar:
Automata-Based Verification of Programs with Tree Updates. TACAS 2006: 350-364 - 2005
- [j4]Radu Iosif, Matthew B. Dwyer, John Hatcliff:
Translating Java for Multiple Model Checkers: The Bandera Back-End. Formal Methods Syst. Des. 26(2): 137-180 (2005) - [c10]Marius Bozga, Radu Iosif:
On Decidability Within the Arithmetic of Addition and Divisibility. FoSSaCS 2005: 425-439 - 2004
- [j3]Radu Iosif:
Symmetry reductions for model checking of concurrent dynamic software. Int. J. Softw. Tools Technol. Transf. 6(4): 302-319 (2004) - [c9]Marius Bozga, Radu Iosif, Yassine Lakhnech:
On Logics of Aliasing. SAS 2004: 344-360 - 2003
- [j2]Radu Iosif, Riccardo Sisto:
Temporal logic properties of Java objects. J. Syst. Softw. 68(3): 243-251 (2003) - [c8]Marius Bozga, Radu Iosif, Yassine Lakhnech:
Storeless semantics and alias logic. PEPM 2003: 55-65 - [c7]Robby, Matthew B. Dwyer, John Hatcliff, Radu Iosif:
Space-Reduction Strategies for Model Checking Dynamic Software. SoftMC@CAV 2003: 499-517 - 2002
- [c6]Radu Iosif:
Symmetry Reduction Criteria for Software Model Checking. SPIN 2002: 22-41 - 2001
- [c5]Radu Iosif:
Exploiting Heap Symmetries in Explicit-State Model Checking of Software. ASE 2001: 254-261 - [c4]Radu Iosif, Riccardo Sisto:
Temporal Logic Properties of Java Objects. SEKE 2001: 120-127 - 2000
- [c3]Radu Iosif:
Formal verification applied to Java concurrent software. ICSE 2000: 707-709 - [c2]Radu Iosif, Riccardo Sisto:
Using Garbage Collection in Model Checking. SPIN 2000: 20-33
1990 – 1999
- 1999
- [j1]Claudio Demartini, Radu Iosif, Riccardo Sisto:
A Deadlock Detection Tool for Concurrent Java Programs. Softw. Pract. Exp. 29(7): 577-603 (1999) - [c1]Claudio Demartini, Radu Iosif, Riccardo Sisto:
dSPIN: A Dynamic Extension of SPIN. SPIN 1999: 261-276
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 01:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
