On computing the fixpoint of a set of boolean equations
classification
💻 cs.PL
cs.LOcs.SE
keywords
fixpointcomputingequationssystembooleanbooleanscomputationentire
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.