Approximating the algebraic relational semantics of imperative programs

DOI10.1007/978-3-540-27864-1_22MaRDI QIDQ5466568zbMATH OpenOpenAlexFDO

Authors Michael A. Colón

Publication date 24 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55) Symbolic computation and algebraic computation (68W30)

Recommendations

• Polynomial approximations of the relational semantics of imperative programs
• Algebraic program analysis
• Precise interprocedural analysis through linear algebra
• Inference of polynomial invariants for imperative programs: a farewell to Gröbner bases
• An algebraic approach to the static analysis of concurrent software

Cited in

(9)

• Generalizations of algorithms that find invariant relationships in programs over algebra of terms
• Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures
• Generating all polynomial invariants in simple loops
• Constructing invariants for hybrid systems
• scientific article; zbMATH DE number 1042220 (Why is no real title available?)
• Elimination Techniques for Program Analysis
• On termination of polynomial programs with equality conditions
• Polynomial approximations of the relational semantics of imperative programs
• Change-of-bases abstractions for non-linear hybrid systems

This page was built for publication: Approximating the algebraic relational semantics of imperative programs

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