( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Structural Invariants for the Verification of Systems with Parameterized Architectures.

, , , , и . TACAS (1), том 12078 из Lecture Notes in Computer Science, стр. 228-246. Springer, (2020)

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.

Philip Iosifidis

Iosif Ioannidis

Iosif Karadedos

Iosif Antochi

Iosif Nachmias

 

Другие публикации лиц с тем же именем

A Complete Cyclic Proof System for Inductive Entailments in First Order Logic., и . LPAR, том 57 из EPiC Series in Computing, стр. 435-453. EasyChair, (2018)Deciding Entailments in Inductive Separation Logic with Tree Automata., , и . ATVA, том 8837 из Lecture Notes in Computer Science, стр. 201-218. Springer, (2014)Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems., , и . TACAS, том 9636 из Lecture Notes in Computer Science, стр. 71-89. Springer, (2016)Using Garbage Collection in Model Checking., и . SPIN, том 1885 из Lecture Notes in Computer Science, стр. 20-33. Springer, (2000)Entailment is Undecidable for Symbolic Heap Separation Logic Formulæ with Non-Established Inductive Rules., , и . Inf. Process. Lett., (2022)Temporal Logic Properties of Java Objects., и . SEKE, стр. 120-127. (2001)Interprocedural Reachability for Flat Integer Programs., и . FCT, том 9210 из Lecture Notes in Computer Science, стр. 133-145. Springer, (2015)The Bernays-Schönfinkel-Ramsey Class of Separation Logic on Arbitrary Domains., , и . FoSSaCS, том 11425 из Lecture Notes in Computer Science, стр. 242-259. Springer, (2019)A Deadlock Detection Tool for Concurrent Java Programs., , и . Softw. Pract. Exp., 29 (7): 577-603 (1999)Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard., , и . LPAR, том 73 из EPiC Series in Computing, стр. 191-211. EasyChair, (2020)