A linear algorithm to solve fixed-point equations on transition systems
Information Processing Letters
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
Model checking and boolean graphs
Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
Formal verification of a leader election protocol in process algebra
ACP '95 Proceedings from the international workshop on Algebra of communicating processes
Deciding the winner in parity games is in UP ∩ co-UP
Information Processing Letters
On model checking for the &mgr;-calculus and its fragments
Theoretical Computer Science
Efficient Local Correctness Checking for Single and Alternating Boolean Equation Systems
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Simple Linear-Time Algorithms for Minimal Fixed Points (Extended Abstract)
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Fully Local and Efficient Evaluation of Alternating Fixed Points (Extended Abstract)
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Efficent Local Model-Checking for Fragments of teh Modal µ-Calculus
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Local Model-Checking of Modal Mu-Calculus on Acyclic Labeled Transition Systems
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
State Space Reduction by Proving Confluence
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Efficient Local Correctness Checking
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
On Model-Checking for Fragments of µ-Calculus
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Efficient Checking of Behavioural Relations and Modal Assertions using Fixed-Point Inversion
Proceedings of the 7th International Conference on Computer Aided Verification
Solution of systems of Boolean equations via the integer domain
Information Sciences: an International Journal
| Hi-index | 0.00 |
This paper is concerned with memory-efficient solution techniques for Boolean fixed-point equations. We show how certain structures of fixed-point equation systems, often encountered in solving verification problems, can be exploited in order to substantially improve the performance of fixed-point computations. Also, we investigate the space complexity of the problem of solving Boolean equation systems, showing a NL-hardness result. A prototype of the proposed technique has been implemented and experimental results on a series of protocol verification benchmarks are reported.