An Overview of the HFL Model Checking Project
arXiv:2109.04629 · doi:10.4204/EPTCS.344.1
Abstract
In this article, we give an overview of our project on higher-order program verification based on HFL (higher-order fixpoint logic) model checking. After a brief introduction to HFL, we explain how it can be applied to program verification, and summarize the current status of the project.
arXiv commentIn Proceedings HCVS 2021, arXiv:2109.03988
References in corpus (6)
- Horn-ICE Learning for Synthesizing Invariants and Contracts
- Solving Horn Clauses on Inductive Data Types Without Induction
- The Complexity of Model Checking Higher-Order Fixpoint Logic
- Removing Algebraic Data Types from Constrained Horn Clauses Using Difference Predicates
- HoCHC: A Refutationally Complete and Semantically Invariant System of Higher-order Logic Modulo Theories
- A Cyclic Proof System for HFLN