Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9656012 | Electronic Notes in Theoretical Computer Science | 2005 | 18 Pages |
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. 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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Thomas Noll,