Control Explicit-Data Symbolic Model Checking
| Authors | |
|---|---|
| Year of publication | 2016 |
| Type | Article in Periodical |
| Magazine / Source | ACM Transactions on Software Engineering and Methodology |
| MU Faculty or unit | |
| Citation | |
| web | http://doi.acm.org/10.1145/2888393 |
| Doi | http://dx.doi.org/10.1145/2888393 |
| Field | Informatics |
| Keywords | formal methods; model checking; static analysis; modular arithmetic |
| Description | Automatic verification of programs and computer systems with data nondeterminism (e.g., reading from user input) represents a significant and well-motivated challenge. The case of parallel programs is especially difficult, because then also the control flow nontrivially complicates the verification process. We apply the techniques of explicit-state model checking to account for the control aspects of a program to be verified and use set-based reduction of the data flow, thus handling the two sources of nondeterminism separately. We build the theory of set-based reduction using first-order formulae in the bit-vector theory to encode the sets of variable evaluations representing program data. These representations are tested for emptiness and equality (state matching) during the verification, and we harness modern satisfiability modulo theory solvers to implement these tests. We design two methods of implementing the state matching, one using quantifiers and one that is quantifier-free, and we provide both analytical and experimental comparisons. Further experiments evaluate the efficiency of the set-based reduction method, showing the classical, explicit approach to fail to scale with the size of data domains. Finally, we propose and evaluate two heuristics to decrease the number of expensive satisfiability queries, together yielding a 10-fold speedup. |
| Related projects: |