( en | de | ru )

 

Disambiguation of "Echenim, Mnacho"

Author of the publication

copydeleteadd this publication to your clipboard
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.

Mnacho Echenim

 

Other publications of authors with the same name

Prenex Separation Logic with One Selector Field., , and . TABLEAUX, volume 11714 of Lecture Notes in Computer Science, page 409-427. Springer, (2019)Checking Entailment Between Separation Logic Symbolic Heaps: Beyond Connected and Established Systems., , and . CoRR, (2020)A Proof Procedure for Separation Logic with Inductive Definitions and Data., and . J. Autom. Reason., 67 (3): 30 (September 2023)Unifying Decidable Entailments in Separation Logic with Inductive Definitions., , and . CADE, volume 12699 of Lecture Notes in Computer Science, page 183-199. Springer, (2021)A Superposition-Based Calculus for Quantum Diagrammatic Reasoning and Beyond., , , and . CoRR, (2021)Simultaneous diagonalization of pairwise commuting Hermitian matrices.. Arch. Formal Proofs, (2022)The CHSH inequality: Tsirelson's upper-bound and other results., , and . Arch. Formal Proofs, (2023)A Superposition-Based Calculus for Diagrammatic Reasoning., , , and . PPDP, page 10:1-10:13. ACM, (2021)Two Results on Separation Logic With Theory Reasoning., and . CoRR, (2022)Rewrite-Based Satisfiability Procedures for Recursive Data Structures., and . PDPAR/PaUL@FLoC, volume 174 of Electronic Notes in Theoretical Computer Science, page 55-70. Elsevier, (2006)