Local Higher-Order Fixpoint Iteration

by   Florian Bruse, et al.

Local fixpoint iteration describes a technique that restricts fixpoint iteration in function spaces to needed arguments only. It has been studied well for first-order functions in abstract interpretation and also in model checking. Here we consider the problem for least and greatest fixpoints of arbitrary type order. We define an abstract algebra of simply typed higher-order functions with fixpoints that can express fixpoint evaluation problems as they occur routinely in various applications, including program verification. We present an algorithm that realises local fixpoint iteration for such higher-order fixpoints, prove its correctness and study its optimisation potential in the context of several applications.



page 1

page 2

page 3

page 4


Higher-Order Program Verification via HFL Model Checking

There are two kinds of higher-order extensions of model checking: HORS m...

Higher-Order Bounded Model Checking

We present a Bounded Model Checking technique for higher-order programs....

An Overview of the HFL Model Checking Project

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

Automatic HFL(Z) Validity Checking for Program Verification

We propose an automated method for checking the validity of a formula of...

Recursion and Sequentiality in Categories of Sheaves

We present a fully abstract model of a call-by-value language with highe...

Almost Every Simply Typed Lambda-Term Has a Long Beta-Reduction Sequence

It is well known that the length of a beta-reduction sequence of a simpl...

Bar recursion is not computable via iteration

We show that the bar recursion operators of Spector and Kohlenbach, cons...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.