Handbook of theoretical computer science (vol. B)
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Concurrent programming in ERLANG (2nd ed.)
Concurrent programming in ERLANG (2nd ed.)
Communication and Concurrency
Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
Rewriting as a Unified Model of Concurrency
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Verifying Erlang Code: A Resource Locker Case-Study
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
Rapid Prototyping of Specification Language Implementations
RSP '99 Proceedings of the Tenth IEEE International Workshop on Rapid System Prototyping
Abstraction and Model Checking of Core Erlang Programs in Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
McErlang: a model checker for a distributed functional programming language
ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
Equational Abstractions for Model Checking Erlang Programs
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
The combinatorial explosion of state spaces is the biggest problem in applying model checking methods to concurrent systems. In this paper we present a new state-space reduction technique that is tailored to system specifications in Rewriting Logic, a unified semantic framework for concurrency which is based on conditional term rewriting modulo equational theories. The idea is to hide ''unimportant'' details of the system's behavior (such as internal computations) in the equations, and to represent only ''interesting'' state changes (such as communication operations) by explicit transitions. We show how this optimization can be implemented by transforming the Rewriting Logic specification, avoiding the construction of the full state space. Moreover we establish the correctness of our technique by proving that the original and the reduced system are weakly bisimilar, and demonstrate its usability by applying it to the concurrent functional programming language Erlang.