Termination Analysis with Calling Context Graphs
From MaRDI portal
Publication:5756741
DOI10.1007/11817963_36zbMath1188.68110OpenAlexW1562651002MaRDI QIDQ5756741
Daron Vroon, Panagiotis Manolios
Publication date: 5 September 2007
Published in: Computer Aided Verification (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11817963_36
Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (13)
Summarization for termination: No return! ⋮ Asymptotically Precise Ranking Functions for Deterministic Size-Change Systems ⋮ Formal verification of termination criteria for first-order recursive functions ⋮ Proving termination by dependency pairs and inductive theorem proving ⋮ Unnamed Item ⋮ The ACL2 Sedan Theorem Proving System ⋮ Run-time complexity bounds using squeezers ⋮ Termination Analysis by Dependency Pairs and Inductive Theorem Proving ⋮ All-Termination(T) ⋮ A SAT-Based Approach to Size Change Termination with Global Ranking Functions ⋮ Adapting functional programs to higher order logic ⋮ Formalization of the computational theory of a Turing complete functional language model ⋮ ACL2s: “The ACL2 Sedan”
Uses Software
This page was built for publication: Termination Analysis with Calling Context Graphs
