Interprocedurally Analyzing Polynomial Identities

DOI10.1007/11672142_3MaRDI QIDQ5449786zbMATH OpenOpenAlexFDO

Authors Markus Müller-Olm, Michael Petter, Helmut Seidl

Publication date 19 March 2008

Published in STACS 2006 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Computing polynomial program invariants
• Polynomial approximations of the relational semantics of imperative programs
• Precise interprocedural analysis through linear algebra
• Static Analysis
• Inference of polynomial invariants for imperative programs: a farewell to Gröbner bases

Cited in

(5)

• Invariant Checking for Programs with Procedure Calls
• Analysing All Polynomial Equations in ${\mathbb Z_{2^w}}$
• Elimination Techniques for Program Analysis
• Reasoning Algebraically About P-Solvable Loops
• Relational bytecode correlations

This page was built for publication: Interprocedurally Analyzing Polynomial Identities

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