Author of the publication

Entailment is Undecidable for Symbolic Heap Separation Logic Formulæ with Non-Established Inductive Rules.

, , and . Inf. Process. Lett., (2022)

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.

 

Other publications of authors with the same name

Decidable Entailments in Separation Logic with Inductive Definitions: Beyond Established Systems., , and . CoRR, (2020)Reasoning about distributed reconfigurable systems., , , and . Proc. ACM Program. Lang., 6 (OOPSLA2): 145-174 (2022)Entailment is Undecidable for Symbolic Heap Separation Logic Formulæ with Non-Established Inductive Rules., , and . Inf. Process. Lett., (2022)Using Garbage Collection in Model Checking., and . SPIN, volume 1885 of Lecture Notes in Computer Science, page 20-33. Springer, (2000)Deciding Entailments in Inductive Separation Logic with Tree Automata., , and . ATVA, volume 8837 of Lecture Notes in Computer Science, page 201-218. Springer, (2014)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)Space-Reduction Strategies for Model Checking Dynamic Software., , , and . SoftMC@CAV, volume 89 of Electronic Notes in Theoretical Computer Science, page 499-517. Elsevier, (2003)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)A Deadlock Detection Tool for Concurrent Java Programs., , and . Softw. Pract. Exp., 29 (7): 577-603 (1999)Underapproximation of procedure summaries for integer programs., , and . Int. J. Softw. Tools Technol. Transf., 19 (5): 565-584 (2017)