Interprocedurally Analysing Linear Inequality Relations

DOI10.1007/978-3-540-71316-6_20zbMATH Open1187.68159OpenAlexW1519509320MaRDI QIDQ5756501FDOQ5756501

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

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

Mathematics Subject Classification ID

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

Cited In (10)

• Linear absolute value relation analysis
• Programming Languages and Systems
• Static Analysis
• Computing Procedure Summaries for Interprocedural Analysis
• Disjunctive relational abstract interpretation for interprocedural program analysis
• Title not available (Why is that?)
• SubPolyhedra: A (More) Scalable Approach to Infer Linear Inequalities
• Quantitative interprocedural analysis
• Precise interprocedural analysis through linear algebra
• Beyond Iteration Vectors: Instancewise Relational Abstract Domains

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)