Towards Erlang Verification by Term Rewriting

DOI10.1007/978-3-319-14125-1_7zbMath1453.68032OpenAlexW571601680MaRDI QIDQ3453650

Germán Vidal

Publication date: 30 November 2015

Published in: Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10251/72831

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42)

Related Items (5)

Towards Modelling Actor-Based Concurrency in Term Rewriting ⋮ Declarative debugging of concurrent Erlang programs ⋮ A framework for computing finite SLD trees ⋮ A Formal, Resource Consumption-Preserving Translation from Actors with Cooperative Scheduling to Haskell* ⋮ A core Erlang semantics for declarative debugging

Uses Software

• McErlang
• evt

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A syntactic theory of sequential control
• Conditional rewriting logic as a unified model of concurrency
• Verification of Erlang programs using abstract interpretation and model checking
• Abstraction and Model Checking of Core Erlang Programs in Maude
• Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
• Term Rewriting and All That
• Verification of Erlang processes by dependency pairs
• The narrowing-driven approach to functional logic program specialization

This page was built for publication: Towards Erlang Verification by Term Rewriting