Polynomial approximations of the relational semantics of imperative programs

DOI10.1016/J.SCICO.2006.03.004zbMATH Open1171.68541OpenAlexW1997562124MaRDI QIDQ859958FDOQ859958

Authors: Michael A. Colón 

Publication date: 22 January 2007

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.scico.2006.03.004

Recommendations

• Static Analysis
• Computing polynomial program invariants
• Inference of polynomial invariants for imperative programs: a farewell to Gröbner bases
• Static Analysis by Policy Iteration on Relational Domains
• Verification, Model Checking, and Abstract Interpretation

zbMATH Keywords

abstract interpretationrelational semanticsprogram analysispolynomial invariantspolynomial idealsnon-linear invariants

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Semantics in the theory of computing (68Q55)

Cited In (8)

• Complete semialgebraic invariant synthesis for the Kannan-Lipton orbit problem
• Static Analysis
• Interprocedurally Analyzing Polynomial Identities
• Under-Approximations of Computations in Real Numbers Based on Generalized Affine Arithmetic
• Analysing All Polynomial Equations in ${\mathbb Z_{2^w}}$
• Analysis of the equality relations for the program terms
• Computing properties of numerical imperative programs by symbolic computation
• Computing polynomial program invariants

This page was built for publication: Polynomial approximations of the relational semantics of imperative programs

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