DeepAI
Log In Sign Up

Higher-Order Program Verification via HFL Model Checking

10/24/2017
by   Naoki Kobayashi, et al.
0

There are two kinds of higher-order extensions of model checking: HORS model checking and HFL model checking. Whilst the former has been applied to automated verification of higher-order functional programs, applications of the latter have not been well studied. In the present paper, we show that various verification problems for functional programs, including may/must-reachability, trace properties, and linear-time temporal properties (and their negations), can be naturally reduced to (extended) HFL model checking. The reductions yield a sound and complete logical characterization of those program properties. Compared with the previous approaches based on HORS model checking, our approach provides a more uniform, streamlined method for higher-order program verification.

READ FULL TEXT

page 1

page 2

page 3

page 4

09/10/2021

An Overview of the HFL Model Checking Project

In this article, we give an overview of our project on higher-order prog...
10/26/2022

Higher-Order MSL Horn Constraints

The monadic shallow linear (MSL) class is a decidable fragment of first-...
03/15/2022

Automatic HFL(Z) Validity Checking for Program Verification

We propose an automated method for checking the validity of a formula of...
03/16/2022

On Higher-Order Reachability Games vs May Reachability

We consider the reachability problem for higher-order functional program...
12/24/2020

Verifying Liveness Properties of ML Programs

Higher-order recursion schemes are a higher-order analogue of Boolean Pr...
09/23/2020

Local Higher-Order Fixpoint Iteration

Local fixpoint iteration describes a technique that restricts fixpoint i...
03/30/2022

Applying Model Checking to Highly-Configurable Safety Critical Software: The SPS-PPS PLC Program

An important aspect of many particle accelerators is the constant evolut...