Pages that link to "Item:Q5711496"
From MaRDI portal
The following pages link to Verification, Model Checking, and Abstract Interpretation (Q5711496):
Displayed 44 items.
- Abstract interpretation meets convex optimization (Q435969) (← links)
- Tropical linear-fractional programming and parametric mean payoff games (Q435971) (← links)
- Acceleration of the abstract fixpoint computation in numerical program analysis (Q435974) (← links)
- Discovering invariants via simple component analysis (Q435979) (← links)
- Reachability computation for polynomial dynamical systems (Q526433) (← links)
- Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness (Q845242) (← links)
- A minimalistic look at widening operators (Q848744) (← links)
- Property-directed incremental invariant generation (Q939166) (← links)
- Pentagons: a weakly relational abstract domain for the efficient validation of array accesses (Q988565) (← links)
- Applications of polyhedral computations to the analysis and verification of hardware and software systems (Q1035700) (← links)
- Improving the results of program analysis by abstract interpretation beyond the decreasing sequence (Q1620957) (← links)
- Descending chains and narrowing on template abstract domains (Q1671249) (← links)
- Experimental evaluation of numerical domains for inferring ranges (Q2130561) (← links)
- On the efficiency of convex polyhedra (Q2130564) (← links)
- Numerical invariants through convex relaxation and max-strategy iteration (Q2248100) (← links)
- Template polyhedra and bilinear optimization (Q2322312) (← links)
- A new abstraction framework for affine transformers (Q2322316) (← links)
- Certification of real inequalities: templates and sums of squares (Q2349133) (← links)
- Policy iteration in finite templates domain (Q2520672) (← links)
- Abstract Fixpoint Computations with Numerical Acceleration Methods (Q2814099) (← links)
- View-Augmented Abstractions (Q2814101) (← links)
- Static Analysis by Abstract Interpretation: A Mathematical Programming Approach (Q2814107) (← links)
- A Note on the Inversion Join for Polyhedral Analysis (Q2814111) (← links)
- Synthesizing Switching Controllers for Hybrid Systems by Generating Invariants (Q2842646) (← links)
- Template-Based Unbounded Time Verification of Affine Hybrid Automata (Q2901366) (← links)
- Block-Wise Abstract Interpretation by Combining Abstract Domains with SMT (Q2961574) (← links)
- Finding Relevant Templates via the Principal Component Analysis (Q2961584) (← links)
- Sound Bit-Precise Numerical Domains (Q2961585) (← links)
- Linear Absolute Value Relation Analysis (Q3000578) (← links)
- Generalizing the Template Polyhedral Domain (Q3000579) (← links)
- Improving Strategies via SMT Solving (Q3000582) (← links)
- Combining Model Checking and Deduction (Q3176378) (← links)
- Counterexample-Guided Refinement of Template Polyhedra (Q3303915) (← links)
- Logahedra: A New Weakly Relational Domain (Q3648708) (← links)
- The Abstract Domain of Parallelotopes (Q5170166) (← links)
- TreeKs: A Functor to Make Numerical Abstract Domains Scalable (Q5170170) (← links)
- An Accurate Join for Zonotopes, Preserving Affine Input/Output Relations (Q5170172) (← links)
- Proving Termination by Policy Iteration (Q5170173) (← links)
- Complexity and Algorithms for Monomial and Clausal Predicate Abstraction (Q5191104) (← links)
- Narrowing Operators on Template Abstract Domains (Q5206948) (← links)
- Invariant Synthesis for Combined Theories (Q5452621) (← links)
- Validating numerical semidefinite programming solvers for polynomial invariants (Q5916266) (← links)
- A topological method for finding invariant sets of continuous systems (Q5925511) (← links)
- Symbolic analysis of linear hybrid automata -- 25 years later (Q6113970) (← links)