Abstraction and Model Checking of Core Erlang Programs in Maude

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.