On computing the fixpoint of a set of boolean equations
<|reference_start|>On computing the fixpoint of a set of boolean equations: 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.<|reference_end|>
@article{kuncak2004on,
    title={On computing the fixpoint of a set of boolean equations},
    author={Viktor Kuncak, K. Rustan M. Leino},
    journal={arXiv preprint arXiv:cs/0408045},
    year={2004},
    number={MSR-TR-2003-08},
    archivePrefix={arXiv},
    eprint={cs/0408045},
    primaryClass={cs.PL cs.LO cs.SE}
}