{"acknowledgement":"This research was supported in part by the grant SFU/PRG 06-3, and by the Swiss National Science Foundation.","date_updated":"2021-01-12T07:59:48Z","_id":"4573","author":[{"last_name":"Beyer","first_name":"Dirk","full_name":"Beyer, Dirk"},{"first_name":"Thomas A","full_name":"Thomas Henzinger","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"full_name":"Théoduloz, Grégory","first_name":"Grégory","last_name":"Théoduloz"}],"quality_controlled":0,"page":"504 - 518","type":"conference","publisher":"Springer","date_published":"2007-07-02T00:00:00Z","extern":1,"day":"02","title":"Configurable software verification: Concretizing the convergence of model checking and program analysis","intvolume":"      4590","conference":{"name":"CAV: Computer Aided Verification"},"publist_id":"135","publication_status":"published","doi":"10.1007/978-3-540-73368-3_51","abstract":[{"text":"In 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.","lang":"eng"}],"month":"07","status":"public","alternative_title":["LNCS"],"citation":{"ama":"Beyer D, Henzinger TA, Théoduloz G. Configurable software verification: Concretizing the convergence of model checking and program analysis. In: Vol 4590. Springer; 2007:504-518. doi:<a href=\"https://doi.org/10.1007/978-3-540-73368-3_51\">10.1007/978-3-540-73368-3_51</a>","apa":"Beyer, D., Henzinger, T. A., &#38; Théoduloz, G. (2007). Configurable software verification: Concretizing the convergence of model checking and program analysis (Vol. 4590, pp. 504–518). Presented at the CAV: Computer Aided Verification, Springer. <a href=\"https://doi.org/10.1007/978-3-540-73368-3_51\">https://doi.org/10.1007/978-3-540-73368-3_51</a>","ieee":"D. Beyer, T. A. Henzinger, and G. Théoduloz, “Configurable software verification: Concretizing the convergence of model checking and program analysis,” presented at the CAV: Computer Aided Verification, 2007, vol. 4590, pp. 504–518.","mla":"Beyer, Dirk, et al. <i>Configurable Software Verification: Concretizing the Convergence of Model Checking and Program Analysis</i>. Vol. 4590, Springer, 2007, pp. 504–18, doi:<a href=\"https://doi.org/10.1007/978-3-540-73368-3_51\">10.1007/978-3-540-73368-3_51</a>.","chicago":"Beyer, Dirk, Thomas A Henzinger, and Grégory Théoduloz. “Configurable Software Verification: Concretizing the Convergence of Model Checking and Program Analysis,” 4590:504–18. Springer, 2007. <a href=\"https://doi.org/10.1007/978-3-540-73368-3_51\">https://doi.org/10.1007/978-3-540-73368-3_51</a>.","short":"D. Beyer, T.A. Henzinger, G. Théoduloz, in:, Springer, 2007, pp. 504–518.","ista":"Beyer D, Henzinger TA, Théoduloz G. 2007. Configurable software verification: Concretizing the convergence of model checking and program analysis. CAV: Computer Aided Verification, LNCS, vol. 4590, 504–518."},"volume":4590,"year":"2007","date_created":"2018-12-11T12:09:33Z"}