Pages that link to "Item:Q5898613"
From MaRDI portal
The following pages link to Verification, Model Checking, and Abstract Interpretation (Q5898613):
Displaying 18 items.
- Abstract interpretation meets convex optimization (Q435969) (← links)
- Tropical linear-fractional programming and parametric mean payoff games (Q435971) (← links)
- The two variable per inequality abstract domain (Q656848) (← links)
- Efficient geometric operations on convex polyhedra, with an application to reachability analysis of hybrid systems (Q748756) (← links)
- Polynomial approximations of the relational semantics of imperative programs (Q859958) (← links)
- Change-of-bases abstractions for non-linear hybrid systems (Q901261) (← links)
- Efficient SAT-based bounded model checking for software verification (Q947794) (← links)
- Applications of polyhedral computations to the analysis and verification of hardware and software systems (Q1035700) (← links)
- Alloy*: a general-purpose higher-order relational constraint solver (Q2009609) (← links)
- On the efficiency of convex polyhedra (Q2130564) (← links)
- A note on the inversion join for polyhedral analysis (Q2814111) (← links)
- Speeding up polyhedral analysis by identifying common constraints (Q2814112) (← links)
- Finding Relevant Templates via the Principal Component Analysis (Q2961584) (← links)
- Generalizing the Template Polyhedral Domain (Q3000579) (← links)
- The Abstract Domain of Parallelotopes (Q5170166) (← links)
- Symbolic analysis of linear hybrid automata -- 25 years later (Q6113970) (← links)
- A change-based heuristic for static analysis with policy iteration (Q6536281) (← links)
- Revisiting polyhedral analysis for hybrid systems (Q6536287) (← links)
