Verification of Erlang processes by dependency pairs

DOI10.1007/S002000100063zbMath0973.68101OpenAlexW2000826973MaRDI QIDQ5941753

Jürgen Giesl, Thomas Arts

Publication date: 26 August 2001

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002000100063

zbMATH Keywords

Erlangfunctional programming language

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (16)

mu-term: Verify Termination Properties Automatically (System Description) ⋮ The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors ⋮ Towards Erlang Verification by Term Rewriting ⋮ Mechanizing and improving dependency pairs ⋮ An integrated framework for the diagnosis and correction of rule-based programs ⋮ Determinization of conditional term rewriting systems ⋮ Towards Modelling Actor-Based Concurrency in Term Rewriting ⋮ Certifying a Termination Criterion Based on Graphs, without Graphs ⋮ Automating the dependency pair method ⋮ Proving operational termination of membership equational programs ⋮ From Outermost Termination to Innermost Termination ⋮ Applications and extensions of context-sensitive rewriting ⋮ Using well-founded relations for proving operational termination ⋮ Termination of Isabelle Functions via Termination of Rewriting ⋮ The size-change principle and dependency pairs for termination of term rewriting ⋮ Modular termination proofs for rewriting using dependency pairs

Uses Software

• Erlang

This page was built for publication: Verification of Erlang processes by dependency pairs