Iterative methods of program analysis

DOI10.1007/BF01070122MaRDI QIDQ4005340zbMATH OpenFDO

Authors

Publication date 26 September 1992

Published in Cybernetics (Search for Journal in Brave)

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

zbMATH Keywords

iterative methodsprogram analysisprogram invariant theoryprogram schemataverification

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites work

• A Simple Algorithm for Global Data Flow Analysis Problems
• Affine relationships among variables of a program
• Fast algorithms for the elimination of common subexpressions
• scientific article; zbMATH DE number 3592938 (Why is no real title available?)
• scientific article; zbMATH DE number 3198815 (Why is no real title available?)
• Monoids for Rapid Data Flow Analysis
• Monotone data flow analysis frameworks
• Variations on the Common Subexpression Problem

Cited in

(5)

• A method of proving the invariance of linear inequalities for linear loops
• Polynomial invariants for linear loops
• Analysis of linear definite iterative loops
• Nonlinear invariants for linear loops and eigenpolynomials of linear operators
• The structure of polynomial invariants of linear loops

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

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