A Constraint Solver Based on Abstract Domains
Abstract elided by the publisher.
Related papers
- An interval constraint system for lattice domains TOPLAS 2004
- HM(X) type inference is CLP(X) solving JFP 2008
- A lightweight symbolic virtual machine for solver-aided host languages PLDI 2014
- OutsideIn(X) Modular type inference with local assumptions JFP 2011
- Floating-Point TVPI Abstract Domain PLDI 2024
- High-Level Abstractions for Simplifying Extended String Constraints in SMT CAV 2019
- Grisette: Symbolic Compilation as a Functional Programming Library POPL 2023
- Deriving divide-and-conquer dynamic programming algorithms using solver-aided transformations OOPSLA 2016