Analysing All Polynomial Equations in ${\mathbb Z_{2^w}}$

DOI10.1007/978-3-540-69166-2_20zbMath1149.68366OpenAlexW131466369MaRDI QIDQ3522079

Michael Petter, Helmut Seidl, Andrea Flexeder

Publication date: 28 August 2008

Published in: Static Analysis (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Semantics in the theory of computing (68Q55) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automatic generation of polynomial invariants of bounded degree using abstract interpretation
• Polynomial approximations of the relational semantics of imperative programs
• Affine relationships among variables of a program
• On polynomial functions (mod m)
• Computing polynomial program invariants
• Non-linear loop invariant generation using Gröbner bases
• Programming Languages and Systems
• Interprocedurally Analyzing Polynomial Identities
• Static Analysis

This page was built for publication: Analysing All Polynomial Equations in ${\mathbb Z_{2^w}}$