Pages that link to "Item:Q5410711"
From MaRDI portal
The following pages link to Automatic Termination Verification for Higher-Order Functional Programs (Q5410711):
Displaying 15 items.
- Verifying termination and reduction properties about higher-order logic programs (Q850496) (← links)
- Automatizing termination proofs of recursively defined functions (Q1346629) (← links)
- Verifying higher-order functions with tree automata (Q1653017) (← links)
- Predicate abstraction and CEGAR for disproving termination of higher-order functional programs (Q1702897) (← links)
- Temporal refinements for guarded recursive types (Q2233479) (← links)
- Termination analysis for functional programs (Q2702599) (← links)
- Automatic termination analysis for functional and imperative programs (Thesis, TU Darmstadt) (Q2726244) (← links)
- Temporal verification of higher-order functional programs (Q2828245) (← links)
- AN EXTENSION OF AN AUTOMATED TERMINATION METHOD OF RECURSIVE FUNCTIONS (Q3021959) (← links)
- Higher-Order Model Checking in Direct Style (Q3179299) (← links)
- (Q5688891) (← links)
- ICE-based refinement type discovery for higher-order functional programs (Q5919002) (← links)
- Parameterized recursive refinement types for automated program verification (Q6109429) (← links)
- Termination Analysis for the $$\pi $$-Calculus by Reduction to Sequential Program Termination (Q6488159) (← links)
- An overview of the HFL model checking project (Q6647298) (← links)
