On computing the fixpoint of a set of boolean equations

Simple item page
dc.creatorKuncak, Viktor
dc.creatorLeino, K. Rustan M.
dc.date2004-08-19
dc.date.accessioned2026-07-07T03:21:41Z
dc.date.available2026-07-07T03:21:41Z
dc.descriptionThis 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.
dc.description15 pages
dc.identifierhttps://arxiv.org/abs/cs/0408045
dc.identifierhttp://arxiv.org/abs/cs/0408045
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32301
dc.subjectProgramming Languages
dc.subjectLogic in Computer Science
dc.subjectSoftware Engineering
dc.subjectD.2.4; D.3.1; F.3.1; F.3.2; F.4.1
dc.titleOn computing the fixpoint of a set of boolean equations
dc.typetext

Files

Collections

arXiv