An Overview of the HFL Model Checking Project

09/10/2021
by   Naoki Kobayashi, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/24/2017

Higher-Order Program Verification via HFL Model Checking

There are two kinds of higher-order extensions of model checking: HORS m...
research
10/26/2022

Higher-Order MSL Horn Constraints

The monadic shallow linear (MSL) class is a decidable fragment of first-...
research
08/27/2019

A Type-Based HFL Model Checking Algorithm

Higher-order modal fixpoint logic (HFL) is a higher-order extension of t...
research
09/23/2020

Local Higher-Order Fixpoint Iteration

Local fixpoint iteration describes a technique that restricts fixpoint i...
research
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...
research
01/22/2023

LF-checker: Machine Learning Acceleration of Bounded Model Checking for Concurrency Verification (Competition Contribution)

We describe and evaluate LF-checker, a metaverifier tool based on machin...
research
12/30/2020

Solving Interactive Fiction Games via Partial Evaluation and Bounded Model Checking

We present a case study on using program verification tools, specificall...

Please sign up or login with your details

Forgot password? Click here to reset