Name
Affiliation
Papers
RADU IOSIF
Verimag, Grenoble, France
57
Collaborators
Citations 
PageRank 
61
483
42.44
Referers 
Referees 
References 
688
531
532
Search Limit
100688
Title
Citations
PageRank
Year
Entailment is Undecidable for Symbolic Heap Separation Logic Formulæ with Non-Established Inductive Rules00.342022
Decidable Entailments in Separation Logic with Inductive Definitions - Beyond Establishment.00.342021
Unifying Decidable Entailments In Separation Logic With Inductive Definitions00.342021
Structural Invariants for the Verification of Systems with Parameterized Architectures.00.342020
The Bernays-Schönfinkel-Ramsey Class of Separation Logic with Uninterpreted Predicates00.342020
Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard00.342020
Abstraction Refinement And Antichains For Trace Inclusion Of Infinite State Systems00.342020
Structural Invariants for Parametric Verification of Systems with Almost Linear Architectures.00.342019
The Bernays-Schönfinkel-Ramsey Class of Separation Logic on Arbitrary Domains.00.342019
Alternating Automata Modulo First Order Theories00.342019
SL-COMP: Competition of Solvers for Separation Logic00.342019
Prenex Separation Logic with One Selector Field.00.342019
The Complexity of Prenex Separation Logic with One Selector.00.342018
First Order Alternation.00.342018
Program Verification with Separation Logic.00.342018
An Entailment Checker for Separation Logic with Inductive Definitions.00.342018
Checking deadlock-freedom of parametric component-based systems10.352018
Abstraction Refinement for Emptiness Checking of Alternating Data Automata.00.342018
A Complete Cyclic Proof System for Inductive Entailments in First Order Logic.00.342018
Complete Cyclic Proof Systems for Inductive Entailments.00.342017
The Impact of Alternation.00.342017
Reasoning In The Bernays-Schonfinkel-Ramsey Fragment Of Separation Logic00.342017
How hard is it to verify flat affine counter systems with the finite monoid property ?00.342016
Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems.10.362016
A Decision Procedure for Separation Logic in SMT.50.412016
Interprocedural Reachability for Flat Integer Programs.00.342015
Generating Bounded Languages Using Bounded Control Sets.00.342014
Safety Problems Are Np-Complete For Flat Integer Programs With Octagonal Loops40.412014
Deciding Conditional Termination00.342014
Abstraction Refinement for Trace Inclusion of Data Automata.00.342014
Deciding Entailments in Inductive Separation Logic with Tree Automata.130.572014
Automata-Based Termination Proofs20.412013
The tree width of separation logic with recursive definitions361.032013
Deciding conditional termination120.632013
Underapproximation of procedure summaries for integer programs40.432013
A Verification Toolkit for Numerical Transition Systems - Tool Paper.150.622012
Accelerating interpolants90.502012
Programs with lists are counter automata421.862011
Tool Demonstration of the FLATA Counter Automata Toolset.20.372010
Fast acceleration of ultimately periodic relations361.092010
Flat Parametric Counter Automata261.082009
Automatic Verification of Integer Array Programs220.792009
What else is decidable about integer arrays?271.422008
A Logic of Singly Indexed Arrays60.492008
Proving termination of tree manipulating programs60.572007
On flat programs with lists30.422007
Automata-Based verification of programs with tree updates100.642006
On decidability within the arithmetic of addition and divisibility90.632005
Translating Java for Multiple Model Checkers: The Bandera Back-End80.512005
On Logics of Aliasing110.692004
  • 1
  • 2