Nicolas Peltier
Présentation
Publications
Publications
|
|
Deciding Satisfiability for Overlaid Symbolic HeapsFROCOS 2025 - 15th International Symposium on Frontiers of Combining Systems, Sep 2025, Reykjavik, Iceland |
|
|
The Satisfiability Problem in a Separation Logic of RelationsLogic, Language, Information, and Computation - 31st International Workshop (Wollic 2025), 2025, Porto, Portugal. pp.260-277, ⟨10.1007/978-3-031-99536-1_16⟩ |
|
|
What Is Decidable in Separation Logic Beyond Progress, Connectivity and Establishment?IJCAR 2024 - 12th International Joint Conference on Automated Reasoning, Jul 2024, Nancy, France. pp.157-175, ⟨10.1007/978-3-031-63501-4_9⟩ |
|
|
An EXPTIME-complete entailment problem in separation logic ⋆Wollic 2024 - 30th Workshop on Logic, Language, Information and Computation, 2024, Bern (CH), Switzerland. pp.157-174, ⟨10.1007/978-3-031-62687-6_11⟩ |
|
|
Testing the Satisfiability of Formulas in Separation Logic with PermissionsTABLEAUX 2023 32nd International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, Sep 2023, Prague, Czech Republic |
|
|
A Strict Constrained Superposition Calculus for GraphsFOSSACS 2023: 26th International Conference on Foundations of Software Science and Computation Structures, Apr 2023, Paris, France |
|
|
Two Results on Separation Logic With Theory ReasoningASL 2022 - Workshop on Advancing Separation Logic, Jul 2022, Haifa, Israel |
|
|
Reasoning on Dynamic Transformations of Symbolic HeapsTIME 2022 : 29th International Symposium on Temporal Representation and Reasoning (TIME 2022), Nov 2022, online, France. ⟨10.4230/LIPIcs.TIME.2022.7⟩ |
|
|
Decidable Entailments in Separation Logic with Inductive Definitions: Beyond Establishment29th EACSL Annual Conference on Computer Science Logic, Jan 2021, Ljubljana, Slovenia. ⟨10.4230/LIPIcs.CSL.2021.12⟩ |
|
|
A Superposition-Based Calculus for Diagrammatic ReasoningPPDP 2021: 23rd International Symposium on Principles and Practice of Declarative Programming, 2021, Tallinn, Estonia. ⟨10.1145/3479394.3479405⟩ |
|
|
Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hardLPAR 2020, 2020, Alicante, Spain. ⟨10.1145/3380809⟩ |
|
|
The Lower Bound of Decidable Entailments in Separation Logic with Inductive DefinitionsADSL 2020 - Workshop on Automated Deduction in Separation Logic, 2020, New Orleans, United States |
|
|
Ilinva: Using Abduction to Generate Loop InvariantsFrontiers of Combining Systems - 12th International Symposium, 2019, London, United Kingdom. pp.77-93, ⟨10.1007/978-3-030-29007-8_5⟩ |
|
|
Prenex Separation Logic with One Selector FieldAutomated Reasoning with Analytic Tableaux and Related Methods - 28th International Conference, 2019, London, United Kingdom. pp.409-427, ⟨10.1007/978-3-030-29026-9_23⟩ |
|
|
The Bernays-Schönfinkel-Ramsey Class of Separation Logic on Arbitrary DomainsFoundations of Software Science and Computation Structures (FOSSACS) - 22nd International Conference, 2019, Prague, Czech Republic. pp.242-259, ⟨10.1007/978-3-030-17127-8_14⟩ |
|
|
Prime Implicate Generation in Equational LogicProceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, 2018, Stockholm, Sweden |
|
|
A Generic Framework for Implicate Generation Modulo TheoriesIJCAR, Jul 2018, Oxford, United Kingdom |
|
|
Superposition with Datatypes and CodatatypesIJCAR 2018 - 9th International Joint Conference on Automated Reasoning, Jul 2018, Oxford, United Kingdom |
|
|
A Tableaux Calculus for Reducing Proof SizeAutomated Reasoning - 9th International Joint Conference, IJCAR 2018, 2018, Oxford, United Kingdom |
The Binomial Pricing Model in Finance: A Formalization in IsabelleCADE 26, 2017, Gothenburg, Sweden. pp.546-562 |
|
|
|
A simulation framework for rapid prototyping and evaluation of thermal mitigation techniques in many-core architectures2015 IEEE/ACM International Symposium on Low Power Electronics and Design (ISLPED), Jul 2015, Rome, Italy. ⟨10.1109/ISLPED.2015.7273485⟩ |
Reasoning on Schemas of Formulas: An Automata-Based ApproachLATA 2015, Mar 2015, Nice, France. pp.263-274 |
|
Quantifier-Free Equational Logic and Prime Implicate GenerationCADE-25, Jul 2015, Berlin, Germany. pp.311-325, ⟨10.1007/978-3-319-21401-6_21⟩ |
|
A Superposition-Based Approach to Abductive Reasoning in Equational Clausal LogicADDTC 2014, Jul 2014, Vienna, Austria |
|
A Rewriting Strategy to Generate Prime Implicates in Equational LogicIJCAR 2014, Jul 2014, Vienna, Austria. pp.137-151 |
|
A Deductive-Complete Constrained Superposition Calculus for Ground Flat Equational ClausesPAAR 2014, Jul 2014, Vienna, Austria |
|
|
|
Combining Superposition and Induction: A Practical RealizationFroCoS 2013 - 9th International Symposium on s of Combining Systems (co-located with TABLEAUX 2013), Sep 2013, Nancy, France. pp.7-22, ⟨10.1007/978-3-642-40885-4_2⟩ |
|
|
Completeness and Decidability Results for First-order Clauses with IndicesCADE 2013 - 24th International Conference on Automated Deduction, Jun 2013, Lake Placid, NY, United States. pp.58-75, ⟨10.1007/978-3-642-38574-2_4⟩ |
|
|
Schemata of Formulæ in the Theory of ArraysTABLEAUX 2013 - 22th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, Sep 2013, Nancy, France. pp.234-249, ⟨10.1007/978-3-642-40537-2_20⟩ |
|
|
An Approach to Abductive Reasoning in Equational LogicIJCAI 2013 - International Joint Conference on Artificial Intelligence, Aug 2013, Beijing, China. pp.531-537 |
|
|
A Calculus for Generating Ground ExplanationsIJCAR 2012 - International Joint Conference on Automated Reasoning, Jun 2012, Manchester, United Kingdom. pp.194-209, ⟨10.1007/978-3-642-31365-3_17⟩ |
|
|
Reasoning on Schemata of FormulæAISC 2012 - Artificial Intelligence and Symbolic Computation (Part of CICM 2012), Jul 2012, Bremen, Germany. pp.310-325, ⟨10.1007/978-3-642-31374-5_21⟩ |
|
|
A Superposition Strategy for Abductive Reasoning in Ground Equational LogicIWS 2012 - International Workshop on Strategies in Rewriting, Proving and Programming (IJCAR 2012 workshop ), Jul 2012, Manchester, United Kingdom. pp.4-11 |
|
|
Generating Schemata of Resolution ProofsFTP 2011 - 8th International Workshop on First-Order Theorem Proving (co-located with TABLEAUX 2011), Jul 2011, Bern, Germany. pp.16-30 |
|
|
Schemata of SMT problemsTABLEAUX 2011 - International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, Jul 2011, Bern, Switzerland. pp.27-42, ⟨10.1007/978-3-642-22119-4_5⟩ |
|
|
Linear Temporal Logic and Propositional Schemata, Back and ForthTIME 2011 - International Symposium on Temporal Representation and Reasoning, Sep 2011, Lubeck, Germany. pp.80-87, ⟨10.1109/TIME.2011.11⟩ |
A Decidable Class of Nested Iterated SchemataIJCAR 2010, 2010, France. pp.293-308, ⟨10.1007/978-3-642-14203-1_25⟩ |
|
|
|
Instantiation of SMT Problems Modulo IntegersInternational Conference on Artificial Intelligence and Symbolic Computation, 2010, Paris, France. pp.49-63, ⟨10.1007/978-3-642-14128-7_6⟩ |
I-Terms in Ordered Resolution and Superposition Calculi: Retrieving Lost Completeness10th International Conference on Artificial Intelligence and Symbolic Computation, 2010, Paris, France. pp.19-33, ⟨10.1007/978-3-642-14128-7_4⟩ |
|
Complexity of the Satisfiability Problem for a Class of Propositional SchemataInternational Conference on Language and Automata Theory and Applications, 2010, Germany. pp.58-69 |
|
RegSTAB: a SAT-Solver for Propositional SchemataIJCAR 2010, 2010, Edinburgh, United Kingdom. pp.309-315, ⟨10.1007/978-3-642-14203-1_26⟩ |
|
Perfect Discrimination Graphs: Indexing Terms with Integer ExponentsIJCAR 2010, 2010, Edinburgh, United Kingdom. pp.369-383, ⟨10.1007/978-3-642-14203-1_32⟩ |
|
A DPLL Proof Procedure for Propositional Iterated SchemataESSLLI'09 Workshop Structures and Deduction, 2009, Bordeaux, France. pp.24 |
|
|
|
A new Methodology for Multi-Level Thermal Characterization of Complex Electronic Systems: From Die to Board LevelEuropean Microelectronics and Packaging Conference (EMPC 2009), Jun 2009, Rimini, Italy |
|
|
A New Methodology for Early Stage Thermal Analysis of Complex Electronic SystemsTherminic 2009, Oct 2009, Leuven, Belgium |
Dei: A Theorem Prover for Terms with Integer Exponents22nd International Conference on Automated Deduction, 2009, Montreal, Canada. pp.146-150, ⟨10.1007/978-3-642-02959-2_11⟩ |
|
A Schemata Calculus for Propositional LogicAutomated Reasoning with Analytic Tableaux and Related Methods, 18th International Conference, TABLEAUX 2009, 2009, Oslo, Norway. pp.32-46, ⟨10.1007/978-3-642-02716-1_4⟩ |
Déduction automatiqueMarquis Pierre, Papini Odile Prade Henri. L'I.A. frontières et Applications -- Volume 2. Algorithmes pour l'intelligence artificielle, Cépaduès éditions, pp.3, 2014 |
|
Analogy in Automated Deduction - A SurveyPrade, Henri and Richard, Gilles. Computational Approaches to Analogical Reasoning --- Current Trends, Springer-Verlag, pp.103, 2014, Studies in Computational Intelligence |
|
|
Baghera Assessment Project, designing an hybrid and emergent educational society2003 |
|
|
On the Expressive Completeness of Bernays-Sch\"onfinkel-Ramsey Separation Logic2018 |
|
|
The Complexity of Prenex Separation Logic with One Selector2018 |
|
|
Instantiation of SMT problems modulo Integers2010 |
|
|
A Decidable Class of Nested Iterated Schemata (extended version)2010 |
|
|
Checking Entailment Between Separation Logic Symbolic Heaps: Beyond Connected and Established Systems[Research Report] VERIMAG/LIG/CNRS. 2020 |
|
|
A Calculus for Generating Ground Explanations (Technical Report)2012 |
|
|
A Resolution Calculus for Propositional Schemata2011 |
A Resolution Calculus for First-Order Schemata2011 |
|
|
|
Linear Temporal Logic and Propositional Schemata, Back and Forth (extended version)2011 |
|
|
Priority-Independent Rewrite Systems for Pointer-based Data-Structures2010 |
|
|
Nouvelles techniques pour la construction de modèles finis ou infinis en déduction automatiqueModélisation et simulation. Institut National Polytechnique de Grenoble - INPG, 1997. Français. ⟨NNT : ⟩ |