Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
A Heuristic for Symmetry Reductions with Scalarsets
FME '01 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods for Increasing Software Productivity
Partial Order Reduction for Rewriting Semantics of Programming Languages
Electronic Notes in Theoretical Computer Science (ENTCS)
ProB gets Nauty: Effective Symmetry Reduction for B and Z Models
TASE '08 Proceedings of the 2008 2nd IFIP/IEEE International Symposium on Theoretical Aspects of Software Engineering
Theoretical Computer Science
Combining Techniques to Reduce State Space and Prove Strong Properties
Electronic Notes in Theoretical Computer Science (ENTCS)
The maude LTL model checker and its implementation
SPIN'03 Proceedings of the 10th international conference on Model checking software
A Church-Rosser checker tool for conditional order-sorted equational Maude specifications
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Proving safety properties of rewrite theories
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
A refinement-based correctness proof of symmetry reduced model checking
ABZ'10 Proceedings of the Second international conference on Abstract State Machines, Alloy, B and Z
A computational group theoretic symmetry reduction package for the SPIN model checker
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
| Hi-index | 0.00 |
We present c−reductions, a simple, flexible and very general state space reduction technique that exploits an equivalence relation on states that is a bisimulation. Reduction is achieved by a canonizer function, which maps each state into a not necessarily unique canonical representative of its equivalence class. The approach contains symmetry reduction and name reuse and name abstraction as special cases, and exploits the expressiveness of rewriting logic and its realization in Maude to automate c-reductions and to seamlessly integrate model checking and the discharging of correctness proof obligations. The performance of the approach has been validated over a set of representative case studies.