Skip to Main content Skip to Navigation
Conference papers

Politeness for the Theory of Algebraic Datatypes

Ying Sheng 1 Yoni Zohar 1 Christophe Ringeissen 2 Jane Lange 1 Pascal Fontaine 3, 4 Clark Barrett 1
2 PESTO - Proof techniques for security protocols
Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
3 VERIDIS - Modeling and Verification of Distributed Algorithms and Systems
LORIA - FM - Department of Formal Methods , Inria Nancy - Grand Est, MPII - Max-Planck-Institut für Informatik
Abstract : Algebraic datatypes, and among them lists and trees, have attracted a lot of interest in automated reasoning and Satisfiability Modulo Theories (SMT). Since its latest stable version, the SMT-LIB standard defines a theory of algebraic datatypes, which is currently supported by several mainstream SMT solvers. In this paper, we study this particular theory of datatypes and prove that it is strongly polite, showing also how it can be combined with other arbitrary disjoint theories using polite combination. Our results cover both inductive and finite datatypes, as well as their union. The combination method uses a new, simple, and natural notion of additivity, that enables deducing strong politeness from (weak) politeness.
Document type :
Conference papers
Complete list of metadatas
Contributor : Christophe Ringeissen <>
Submitted on : Friday, October 9, 2020 - 2:15:17 PM
Last modification on : Saturday, October 10, 2020 - 3:35:52 AM

Links full text




Ying Sheng, Yoni Zohar, Christophe Ringeissen, Jane Lange, Pascal Fontaine, et al.. Politeness for the Theory of Algebraic Datatypes. 10th International Joint Conference on Automated Reasoning, IJCAR, Jul 2020, Paris, France. pp.238--255, ⟨10.1007/978-3-030-51074-9_14⟩. ⟨hal-02962716⟩



Record views