Politeness for the Theory of Algebraic Datatypes

Ying Sheng (1) , Yoni Zohar (1) , Christophe Ringeissen (2) , Jane Lange (1) , Pascal Fontaine (3, 4, 5) , Clark Barrett (1)

1 Stanford University
2 PESTO - Proof techniques for security protocols
3 VERIDIS - Modeling and Verification of Distributed Algorithms and Systems
4 Université de Liège
5 MOSEL - Proof-oriented development of computer-based systems

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.

Domaines: Logique en informatique [cs.LO]

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⟩