Tractable Constraints in Finite Semilattices
Abstract elided by the publisher.
Related papers
- SMT Theory Arbitrage: Approximating Unbounded Constraints using Bounded Theories PLDI 2024
- Robustness Analysis of Finite Precision Implementations APLAS 2013
- From Constraints to Finite Automata to Filtering Algorithms ESOP 2004
- Finite-Tree Analysis for Constraint Logic-Based Languages SAS 2001
- Implementing Finite-domain Constraint Logic Programming on Top of a Prolog-System with Delay-mechanism ESOP 1990
- Non-linear loop invariant generation using Gröbner bases POPL 2004
- Computing repair alternatives for malformed programs using constraint attribute grammars OOPSLA 2016
- Monoids for Rapid Data Flow Analysis POPL 1978