Fast and simple nested fixpoints

Research output: Contribution to journalArticlepeer-review

47 Scopus citations

Abstract

We give an alternative proof of the result of Long et al. (1994) that nested fixpoint expressions e of alternation depth d > 1 can be evaluated over a complete lattice of height h in time O(d · |e\/(d - 1))[d/2]+1). The advantage of our proof is that it is both extremely short and extremely simple.

Original languageEnglish
Pages (from-to)303-308
Number of pages6
JournalInformation Processing Letters
Volume59
Issue number6
DOIs
StatePublished - 23 Sep 1996
Externally publishedYes

Keywords

  • Evaluation of fixpoint expressions
  • Hierarchical systems of equations
  • Model-checking

Fingerprint

Dive into the research topics of 'Fast and simple nested fixpoints'. Together they form a unique fingerprint.

Cite this