UN-KLEENE BOOLEAN EQUATION SOLVING
From MaRDI portal
Publication:3434274
DOI10.1142/S0129054107004668zbMath1119.68049WikidataQ57665015 ScholiaQ57665015MaRDI QIDQ3434274
Brian Herlihy, Harald Søndergaard, Peter Schachte
Publication date: 25 April 2007
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054107004668
06E30: Boolean functions
68W25: Approximation algorithms
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
Cites Work
- Unnamed Item
- A faster solver for general systems of equations
- Two classes of Boolean functions for dependency analysis
- A lattice-theoretical fixpoint theorem and its applications
- Worst-case groundness analysis using definite Boolean functions
- Worst-case groundness analysis using positive Boolean functions
- Depth-First Search and Linear Graph Algorithms