On computing the fixpoint of a set of boolean equations

2004/08/19 by Viktor Kuncak, Kuncak, Viktor, K. Rustan M. Leino +1
Computer Science · #D.2.4 #D.3.1 #F.3.1 #F.3.2 #F.4.1 #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Programming Languages (cs.PL) #Software Engineering (cs.SE) #cs.LO #cs.PL #cs.SE

paper · pdf · doi:10.48550/arxiv.cs/0408045

15 pages

arxiv created 2004/08/19 · arxiv updated 2009/12/01

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.

Related

• An Algorithm for Detecting Fixed Points of Boolean Networks
• Improved Static Analysis of Parameterised Boolean Equation Systems using Control Flow Reconstruction
• Structural Analysis of Boolean Equation Systems
• Linear Programming Formulation of the Boolean Satisfiability Problem
• Equational properties of stratified least fixed points