Pages that link to "Item:Q3392932"

The following pages link to Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships (Q3392932):

Displaying 10 items.

• Deciding floating-point logic with abstract conflict driven clause learning (Q479837) (← links)
• Reachability computation for polynomial dynamical systems (Q526433) (← links)
• A new abstraction framework for affine transformers (Q2322316) (← links)
• The octagon abstract domain for continuous constraints (Q2342596) (← links)
• Donut Domains: Efficient Non-convex Domains for Abstract Interpretation (Q2891416) (← links)
• Refinement to Certify Abstract Interpretations, Illustrated on Linearization for Polyhedra (Q2945626) (← links)
• Block-Wise Abstract Interpretation by Combining Abstract Domains with SMT (Q2961574) (← links)
• Linear Absolute Value Relation Analysis (Q3000578) (← links)
• Cooperative Query Answering by Abstract Interpretation (Q3075526) (← links)
• An efficient abstract domain for not necessarily closed polyhedra (Q6041169) (← links)