On computing the fixpoint of a set of boolean equations
Programming Languages
2007-05-23 v1 Logic in Computer Science
Software Engineering
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.
Cite
@article{arxiv.cs/0408045,
title = {On computing the fixpoint of a set of boolean equations},
author = {Viktor Kuncak and K. Rustan M. Leino},
journal= {arXiv preprint arXiv:cs/0408045},
year = {2007}
}
Comments
15 pages