Verification of Erlang processes by dependency pairs
From MaRDI portal
Publication:5941753
DOI10.1007/s002000100063zbMath0973.68101MaRDI QIDQ5941753
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
68Q42: Grammars and rewriting systems
Related Items
mu-term: Verify Termination Properties Automatically (System Description), Towards Modelling Actor-Based Concurrency in Term Rewriting, An integrated framework for the diagnosis and correction of rule-based programs, Mechanizing and improving dependency pairs, The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors, Modular termination proofs for rewriting using dependency pairs, Determinization of conditional term rewriting systems, Applications and extensions of context-sensitive rewriting, Proving operational termination of membership equational programs, Using well-founded relations for proving operational termination, Automating the dependency pair method, The size-change principle and dependency pairs for termination of term rewriting, Termination of Isabelle Functions via Termination of Rewriting, Towards Erlang Verification by Term Rewriting, Certifying a Termination Criterion Based on Graphs, without Graphs, From Outermost Termination to Innermost Termination
Uses Software
