Model checking the first-order fragment of higher-order fixpoint logic

Authors:
Roland Axelsson;Martin Lange
Affiliations:
Institut für Informatik, Ludwig-Maximilians-Universität München, Germany;Department of Computer Science, University of Aarhus, Denmark
Venue:
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Year:
2007

Citing 5
Cited 0

Uniform inevitability is tree automaton ineffable

Information Processing Letters
Tree automata, Mu-Calculus and determinacy

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
A modal fixpoint logic with chop

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Experimental evaluation of classical automata constructions

LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Antichains: a new algorithm for checking universality of finite automata

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a model checking algorithm for HFL1, the firstorder fragment of Higher-Order Fixpoint Logic. This logic is capable of expressing many interesting properties which are not regular and, hence, not expressible in the modal µ-calculus. The algorithm avoids best-case exponential behaviour by localising the computation of functions and can be implemented symbolically using BDDs. We show how insight into the behaviour of this procedure, when run on a fixed formula, can be used to obtain specialised algorithms for particular problems. This yields, for example, the competitive antichain algorithm for NFA universality but also a new algorithm for a string matching problem.