Download now Free registration required
The authors describe the design and implementation of an automatic invariant generator for imperative programs. While automatic invariant generation through constraint solving has been extensively studied from a theoretical viewpoint as a classical means of program verification, in practice existing tools do not scale even to moderately sized programs. This is because the constraints that need to be solved even for small programs are already too difficult for the underlying (non-linear) constraint solving engines. To overcome this obstacle, they propose to strengthen static constraint generation with information obtained from static abstract interpretation and dynamic execution of the program.
- Format: PDF
- Size: 215.59 KB