Pages that link to "Item:Q2324003"
From MaRDI portal
The following pages link to Higher-order program verification via HFL model checking (Q2324003):
Displaying 11 items.
- Predicate abstraction and CEGAR for \(\nu \mathrm{HFL}_\mathbb{Z}\) validity checking (Q2233530) (← links)
- Crowfoot: A Verifier for Higher-Order Store Programs (Q2891407) (← links)
- Model checking and functional program transformations (Q2963902) (← links)
- (Q5028436) (← links)
- Fold/Unfold Transformations for Fixpoint Logic (Q5164174) (← links)
- On the relationship between higher-order recursion schemes and higher-order fixpoint logic (Q5370859) (← links)
- On higher-order reachability games vs may reachability (Q6173106) (← links)
- Temporal verification of programs via first-order fixpoint logic (Q6536298) (← links)
- A type-based HFL model checking algorithm (Q6536312) (← links)
- An overview of the HFL model checking project (Q6647298) (← links)
- Reducing higher-order recursion scheme equivalence to coinductive higher-order constrained Horn clauses (Q6647302) (← links)