Model Checking and Transitive-Closure Logic
Abstract elided by the publisher.
Related papers
- Constructive Completeness for Modal Logic with Transitive Closure CPP 2012
- Modular reasoning about heap paths via effectively propositional formulas POPL 2014
- Transitive Closures of Regular Relations for Verifying Infinite-State Systems TACAS 2000
- Transitive Closures of Affine Integer Tuple Relations and Their Overapproximations SAS 2011
- PTIME Computation of Transitive Closures of Octagonal Relations TACAS 2016
- Synthesizing iterators from abstraction functions GPCE 2012
- Typed Closure Conversion POPL 1996
- Equivalence checking of static affine programs using widening to handle recurrences TOPLAS 2012