Iterative methods of program analysis
From MaRDI portal
Publication:4005340
DOI10.1007/BF01070122zbMath0800.68546MaRDI QIDQ4005340
No author found.
Publication date: 26 September 1992
Published in: Cybernetics (Search for Journal in Brave)
Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01)
Related Items (5)
Analysis of linear definite iterative loops ⋮ The structure of polynomial invariants of linear loops ⋮ Nonlinear invariants for linear loops and eigenpolynomials of linear operators ⋮ Polynomial invariants for linear loops ⋮ A method of proving the invariance of linear inequalities for linear loops
Cites Work
- Unnamed Item
- Unnamed Item
- Affine relationships among variables of a program
- Monotone data flow analysis frameworks
- Fast algorithms for the elimination of common subexpressions
- Monoids for Rapid Data Flow Analysis
- Variations on the Common Subexpression Problem
- A Simple Algorithm for Global Data Flow Analysis Problems
This page was built for publication: Iterative methods of program analysis