Polynomial approximations of the relational semantics of imperative programs

DOI10.1016/j.scico.2006.03.004zbMath1171.68541OpenAlexW1997562124MaRDI QIDQ859958

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

zbMATH Keywords

relational semanticsprogram analysispolynomial idealspolynomial invariantsabstract interpretationnon-linear invariants

Mathematics Subject Classification ID

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

Related Items (3)

Analysing All Polynomial Equations in ${\mathbb Z_{2^w}}$ ⋮ Algebra, Coalgebra, and Minimization in Polynomial Differential Equations ⋮ Complete semialgebraic invariant synthesis for the Kannan-Lipton orbit problem

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