Polite Combination of Algebraic Datatypes

Author(s)
Sheng, Ying; Zohar, Yoni; Ringeissen, Christophe; Lange, Jane; Fontaine, Pascal; ... Show more
Thumbnail
Download10817_2022_9625_ReferencePDF.pdf (Embargoed until: 2023-05-05, 659.6Kb)
Publisher Policy
Terms of use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Metadata
Show full item record
Abstract
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 how it can be combined with other arbitrary disjoint theories using polite combination. The combination method uses a new, simple, and natural notion of additivity that enables deducing strong politeness from (weak) politeness.
Date issued
2022-05-05
URI
https://hdl.handle.net/1721.1/143636
Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Publisher
Springer Netherlands
Citation
Sheng, Ying, Zohar, Yoni, Ringeissen, Christophe, Lange, Jane, Fontaine, Pascal et al. 2022. "Polite Combination of Algebraic Datatypes."
Version: Author's final manuscript
Collections