Pages that link to "Item:Q3000631"
From MaRDI portal
The following pages link to Transition Invariants and Transition Predicate Abstraction for Program Termination (Q3000631):
Displaying 30 items.
- Reverse mathematical bounds for the termination theorem (Q324248) (← links)
- An intuitionistic version of Ramsey's theorem and its use in program termination (Q499082) (← links)
- Inference of ranking functions for proving temporal properties by abstract interpretation (Q681349) (← links)
- Summarization for termination: No return! (Q845247) (← links)
- A complexity tradeoff in ranking-function termination proofs (Q1006896) (← links)
- Automated verification of refinement laws (Q1037397) (← links)
- Mathematics for reasoning about loop functions (Q1044182) (← links)
- Convergence: integrating termination and abort-freedom (Q1647960) (← links)
- Automatic synthesis of logical models for order-sorted first-order theories (Q1655487) (← links)
- Intuitionistic Podelski-Rybalchenko theorem and equivalence between inductive definitions and cyclic proofs (Q1798782) (← links)
- Temporal prophecy for proving temporal properties of infinite-state systems (Q2058382) (← links)
- Algebraic model checking for discrete linear dynamical systems (Q2112097) (← links)
- Automated termination analysis of polynomial probabilistic programs (Q2233477) (← links)
- Temporal property verification as a program analysis task (Q2441713) (← links)
- Liveness Properties in CafeOBJ – A Case Study for Meta-Level Specifications (Q2949707) (← links)
- The Strength of the SCT Criterion (Q2988827) (← links)
- Transition Invariants and Transition Predicate Abstraction for Program Termination (Q3000631) (← links)
- Loop Summarization and Termination Analysis (Q3000639) (← links)
- Decision Procedures for Automating Termination Proofs (Q3075496) (← links)
- Predicate Abstraction for Program Verification (Q3176373) (← links)
- A Combinatorial Bound for a Restricted Form of the Termination Theorem (Q3295155) (← links)
- Proving Termination of Integer Term Rewriting (Q3636817) (← links)
- Automata-Based Termination Proofs (Q3637353) (← links)
- A DIRECT PROOF OF SCHWICHTENBERG’S BAR RECURSION CLOSURE THEOREM (Q4638975) (← links)
- Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems (Q5005159) (← links)
- Explicit Fair Scheduling for Dynamic Control (Q5187822) (← links)
- A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs (Q5191108) (← links)
- Ranking Functions for Linear-Constraint Loops (Q5501930) (← links)
- Termination Analysis of Logic Programs Based on Dependency Graphs (Q5504590) (← links)
- What's decidable about discrete linear dynamical systems? (Q6113969) (← links)