Abstraction and Model Checking of Core Erlang Programs in Maude

Authors:
Martin Neuhäußer;Thomas Noll
Affiliations:
Software Modeling and Verification Group, RWTH Aachen University, D--52056 Aachen, Germany, Fax: +49 241 80 22217;Software Modeling and Verification Group, RWTH Aachen University, D--52056 Aachen, Germany, Fax: +49 241 80 22217
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2007

Citing 6
Cited 3

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.)
Specification and proof in membership equational logic

Theoretical Computer Science - Trees in algebra and programming
Model checking

Model checking
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

Equational Abstractions for Reducing the State Space of Rewrite Theories

Electronic Notes in Theoretical Computer Science (ENTCS)
Automatic assessment of failure recovery in Erlang applications

Proceedings of the 8th ACM SIGPLAN workshop on ERLANG
Semantics, simulation, and formal analysis of modeling languages for embedded systems in real-time Maude

Formal modeling

Quantified Score

Hi-index	0.00

Visualization

Abstract

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. We present a formalization of this language in the Rewriting Logic framework, employing equations for defining abstraction mappings on the state space of the system. Moreover we give a sketch of an implementation in the Maude system, and demonstrate the use of its model checker to verify simple system properties.