Interprocedurally Analysing Linear Inequality Relations

DOI10.1007/978-3-540-71316-6_20MaRDI QIDQ5756501zbMATH OpenOpenAlexFDO

Authors Helmut Seidl, Andrea Flexeder, Michael Petter

Publication date 4 September 2007

Published in Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-71316-6_20

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Precise interprocedural analysis through linear algebra
• Linear absolute value relation analysis
• Static Analysis
• Computing Procedure Summaries for Interprocedural Analysis
• Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships

Cited in

(10)

• Precise interprocedural analysis through linear algebra
• Computing Procedure Summaries for Interprocedural Analysis
• SubPolyhedra: A (More) Scalable Approach to Infer Linear Inequalities
• scientific article; zbMATH DE number 2017362 (Why is no real title available?)
• Beyond Iteration Vectors: Instancewise Relational Abstract Domains
• Static Analysis
• Linear absolute value relation analysis
• Quantitative interprocedural analysis
• Programming Languages and Systems
• Disjunctive relational abstract interpretation for interprocedural program analysis

This page was built for publication: Interprocedurally Analysing Linear Inequality Relations

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