Bandera
James C. Corbett, Matthew B. Dwyer, John Hatcliff A et al. · Proceedings/Proceedings - International Conference on Software Engineering · 2000
Finite-state verification techniques, such as model checking, have shown promise as a cost-effective means for finding defects in hardware designs. To date, the application of these techniques to software has been hindered by several obstacles. Chief among these is the problem of constructing a finite-state model that approximates the executable behavior of the software system of interest. Current best-practice involves hand-construction of models which is expensive (prohibitive for all but the smallest systems), prone to errors (which can result in misleading verification results), and difficult to optimize (which is necessary to combat the exponential complexity of verification algorithms).
Cited by 1,059 works. doi:10.1145/337180.337234 Open-access PDF
Authors
References
- Abstract interpretation
- The model checker SPIN
- Symbolic model checking
- The Temporal Logic of Reactive and Concurrent Systems
- Interprocedural slicing using dependence graphs
- The Temporal Logic of Reactive and Concurrent Systems: Specification
- PVS: A prototype verification system
- Patterns in property specifications for finite-state verification
- Protocol verification as a hardware design aid
- Model checking JAVA programs using JAVA PathFinder