On computing the fixpoint of a set of boolean equations
Kuncak, Viktor · Leino, K. Rustan M.
Programming Languages
Logic in Computer Science
Software Engineering
D.2.4; D.3.1; F.3.1; F.3.2; F.4.1
Original · EN
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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.