Author:Radu Iosif

Publications
Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard Mnacho Echenim, Radu Iosif and Nicolas Peltier EasyChair Preprint 4877
The Complexity of Prenex Separation Logic with One Selector Mnacho Echenim, Radu Iosif and Nicolas Peltier EasyChair Preprint 433
Tree-Verifiable Graph Grammars Mark Chimes, Radu Iosif and Florian Zuleger In:Proceedings of 25th Conference on Logic for Programming, Artificial Intelligence and Reasoning
Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard Mnacho Echenim, Radu Iosif and Nicolas Peltier In:LPAR23. LPAR-23: 23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning
A Complete Cyclic Proof System for Inductive Entailments in First Order Logic Radu Iosif and Cristina Serban In:LPAR-22. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning
Tool Demonstration of the FLATA Counter Automata Toolset Marius Bozga, Radu Iosif, Filip Konecny and Tomas Vojnar In:WING 2010. Workshop on Invariant Generation 2010

Keyphrases

acceleration, alternating Turing machines², antichain-based tree automata language inclusion, bounded tree-width, complexity³, counter automata, cyclic proofs, decidability, graph grammars, induction², inductive definitions, infinite descent, lists, magic wand, monadic second-order logic, reachability, separation logic³.