Scalable analysis of linear systems using mathematical programming
From MaRDI portal
Recommendations
Cited in
(47)- Applications of polyhedral computations to the analysis and verification of hardware and software systems
- Improving the results of program analysis by abstract interpretation beyond the decreasing sequence
- Descending chains and narrowing on template abstract domains
- Experimental evaluation of numerical domains for inferring ranges
- On the efficiency of convex polyhedra
- Numerical invariants through convex relaxation and max-strategy iteration
- Template polyhedra and bilinear optimization
- A new abstraction framework for affine transformers
- Certification of real inequalities: templates and sums of squares
- Policy iteration in finite templates domain
- Abstract fixpoint computations with numerical acceleration methods
- View-augmented abstractions
- Static analysis by abstract interpretation: a mathematical programming approach
- A note on the inversion join for polyhedral analysis
- Synthesizing switching controllers for hybrid systems by generating invariants
- Template-based unbounded time verification of affine hybrid automata
- Block-wise abstract interpretation by combining abstract domains with SMT
- Finding relevant templates via the principal component analysis
- Sound bit-precise numerical domains
- Linear absolute value relation analysis
- Generalizing the template polyhedral domain
- Improving strategies via SMT solving
- Combining Model Checking and Deduction
- Counterexample-Guided Refinement of Template Polyhedra
- SubPolyhedra: A (More) Scalable Approach to Infer Linear Inequalities
- Logahedra: a new weakly relational domain
- Abstract interpretation meets convex optimization
- Tropical linear-fractional programming and parametric mean payoff games
- Acceleration of the abstract fixpoint computation in numerical program analysis
- Discovering invariants via simple component analysis
- scientific article; zbMATH DE number 2113061 (Why is no real title available?)
- The abstract domain of parallelotopes
- \textsf{TreeKs}: a functor to make numerical abstract domains scalable
- An accurate join for zonotopes, preserving affine input/output relations
- Proving termination by policy iteration
- Complexity and Algorithms for Monomial and Clausal Predicate Abstraction
- Narrowing operators on template abstract domains
- Reachability computation for polynomial dynamical systems
- Invariant Synthesis for Combined Theories
- Validating numerical semidefinite programming solvers for polynomial invariants
- A topological method for finding invariant sets of continuous systems
- Symbolic analysis of linear hybrid automata -- 25 years later
- On the Monniaux problem in abstract interpretation
- Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness
- A minimalistic look at widening operators
- Property-directed incremental invariant generation
- Pentagons: a weakly relational abstract domain for the efficient validation of array accesses
This page was built for publication: Scalable analysis of linear systems using mathematical programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5711496)
