Static Analysis

DOI10.1007/11547662zbMATH Open1141.68654OpenAlexW4229853237MaRDI QIDQ5897441FDOQ5897441

Authors: Axel Simon, Andy King 

Publication date: 31 October 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11547662

Recommendations

• Projection onto a polyhedron that exploits sparsity
• Scalable Minimizing-Operators on Polyhedra via Parametric Linear Programming
• Sparsity preserving algorithms for octagons
• Speeding up polyhedral analysis by identifying common constraints
• scientific article; zbMATH DE number 1615255

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Nonnumerical algorithms (68W05) Computational aspects related to convexity (52B55)

Cited In (11)

• Summarized dimensions revisited
• Computational tools for solving a marginal problem with applications in Bell non-locality and causal modeling
• Projection onto a polyhedron that exploits sparsity
• Stratified static analysis based on variable dependencies
• Efficient elimination of redundancies in polyhedra by raytracing
• Splitting the Control Flow with Boolean Flags
• A note on the inversion join for polyhedral analysis
• Speeding up polyhedral analysis by identifying common constraints
• Approximating polyhedra with sparse inequalities
• The two variable per inequality abstract domain
• Logahedra: a new weakly relational domain

This page was built for publication: Static Analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897441)