AI Chat AI Image Generator AI Video Text to Speech

Automatic HFL(Z) Validity Checking for Program Verification

03/15/2022

∙

by Kento Tanahashi, et al.

∙

∙

We propose an automated method for checking the validity of a formula of HFL(Z), a higher-order logic with fixpoint operators and integers. Combined with Kobayashi et al.'s reduction from higher-order program verification to HFL(Z) validity checking, our method yields a fully automated verification method for temporal properties of higher-order functional programs. We have implemented our method and obtained promising experimental results.

Kento Tanahashi
1 publication
Naoki Kobayashi
18 publications
Ryosuke Sato
8 publications

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...

0 Naoki Kobayashi, et al. ∙

research

∙ 10/28/2020

A Cyclic Proof System for HFLN

A cyclic proof system allows us to perform inductive reasoning without e...

0 Mayuko Kori, et al. ∙

research

∙ 01/24/2023

Higher-Order Weakest Precondition Transformers via a CPS Transformation

Weakest precondition transformers are essential notions for program veri...

0 Satoshi Kura, et al. ∙

research

∙ 06/06/2017

Robust and efficient validation of the linear hexahedral element

Checking mesh validity is a mandatory step before doing any finite eleme...

0 Amaury Johnen, et al. ∙

research

∙ 05/20/2019

Desfuncionalizar para Provar

This paper explores the idea of using defunctionalization as a proof tec...

0 Mário Pereira, et al. ∙

research

∙ 11/12/2022

Open Higher-Order Logic (Long Version)

We introduce a variation on Barthe et al.'s higher-order logic in which ...

0 Ugo Dal Lago, et al. ∙

research

∙ 10/08/2018

Defunctionalization of Higher-Order Constrained Horn Clauses

Building on the successes of satisfiability modulo theories (SMT), Bjørn...

0 Long Pham, et al. ∙