Two classes of Boolean functions for dependency analysis

DOI10.1016/S0167-6423(96)00039-1zbMath0942.68018WikidataQ57665045 ScholiaQ57665045MaRDI QIDQ1818309

Harald Søndergaard, Peter Schachte, Tania Armstrong, Kim Marriott

Publication date: 4 January 2000

Published in: Science of Computer Programming (Search for Journal in Brave)

zbMATH Keywords

reduced ordered binary decision diagrams

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (11)

Pair-independence and freeness analysis through linear refinement. ⋮ Abstracting numeric constraints with Boolean functions ⋮ Abstract interpretation of temporal concurrent constraint programs ⋮ The powerset operator on abstract interpretations ⋮ Design of abstract domains using first-order logic ⋮ Magic-sets for localised analysis of Java bytecode ⋮ The reduced relative power operation on abstract domains ⋮ Negative Ternary Set-Sharing ⋮ UN-KLEENE BOOLEAN EQUATION SOLVING ⋮ Set-sharing is redundant for pair-sharing ⋮ Finite-tree analysis for constraint logic-based languages

This page was built for publication: Two classes of Boolean functions for dependency analysis