Optimizing a structural constraint solver for efficient software checking

J. H. Siddiqui, D. Marinov, and S. Khurshid
IEEE/ACM International Conference on Automated Software Engineering (ASE 2009)

Abstract

Several static analysis techniques, e.g., symbolic execution or scope-bounded checking, as well as dynamic analysis techniques, e.g., specification-based testing, use constraint solvers as an enabling technology. To analyze code that manipulates structurally complex data, the underlying solver must support structural constraints. Solving such constraints can be expensive due to the large number of aliasing possibilities that the solver must consider. This paper presents a novel technique to selectively reduce the number of test cases to be generated. Our technique applies across a class of structural constraint solvers. Experimental results show that the technique enables an order of magnitude reduction in the number of test cases to be considered.
(ASE 2009), Auckland, New Zealand, November 2009. (Acceptance rate: 31%, 71/222)

BibTex

@inproceedings { ase2009,
author = { }, }