Name
Abstract | ||
|---|---|---|
This paper explores locality in proofs of global safety properties of concurrent programs. Model checking on the full state space is often infeasible due to state explosion. A local proof, in contrast, is a collection of per-process invariants, which together imply the desired global safety property. Local proofs can be more compact than global proofs, but local reasoning is also inherently incomplete. In this paper, we present an algorithm for safety verification that combines local reasoning with gradual refinement. The algorithm gradually exposes facts about the internal state of components, until either a local proof or a real error is discovered. The refinement mechanism ensures completeness. Experiments show that local reasoning can have significantly better performance over the traditional reachability computation. Moreover, for some parameterized protocols, a local proof can be used as the basis of a correctness proof over all instances. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/s10703-008-0063-8 | Formal Methods in System Design |
Keywords | DocType | Volume |
Model checking,Local reasoning,Compositionality,Local proofs | Conference | 34 |
Issue | ISSN | Citations |
2 | 0925-9856 | 23 |
PageRank | References | Authors |
0.95 | 24 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ariel Cohen | 1 | 86 | 5.63 |
| Kedar S. Namjoshi | 2 | 948 | 50.41 |