Iterative methods of program analysis: Equalities and inequalities

DOI10.1007/BF01082683MaRDI QIDQ4007457zbMATH OpenFDO

Authors

Publication date 27 September 1992

Published in Cybernetics (Search for Journal in Brave)

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

zbMATH Keywords

algebras of dataprogram analysisprogram invariants

Mathematics Subject Classification ID

Semigroups in automata theory, linguistics, etc. (20M35) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Cites work

• scientific article; zbMATH DE number 3731337 (Why is no real title available?)
• scientific article; zbMATH DE number 3497890 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• Invariant inequalities in programs interpreted over an ordered field
• On the Intersection of Finitely Generated Free Groups
• THE ABSTRACT THEORY OF AUTOMATA

Cited in

(2)

• A method of proving the invariance of linear inequalities for linear loops
• Analysis of linear definite iterative loops

This page was built for publication: Iterative methods of program analysis: Equalities and inequalities

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