Pages that link to "Item:Q1818309"
From MaRDI portal
The following pages link to Two classes of Boolean functions for dependency analysis (Q1818309):
Displaying 12 items.
- Abstracting numeric constraints with Boolean functions (Q294784) (← links)
- Magic-sets for localised analysis of Java bytecode (Q656846) (← links)
- Finite-tree analysis for constraint logic-based languages (Q817224) (← links)
- The reduced relative power operation on abstract domains (Q1285656) (← links)
- Set-sharing is redundant for pair-sharing (Q1605223) (← links)
- Pair-independence and freeness analysis through linear refinement. (Q1873754) (← links)
- The powerset operator on abstract interpretations (Q1960538) (← links)
- Design of abstract domains using first-order logic (Q1960541) (← links)
- UN-KLEENE BOOLEAN EQUATION SOLVING (Q3434274) (← links)
- Abstract interpretation of temporal concurrent constraint programs (Q4592982) (← links)
- Negative Ternary Set-Sharing (Q5504663) (← links)
- Immediate fixpoints and their use in groundness analysis (Q6567786) (← links)
