Skip to main content
Article thumbnail
Location of Repository

Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic

By Martin Lange

Abstract

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.

Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.6272
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.tcs.informatik.uni-... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.