{"citation":{"ista":"Henzinger TA, Jhala R, Majumdar R, Sanvido M. 2004.Extreme model checking. In: Verification: Theory and Practice. LNCS, vol. 2772, 332–358.","ieee":"T. A. Henzinger, R. Jhala, R. Majumdar, and M. Sanvido, “Extreme model checking,” in <i>Verification: Theory and Practice</i>, vol. 2772, Springer, 2004, pp. 332–358.","ama":"Henzinger TA, Jhala R, Majumdar R, Sanvido M. Extreme model checking. In: <i>Verification: Theory and Practice</i>. Vol 2772. Springer; 2004:332-358. doi:<a href=\"https://doi.org/10.1007/978-3-540-39910-0_16\">10.1007/978-3-540-39910-0_16</a>","short":"T.A. Henzinger, R. Jhala, R. Majumdar, M. Sanvido, in:, Verification: Theory and Practice, Springer, 2004, pp. 332–358.","chicago":"Henzinger, Thomas A, Ranjit Jhala, Ritankar Majumdar, and Marco Sanvido. “Extreme Model Checking.” In <i>Verification: Theory and Practice</i>, 2772:332–58. Springer, 2004. <a href=\"https://doi.org/10.1007/978-3-540-39910-0_16\">https://doi.org/10.1007/978-3-540-39910-0_16</a>.","mla":"Henzinger, Thomas A., et al. “Extreme Model Checking.” <i>Verification: Theory and Practice</i>, vol. 2772, Springer, 2004, pp. 332–58, doi:<a href=\"https://doi.org/10.1007/978-3-540-39910-0_16\">10.1007/978-3-540-39910-0_16</a>.","apa":"Henzinger, T. A., Jhala, R., Majumdar, R., &#38; Sanvido, M. (2004). Extreme model checking. In <i>Verification: Theory and Practice</i> (Vol. 2772, pp. 332–358). Springer. <a href=\"https://doi.org/10.1007/978-3-540-39910-0_16\">https://doi.org/10.1007/978-3-540-39910-0_16</a>"},"publisher":"Springer","status":"public","month":"02","abstract":[{"lang":"eng","text":"One of the central axioms of extreme programming is the disciplined use of regression testing during stepwise software development. Due to recent progress in software model checking, it has become possible to supplement this process with automatic checks for behavioral safety properties of programs, such as conformance with locking idioms and other programming protocols and patterns. For efficiency reasons, all checks must be incremental, i.e., they must reuse partial results from previous checks in order to avoid all unnecessary repetition of expensive verification tasks. We show that the lazy-abstraction algorithm, and its implementation in Blast, can be extended to support the fully automatic and incremental checking of temporal safety properties during software development."}],"acknowledgement":"This work was supported in part by the NSF grants CCR-9988172, CCR-0085949, and CCR-0234690, the ONR grant N00014-02-1-0671, the DARPA grant F33615-00-C-1693, and the MARCO grant 98-DT-660. ","type":"book_chapter","day":"24","publist_id":"269","date_updated":"2021-01-12T07:57:08Z","doi":"10.1007/978-3-540-39910-0_16","alternative_title":["LNCS"],"author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Thomas Henzinger","last_name":"Henzinger","first_name":"Thomas A"},{"first_name":"Ranjit","last_name":"Jhala","full_name":"Jhala, Ranjit"},{"last_name":"Majumdar","first_name":"Ritankar","full_name":"Majumdar, Ritankar S"},{"full_name":"Sanvido, Marco A","last_name":"Sanvido","first_name":"Marco"}],"intvolume":"      2772","publication_status":"published","volume":2772,"page":"332 - 358","quality_controlled":0,"extern":1,"title":"Extreme model checking","date_created":"2018-12-11T12:08:58Z","_id":"4461","year":"2004","publication":"Verification: Theory and Practice","date_published":"2004-02-24T00:00:00Z"}