Inferring Min and Max Invariants Using Max-Plus Polyhedra
From MaRDI portal
Publication:3522071
DOI10.1007/978-3-540-69166-2_13zbMath1149.68346OpenAlexW1499377964MaRDI QIDQ3522071
Xavier Allamigeon, Eric Goubault, Stéphane Gaubert
Publication date: 28 August 2008
Published in: Static Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69166-2_13
Related Items (19)
Donut Domains: Efficient Non-convex Domains for Abstract Interpretation ⋮ Model Checking Real-Time Systems ⋮ Static analysis of ReLU neural networks with tropical polyhedra ⋮ Computational techniques for reachability analysis of Max-Plus-Linear systems ⋮ Model-Based Verification, Optimization, Synthesis and Performance Evaluation of Real-Time Systems ⋮ The number of extreme points of tropical polyhedra ⋮ Block-Wise Abstract Interpretation by Combining Abstract Domains with SMT ⋮ Computing the vertices of tropical polyhedra using directed hypergraphs ⋮ Tropical linear-fractional programming and parametric mean payoff games ⋮ Reachability analysis for timed automata using max-plus algebra ⋮ Linear Absolute Value Relation Analysis ⋮ On just-in-time control of timed event graphs with input constraints: a semimodule approach ⋮ On the complexity of strongly connected components in directed hypergraphs ⋮ Geometric Quantifier Elimination Heuristics for Automatically Generating Octagonal and Max-plus Invariants ⋮ On the control of max-plus linear system subject to state restriction ⋮ Approximating the volume of tropical polytopes is difficult ⋮ Conditional reachability of uncertain max plus linear systems ⋮ Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships ⋮ The tropical analogue of polar cones
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Minkowski theorem for max-plus convex sets
- Generators, extremals and bases of max cones
- Affine relationships among variables of a program
- Duality and separation theorems in idempotent semimodules.
- Tropical convexity
- Static Analysis in Disjunctive Numerical Domains
- Static Analysis of String Manipulations in Critical Embedded C Programs
- The duality theorem for min-max functions
- Methods and applications of (max,+) linear algebra
- A framework for numeric analysis of array operations
- Programming Languages and Systems
- Sufficient Preconditions for Modular Assertion Checking
- Non-disjunctive Numerical Domain for Array Predicate Abstraction
- Max-Plus Convex Geometry
- Algorithm for discovering the set of all the solutions of a linear programming problem
- Verification, Model Checking, and Abstract Interpretation
- Idempotent functional analysis: An algebraic approach
This page was built for publication: Inferring Min and Max Invariants Using Max-Plus Polyhedra
