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.)
Verification of Erlang programs using abstract interpretation and model checking
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
Rewriting: An Effective Model of Concurrency
PARLE '94 Proceedings of the 6th International PARLE Conference on Parallel Architectures and Languages Europe
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
ACM '77 Proceedings of the 1977 annual conference
Rapid Prototyping of Specification Language Implementations
RSP '99 Proceedings of the Tenth IEEE International Workshop on Rapid System Prototyping
Semi-Automated Verification of Erlang Code
Proceedings of the 16th IEEE international conference on Automated software engineering
Modeling Erlang in the pi-calculus
Proceedings of the 2005 ACM SIGPLAN workshop on Erlang
Equational Abstractions for Reducing the State Space of Rewrite Theories
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
This paper provides a contribution to the formal verification of programs written in the concurrent functional programming language Erlang, which is designed for telecommunication applications. It presents a formal description of this language in Rewriting Logic, a unified semantic framework for concurrency which is semantically founded on conditional term rewriting modulo equational theories. In particular it demonstrates the use of equations for defining abstraction mappings which reduce the state space of the system.