Implementing polymorphism in SMT solvers

Authors:
François Bobot;Sylvain Conchon;Evelyne Contejean;Stéphane Lescuyer
Affiliations:
Univ. Paris-Sud, ProVal, Orsay;Univ. Paris-Sud, ProVal, Orsay;Univ. Paris-Sud, ProVal, Orsay;Univ. Paris-Sud, ProVal, Orsay
Venue:
SMT '08/BPR '08 Proceedings of the Joint Workshops of the 6th International Workshop on Satisfiability Modulo Theories and 1st International Workshop on Bit-Precise Reasoning
Year:
2008

Citing 5
Cited 8

Types and programming languages

Types and programming languages
MLF: raising ML to the power of system F

ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Types, bytes, and separation logic

Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Class-local object invariants

ISEC '08 Proceedings of the 1st India software engineering conference
The Why/Krakatoa/Caduceus platform for deductive program verification

CAV'07 Proceedings of the 19th international conference on Computer aided verification

HOL-Boogie--An Interactive Prover-Backend for the Verifying C Compiler

Journal of Automated Reasoning
Expressing polymorphic types in a many-sorted language

FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
A polymorphic intermediate verification language: design and logical encoding

TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Integration of SMT-solvers in B and Event-B development environments

Science of Computer Programming
Encoding monomorphic and polymorphic types

TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
One logic to use them all

CADE'13 Proceedings of the 24th international conference on Automated Deduction
TFF1: the TPTP typed first-order form with rank-1 polymorphism

CADE'13 Proceedings of the 24th international conference on Automated Deduction
Automating theorem proving with SMT

ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving

Quantified Score

Hi-index	0.00

Visualization

Abstract

Based on our experience with the development of Alt-Ergo, we show the small number of modifications needed to bring parametric polymorphism to our SMT solver. The first one occurs in the typing module where unification is now necessary for solving polymorphic constraints over types. The second one consists in extending triggers' definition in order to deal with both term and type variables. Last, the matching module must be modified to account for the instantiation of type variables. We hope that this experience is convincing enough to raise interest for polymorphism in the SMT community.