Beyer, DirkHenzinger, Thomas A.Théoduloz, Grégory2007-05-012007-05-012007-05-01200710.1007/978-3-540-73368-3_51https://infoscience.epfl.ch/handle/20.500.14299/6444In automatic software verification, we have observed a theoretical convergence of model checking and program analysis. In practice, however, model checkers are still mostly concerned with precision, e.g., the removal of spurious counterexamples; for this purpose they build and refine reachability trees. Lattice-based program analyzers, on the other hand, are primarily concerned with efficiency. We designed an algorithm and built a tool that can be configured to perform not only a purely tree-based or a purely lattice-based analysis, but offers many intermediate settings that have not been evaluated before. The algorithm and tool take one or more abstract interpreters, such as a predicate abstraction and a shape analysis, and configure their execution and interaction using several parameters. Our experiments show that such customization may lead to dramatic improvements in the precision-efficiency spectrum.Software Model CheckingNCCR-MICSNCCR-MICS/CL2text::conference output::conference proceedings::conference paper