Pages that link to "Item:Q1380123"

The following pages link to A hierarchy of constraint systems for data-flow analysis of constraint logic-based languages (Q1380123):

Displaying 12 items.

• The two variable per inequality abstract domain (Q656848) (← links)
• Finite-tree analysis for constraint logic-based languages (Q817224) (← links)
• Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness (Q845242) (← links)
• The octagon abstract domain (Q853733) (← links)
• Applications of polyhedral computations to the analysis and verification of hardware and software systems (Q1035700) (← 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)
• Semantics of multiway dataflow constraint systems (Q2043794) (← links)
• Exact join detection for convex polyhedra and other numerical abstractions (Q2269830) (← links)
• Donut Domains: Efficient Non-convex Domains for Abstract Interpretation (Q2891416) (← links)
• Iterating Octagons (Q3617767) (← links)