Improvements to Many-Sorted Finite Model Finding using SMT Solvers
Loading...
Date
2023-08-17
Authors
Zila, Owen
Journal Title
Journal ISSN
Volume Title
Publisher
University of Waterloo
Abstract
Formal modeling is a powerful tool in requirements engineering. By modeling a system before implementation, one can discover bugs before they appear in testing or production. Model finding (or instance finding) for a model written in first-order logic is the problem of finding a mapping of variables to values that satisfies a model's specifications. Unfortunately, this problem is undecidable in general. Finite model finding, the problem of finding a mapping of variables to finite sets of values, is decidable. Thus, finite model finding enables the automated verification of models at certain scopes (the number of elements in the domain of discourse of the problem). While finitizing a problem makes it solvable, as the scope of the problem increases, the problem can quickly become prohibitivly expensive to solve. Therefore, it is important to choose an efficient encoding of the problem for satisfiability (SAT) or satisfiability modulo theories (SMT) solvers when finitizing a problem.
We propose improvements to encodings of many-sorted finite model finding problems for SMT solvers. We propose new encodings for finite integers and transitive closure.
The key contributions of this thesis are that we:
- Formulate Milicevic and Jackson's method for preventing overflows in integer problems using bitvectors as a transformation from/to a many-sorted first-order logic formula and extend it to support additional abstractions present in MSFOL
- Propose an integer finitization method, called overflow-preventing finite integers (OPFI), that produces results closer to unbounded integers than Milicevic and Jackson's method, improving the correctness of the finitization with respect to the same problem over unbounded integers
- Demonstrate that OPFI solves problems faster than our encoding of Milicevic and Jackson's method in an SMT solver, and does not solve problems significantly slower than unchecked (pure) bitvectors
- Propose and prove the validity of negative transitive closure, an encoding of the transitive closure operator over a finite scope in first order logic for a special case of the use of transitive closure where pairs are only checked to not be in the transitive closure of a relation
- Generalize existing encodings of transitive closure to relations of arity greater than~two
- Demonstrate our new encoding of transitive closure performs faster than or as fast as existing encodings on models generated from Alloy models
Description
Keywords
Alloy, formal methods, model checking, SMT-LIB, satisfiability modulo theories