Name
Abstract | ||
|---|---|---|
We consider the problem of model checking specifications involving co-inductive definitions such as are available for bisimulation. A proof search approach to model checking with such specifications often involves state exploration. We consider four different tabling strategies that can minimize such exploration significantly. In general, tabling involves storing previously proved subgoals and reusing (instead of reproving) them in proof search. In the case of co-inductive proof search, tables allow a limited form of loop checking, which is often necessary for, say, checking bisimulation of non-terminating processes. We enhance the notion of tabled proof search by allowing a limited deduction from tabled entries when performing table lookup. The main problem with this enhanced tabling method is that it is generally unsound when co-inductive definitions are involved and when tabled entries contain unproved entries. We design a proof system with tables and show that by managing tabled entries carefully, one would still be able to obtain a sound proof system. That is, we show how one can extract a post-fixed point from a tabled proof for a co-inductive goal. We then apply this idea to the technique of bisimulation "up-to" commonly used in process algebra. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-319-03545-1_13 | CERTIFIED PROGRAMS AND PROOFS, CPP 2013 |
DocType | Volume | ISSN |
Conference | 8307 | 0302-9743 |
Citations | PageRank | References |
1 | 0.35 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dale Miller | 1 | 2485 | 232.26 |
| Alwen Fernanto Tiu | 2 | 610 | 43.00 |