Equational Abstractions for Model Checking Erlang Programs | Zendy

Thomas Noll | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Equational Abstractions for Model Checking Erlang Programs

Author(s) -

Thomas Noll

Publication year - 2005

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2004.01.037

Subject(s) - erlang (programming language) , computer science , programming language , rewriting , concurrency , modulo , equational logic , functional programming , model checking , theoretical computer science , mathematics , discrete mathematics

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research