Download now Free registration required
Specification inference tools typically mine commonalities among states at relevant program points. For example, to infer the invariants that must hold at all calls to a procedure ? requires examining the state abstractions found at all call-sites to ?. Unfortunately, existing approaches to building these abstractions require being able to explore all paths (either static or dynamic) to all of ?'s call-sites to derive specifications with any measure of confidence. Because programs that have complex control-flow structure may induce a large number of paths, naive path exploration is impractical.
- Format: PDF
- Size: 181.6 KB