Characterizing finite Kripke structures in propositional temporal logic
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
A partial approach to model checking
Papers presented at the IEEE symposium on Logic in computer science
Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Three logics for branching bisimulation
Journal of the ACM (JACM)
Property preserving abstractions for the verification of concurrent systems
Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
Abstract interpretation of reactive systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Model checking for programming languages using VeriSoft
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Weak confluence and &tgr;-inertness
Theoretical Computer Science
Distributed Algorithms
Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Equational rules for rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Static Partial Order Reduction
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
Partial-Order Reduction in Symbolic State Space Exploration
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Generating Finite-State Abstractions of Reactive Systems Using Decision Procedures
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Abstract and Model Check While You Prove
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
State Space Reduction by Proving Confluence
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
A Stubborn Attack On State Explosion
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Combining Partial Order Reductions with On-the-fly Model-Checking
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Proving termination of membership equational programs
Proceedings of the 2004 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Dynamic partial-order reduction for model checking software
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The maude LTL model checker and its implementation
SPIN'03 Proceedings of the 10th international conference on Model checking software
A categorical approach to simulations
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
A Distributed Implementation of Mobile Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
Distributed applications implemented in maude with parameterized skeletons
FMOODS'07 Proceedings of the 9th IFIP WG 6.1 international conference on Formal methods for open object-based distributed systems
Symbolic model checking of infinite-state systems using narrowing
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Proving safety properties of rewrite theories
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Hi-index | 0.00 |
State space explosion is the hardest challenge to the effective application of model checking methods. We present a new technique for achieving drastic state space reductions that can be applied to a very wide range of concurrent systems, namely any system specified as a rewrite theory. Given a rewrite theory $\mathcal{R}=(\Sigma,E,R)$ whose equational part (Σ,E) specifies some state predicates P, we identify a subset S⊆R of rewrite rules that are P-invisible, so that rewriting with S does not change the truth value of the predicates P. We then use S to construct a reduced rewrite theory $\mathcal{R}/S$ in which all states reachable by S-transitions become identified. We show that if $\mathcal{R}/S$ satisfies reasonable executability assumptions, then it is in fact stuttering bisimilar to $\mathcal{R}$ and therefore both satisfy the same ${\it CTL}^{\rm \ast}_{\rm -{\it X}}$ formulas. We can then use the typically much smaller $\mathcal{R}/S$ to verify such formulas. We show through several case studies that the reductions achievable this way can be huge in practice. Furthermore, we also present a generalization of our construction that instead uses a stuttering simulation and can be applied to an even broader class of systems.