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

Two Results on Separation Logic With Theory Reasoning., and . CoRR, (2022)Ilinva: Using Abduction to Generate Loop Invariants., , and . FroCos, volume 11715 of Lecture Notes in Computer Science, page 77-93. Springer, (2019)Tractable and Intractable Entailment Problems in Separation Logic with Inductively Defined Predicates., and . CoRR, (2023)A Strict Constrained Superposition Calculus for Graphs., , , and . FoSSaCS, volume 13992 of Lecture Notes in Computer Science, page 135-155. Springer, (2023)Entailment is Undecidable for Symbolic Heap Separation Logic Formulæ with Non-Established Inductive Rules., , and . Inf. Process. Lett., (2022)Decidable Entailments in Separation Logic with Inductive Definitions: Beyond Established Systems., , and . CoRR, (2020)A Superposition-Based Calculus for Quantum Diagrammatic Reasoning and Beyond., , , and . CoRR, (2021)A Superposition-Based Calculus for Diagrammatic Reasoning., , , and . PPDP, page 10:1-10:13. ACM, (2021)Testing the Satisfiability of Formulas in Separation Logic with Permissions.. TABLEAUX, volume 14278 of Lecture Notes in Computer Science, page 427-445. Springer, (2023)Reasoning on Dynamic Transformations of Symbolic Heaps.. TIME, volume 247 of LIPIcs, page 9:1-9:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)