paper ps
This paper presents a method for computing a least fixpoint of a
system of equations over booleans. The resulting computation can
be significantly shorter than the result of iteratively evaluating
the entire system until a fixpoint is reached.

### Citation

Viktor Kuncak and K. Rustan M. Leino.
On computing the fixpoint of a set of boolean equations.
Technical Report MSR-TR-2003-08, Microsoft Research, December 2003.### BibTex Entry

@techreport{KuncakLeino03OnComputingFixpoints,
author = {Viktor Kuncak and K. Rustan M. Leino},
title = {On computing the fixpoint of a set of boolean equations},
institution = {Microsoft Research},
year = 2003,
number = {MSR-TR-2003-08},
month = {December},
url = {http://arxiv.org/abs/cs.PL/0408045},
abstract = {
This paper presents a method for computing a least fixpoint of a
system of equations over booleans. The resulting computation can
be significantly shorter than the result of iteratively evaluating
the entire system until a fixpoint is reached.
}
}