Radu Iosif

From MaRDI portal
Person:537951

Available identifiers

zbMath Open iosif.raduMaRDI QIDQ537951

List of research outcomes





PublicationDate of PublicationType
On an invariance problem for parameterized concurrent systems2024-08-13Paper
Alternating automata modulo first order theories2024-02-16Paper
Checking deadlock-freedom of parametric component-based systems2023-11-24Paper
Verification of component-based systems with recursive architectures2023-04-20Paper
Program Verification with Separation Logic2023-03-21Paper
Decision problems in a logic for reasoning about reconfigurable distributed systems2022-12-07Paper
Structural Invariants for the Verification of Systems with Parameterized Architectures2022-10-13Paper
Unifying decidable entailments in separation logic with inductive definitions2021-12-01Paper
Entailment is undecidable for symbolic heap separation logic formulæ with non-established inductive rules2021-10-19Paper
Checking deadlock-freedom of parametric component-based systems2021-02-26Paper
Abstraction refinement and antichains for trace inclusion of infinite state systems2021-02-08Paper
The Bernays-Schönfinkel-Ramsey Class of Separation Logic with Uninterpreted Predicates2020-09-11Paper
Prenex separation logic with one selector field2020-05-14Paper
The Bernays-Schönfinkel-Ramsey class of separation logic on arbitrary domains2020-01-28Paper
Abstraction refinement and antichains for trace inclusion of infinite state systems2019-09-17Paper
Abstraction refinement for emptiness checking of alternating data automata2019-09-16Paper
A Complete Cyclic Proof System for Inductive Entailments in First Order Logic2019-07-04Paper
A decision procedure for separation logic in SMT2018-10-25Paper
How hard is it to verify flat affine counter systems with the finite monoid property?2018-10-25Paper
https://portal.mardi4nfdi.de/entity/Q46100862018-04-05Paper
Reasoning in the Bernays-Schönfinkel-Ramsey Fragment of Separation Logic2017-02-21Paper
Deciding Entailments in Inductive Separation Logic with Tree Automata2015-12-17Paper
Interprocedural Reachability for Flat Integer Programs2015-09-29Paper
Safety Problems Are NP-complete for Flat Integer Programs with Octagonal Loops2015-01-13Paper
Deciding conditional termination2014-09-05Paper
Space-reduction strategies for model checking dynamic software2013-08-30Paper
Underapproximation of Procedure Summaries for Integer Programs2013-08-05Paper
The Tree Width of Separation Logic with Recursive Definitions2013-06-14Paper
Accelerating Interpolants2012-11-21Paper
Deciding Conditional Termination2012-06-29Paper
Programs with lists are counter automata2011-05-23Paper
Quantitative separation logic and programs with lists2010-10-08Paper
Fast Acceleration of Ultimately Periodic Relations2010-08-18Paper
Automata-based verification of programs with tree updates2010-02-05Paper
Automata-Based Termination Proofs2009-07-09Paper
Automatic Verification of Integer Array Programs2009-06-30Paper
Flat Parametric Counter Automata2009-06-23Paper
Iterating Octagons2009-03-31Paper
A Logic of Singly Indexed Arrays2009-01-27Paper
Quantitative Separation Logic and Programs with Lists2008-11-27Paper
Proving Termination of Tree Manipulating Programs2008-07-03Paper
What Else Is Decidable about Integer Arrays?2008-04-11Paper
On Flat Programs with Lists2008-04-04Paper
Flat Parametric Counter Automata2007-09-11Paper
Programs with Lists Are Counter Automata2007-09-05Paper
Tools and Algorithms for the Construction and Analysis of Systems2007-05-02Paper
Translating Java for multiple model checkers: The Bandera back-end2006-02-20Paper
Foundations of Software Science and Computational Structures2005-11-10Paper
Static Analysis2005-08-24Paper
https://portal.mardi4nfdi.de/entity/Q47384642004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q27537482001-11-11Paper

Research outcomes over time

This page was built for person: Radu Iosif