( en | de | ru )

 

Disambiguation of "Peltier, Nicolas"

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.

Nicolas Peltier

Peter Peltier

Nicolas Jeanvoine

Plasma-material interaction and electrode degradation in high voltage ignition discharges. Uni Saarbrücken, (2009)

Nicolas Rüsch

Nicolas Haas

 

Other publications of authors with the same name

What Is Decidable in Separation Logic Beyond Progress, Connectivity and Establishment?, , , and . IJCAR (2), volume 14740 of Lecture Notes in Computer Science, page 157-175. Springer, (2024)Ilinva: Using Abduction to Generate Loop Invariants., , and . FroCos, volume 11715 of Lecture Notes in Computer Science, page 77-93. Springer, (2019)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)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)Formalizing the Cox-Ross-Rubinstein Pricing of European Derivatives in Isabelle/HOL., , and . J. Autom. Reason., 64 (4): 737-765 (2020)An undecidability result for Separation Logic with theory reasoning., and . Inf. Process. Lett., (August 2023)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)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)