Abstraction and Model Checking of Core Erlang Programs in Maude

DOI10.1016/J.ENTCS.2007.06.013zbMath1279.68216OpenAlexW2061945006MaRDI QIDQ2873779

Martin R. Neuhäußer, Thomas Noll

Publication date: 24 January 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2007.06.013

zbMATH Keywords

formal verificationfunctional programmingErlangrewriting logicMaude

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Functional programming and lambda calculus (68N18) Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42) Logic programming (68N17)

Related Items (5)

Towards Erlang Verification by Term Rewriting ⋮ Program equivalence in an untyped, call-by-value functional language with uncurried functions ⋮ Strategies, model checking and branching-time properties in Maude ⋮ Equational Abstractions for Reducing the State Space of Rewrite Theories ⋮ Unnamed Item

Uses Software

• Maude
• Erlang

Cites Work

• Conditional rewriting logic as a unified model of concurrency
• The revised report on the syntactic theories of sequential control and state
• Rewriting logic: Roadmap and bibliography
• Specification and proof in membership equational logic

This page was built for publication: Abstraction and Model Checking of Core Erlang Programs in Maude