Alloy*: A Higher-Order Relational Constraint Solver
Name
MIT-CSAIL-TR-2014-018.pdf
Size
630.35 KB
Format
Adobe PDF
Checksum (MD5)
6b6f50b3630ac3c9ca0a3b1935878570
Download all files submitted through automated deposit
Author(s)
Milicevic, Aleksandar
Near, Joseph P.
Kang, Eunsuk
Jackson, Daniel
Advisor(s)
Daniel Jackson
Date Issued
September 2, 2014
Series/Report no.
MIT-CSAIL-TR-2014-018
Abstract
The last decade has seen a dramatic growth in the use of constraint solvers as a computational mechanism, not only for analysis and synthesis of software, but also at runtime. Solvers are available for a variety of logics but are generally restricted to first-order formulas. Some tasks, however, most notably those involving synthesis, are inherently higher order; these are typically handled by embedding a first-order solver (such as a SAT or SMT solver) in a domain-specific algorithm. Using strategies similar to those used in such algorithms, we show how to extend a first-order solver (in this case Kodkod, a model finder for relational logic used as the engine of the Alloy Analyzer) so that it can handle quantifications over higher-order structures. The resulting solver is sufficiently general that it can be applied to a range of problems; it is higher order, so that it can be applied directly, without embedding in another algorithm; and it performs well enough to be competitive with specialized tools on standard benchmarks. Although the approach is demonstrated for a particular relational logic, the principles behind it could be applied to other first-order solvers. Just as the identification of first-order solvers as reusable backends advanced the performance of specialized tools and simplified their architecture, factoring out higher-ordersolvers may bring similar benefits to a new class of tools.
Persistent DSpace Link
