Precise interprocedural dataflow analysis with applications to constant propagation

DOI10.1016/0304-3975(96)00072-2zbMath0874.68133OpenAlexW2036157748WikidataQ56814419 ScholiaQ56814419MaRDI QIDQ671681

Susan Horwitz, Mooly Sagiv, Thomas W. Reps

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: http://digital.library.wisc.edu/1793/59994

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) General topics in the theory of software (68N01)

Related Items (23)

Automatically proving termination and memory safety for programs with pointer arithmetic ⋮ Precise interprocedural dependence analysis of parallel programs ⋮ Model Checking Procedural Programs ⋮ Automatic synthesis of data-flow analyzers ⋮ A program auto-parallelizer based on the component technology of optimizing compiler construction ⋮ Efficient interprocedural data-flow analysis using treedepth and treewidth ⋮ Inferring region types via an abstract notion of environment transformation ⋮ Solving Multiple Dataflow Queries Using WPDSs ⋮ Faster Algorithms for Weighted Recursive State Machines ⋮ Conditional Dyck-CFL Reachability Analysis for Complete and Efficient Library Summarization ⋮ Context-sensitive analysis without calling-context ⋮ Data flow analysis of asynchronous systems using infinite abstract domains ⋮ On edge addition rewrite systems and their relevance to program analysis ⋮ Interprocedural Shape Analysis for Effectively Cutpoint-Free Programs ⋮ Time Stamps for Fixed-Point Approximation ⋮ Demand-driven interprocedural analysis for map-based abstract domains ⋮ Program Analysis Using Weighted Pushdown Systems ⋮ Precise interprocedural dataflow analysis with applications to constant propagation ⋮ Asynchronous sequential processes ⋮ Reducing concurrent analysis under a context bound to sequential analysis ⋮ Interconvertibility of a class of set constraints and context-free-language reachability ⋮ A sparse evaluation technique for detailed semantic analyses ⋮ Syntax-directed model checking of sequential programs

Cites Work

• Finite constants: Characterizations of a new decidable set of constants
• Affine relationships among variables of a program
• The Alexander Method - a technique for the processing of recursive axioms in deductive databases
• Precise interprocedural dataflow analysis with applications to constant propagation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Precise interprocedural dataflow analysis with applications to constant propagation