( en | de | ru )

 

Disambiguation of "Iosif, Radu"

Author of the publication

copydeleteadd this publication to your clipboard
How Hard is It to Verify Flat Affine Counter Systems with the Finite Monoid Property?

, and . ATVA, volume 9938 of Lecture Notes in Computer Science, page 89-105. (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Philip Iosifidis

Iosif Ioannidis

Iosif Karadedos

Iosif Antochi

Iosif Mariakakis

 

Other publications of authors with the same name

A Deadlock Detection Tool for Concurrent Java Programs., , and . Softw. Pract. Exp., 29 (7): 577-603 (1999)Temporal Logic Properties of Java Objects., and . SEKE, page 120-127. (2001)Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard., , and . LPAR, volume 73 of EPiC Series in Computing, page 191-211. EasyChair, (2020)The Bernays-Schönfinkel-Ramsey Class of Separation Logic on Arbitrary Domains., , and . FoSSaCS, volume 11425 of Lecture Notes in Computer Science, page 242-259. Springer, (2019)Interprocedural Reachability for Flat Integer Programs., and . FCT, volume 9210 of Lecture Notes in Computer Science, page 133-145. Springer, (2015)Decidable Entailments in Separation Logic with Inductive Definitions: Beyond Establishment., , and . CSL, volume 183 of LIPIcs, page 20:1-20:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems., , and . TACAS, volume 9636 of Lecture Notes in Computer Science, page 71-89. Springer, (2016)A Complete Cyclic Proof System for Inductive Entailments in First Order Logic., and . LPAR, volume 57 of EPiC Series in Computing, page 435-453. EasyChair, (2018)Deciding Entailments in Inductive Separation Logic with Tree Automata., , and . ATVA, volume 8837 of Lecture Notes in Computer Science, page 201-218. Springer, (2014)Entailment is Undecidable for Symbolic Heap Separation Logic Formulæ with Non-Established Inductive Rules., , and . Inf. Process. Lett., (2022)