Efficient symbolic analysis of programs

DOI10.1016/0022-0000(86)90031-0zbMath0603.68012OpenAlexW2023850308MaRDI QIDQ1082800

John H. Reif, Harry R. Lewis

Publication date: 1986

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(86)90031-0

zbMATH Keywords

fixed pointcoverprogram verificationloop invariantsflow graphsoptimizing compilercode motionconstant propagationprogram optimizationssymbolic expressiontext expression

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Properties of data flow frameworks: A unified model ⋮ Finite constants: Characterizations of a new decidable set of constants

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient approximate solution of sparse linear systems
• Monotone data flow analysis frameworks
• Fast algorithms for the elimination of common subexpressions
• Code Motion
• A fast algorithm for finding dominators in a flowgraph
• Symbolic Program Analysis in Almost-Linear Time
• Global Data Flow Analysis and Iterative Algorithms
• Symbolic execution and program testing
• A Simple Algorithm for Global Data Flow Analysis Problems
• Logical analysis of programs
• Program Improvement by Source-to-Source Transformation
• Optimization of very high level languages—I
• Symbolic Evaluation and the Analysis of Programs
• Some Topics in Code Optimization
• The synthesis of loop predicates
• The theory of languages
• Depth-First Search and Linear Graph Algorithms
• Flow Graph Reducibility

This page was built for publication: Efficient symbolic analysis of programs