Avoiding exponential explosion
Cormac Flanagan A, James B. Saxe · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · 2001
Current verification condition (VC) generation algorithms, such as weakest preconditions, yield a VC whose size may be exponential in the size of the code fragment being checked. This paper describes a two-stage VC generation algorithm that generates compact VCs whose size is worst-case quadratic in the size of the source fragment, and is close to linear in practice.This two-stage VC generation algorithm has been implemented as part of the Extended Static Checker for Java. It has allowed us to check large and complex methods that would otherwise be impossible to check due to time and space constraints.
Cited by 220 works. doi:10.1145/360204.360220
Authors
References
- A Discipline of Programming
- Extended static checking
- An efficient method of computing static single assignment form
- Detecting equality of variables in programs
- The design and implementation of a certifying compiler
- Techniques for program verification
- Translation validation for an optimizing compiler
- A generalization of Dijkstra's calculus
- Refinement Calculus: A Systematic Introduction
- Checking Java Programs via Guarded Commands