Equational Abstractions for Model Checking Erlang Programs

AbstractThis 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