Predicate abstraction and CEGAR for HFL_Z validity checking
From MaRDI portal
Publication:2233530
Recommendations
- A new refinement type system for automated \(\nu\text{HFL}_\mathbb{Z}\) validity checking
- Predicate abstraction and CEGAR for disproving termination of higher-order functional programs
- Verification of SpecC using predicate abstraction
- Predicate Abstraction in Program Verification: Survey and Current Trends
- Predicate abstraction for program verification
- A verified proof checker for higher-order logic
- Constructive consistency checking for partial specification in Z
- Computer Aided Verification
- scientific article; zbMATH DE number 2090118
Cites work
- Compositional and lightweight dependent type inference for ML
- CONCUR 2004 - Concurrency Theory
- Dependent types from counterexamples
- Higher-order program verification via HFL model checking
- ICE-based refinement type discovery for higher-order functional programs
- Learning refinement types
- On the relationship between higher-order recursion schemes and higher-order fixpoint logic
- Predicate abstraction and CEGAR for disproving termination of higher-order functional programs
Cited in
(5)- A new refinement type system for automated \(\nu\text{HFL}_\mathbb{Z}\) validity checking
- On higher-order reachability games vs may reachability
- Temporal verification of programs via first-order fixpoint logic
- An overview of the HFL model checking project
- On the relationship between Dijkstra monads and higher-order fixpoint logic
This page was built for publication: Predicate abstraction and CEGAR for \(\nu \mathrm{HFL}_\mathbb{Z}\) validity checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2233530)