Control-Flow Refinement by Partial Evaluation, and its Application to Termination and Cost Analysis
From MaRDI portal
Publication:5108517
DOI10.1017/S1471068419000310zbMath1434.68104arXiv1907.12345OpenAlexW2973242263WikidataQ127225903 ScholiaQ127225903MaRDI QIDQ5108517
Samir Genaim, John P. Gallagher, Jesús J. Doménech
Publication date: 4 May 2020
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.12345
Related Items (5)
Transformation-Enabled Precondition Inference ⋮ Analysis and Transformation of Constrained Horn Clauses for Program Verification ⋮ Control-Flow Refinement by Partial Evaluation, and its Application to Termination and Cost Analysis ⋮ Unnamed Item ⋮ Automatic complexity analysis of integer programs via triangular weakly non-linear loops
Uses Software
Cites Work
- Unnamed Item
- A new look at the automatic synthesis of linear ranking functions
- On multiphase-linear ranking functions
- Closed-form upper bounds in static cost analysis
- Resource Analysis of Complex Programs with Cost Equations
- Specialization with Constrained Generalization for Software Model Checking
- Proving Termination Through Conditional Termination
- Abstract Interpretation with Specialized Definitions
- An iterative approach to precondition inference using constrained Horn clauses
- Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
- Control-Flow Refinement by Partial Evaluation, and its Application to Termination and Cost Analysis
- Ranking Functions for Linear-Constraint Loops
- Improving Reachability Analysis of Infinite State Systems by Specialization
- Verification, Model Checking, and Abstract Interpretation
This page was built for publication: Control-Flow Refinement by Partial Evaluation, and its Application to Termination and Cost Analysis
