Extreme model checking

62Citations
Citations of this article
27Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Henzinger, T. A., Jhala, R., Majumdar, R., & Sanvido, M. A. A. (2004). Extreme model checking. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2772, 332–358. https://doi.org/10.1007/978-3-540-39910-0_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free