Interprocedurally Analyzing Polynomial Identities
From MaRDI portal
Publication:5449786
DOI10.1007/11672142_3zbMath1136.68356OpenAlexW1483321687MaRDI QIDQ5449786
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
Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (6)
Analysing All Polynomial Equations in ${\mathbb Z_{2^w}}$ ⋮ Elimination Techniques for Program Analysis ⋮ Relational bytecode correlations ⋮ Inter-procedural Two-Variable Herbrand Equalities ⋮ Reasoning Algebraically About P-Solvable Loops ⋮ Invariant Checking for Programs with Procedure Calls
This page was built for publication: Interprocedurally Analyzing Polynomial Identities
