Termination Analysis with Calling Context Graphs
From MaRDI portal
Publication:5756741
DOI10.1007/11817963_36zbMATH Open1188.68110OpenAlexW1562651002MaRDI QIDQ5756741FDOQ5756741
Authors: Panagiotis Manolios, Daron Vroon 
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
Recommendations
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Functional programming and lambda calculus (68N18)
Cited In (18)
- All-Termination(T)
- Logic for Programming, Artificial Intelligence, and Reasoning
- Adapting functional programs to higher order logic
- Formal verification of termination criteria for first-order recursive functions
- Summarization for termination: No return!
- Run-time complexity bounds using squeezers
- Termination Analysis by Dependency Pairs and Inductive Theorem Proving
- Integrating testing and interactive theorem proving
- A SAT-Based Approach to Size Change Termination with Global Ranking Functions
- Proving termination by dependency pairs and inductive theorem proving
- Termination analysis for partial functions
- Termination analysis and call graph construction for higher-order functional programs
- Title not available (Why is that?)
- Asymptotically precise ranking functions for deterministic size-change systems
- ACL2s: ``the ACL2 sedan
- The ACL2 Sedan theorem proving system
- Formalization of the computational theory of a Turing complete functional language model
- Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages
Uses Software
This page was built for publication: Termination Analysis with Calling Context Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756741)
