Precise interprocedural dataflow analysis with applications to constant propagation

DOI10.1007/3-540-59293-8_226zbMath1496.68079OpenAlexW1608142476MaRDI QIDQ5096757

Mooly Sagiv, Susan Horwitz, Thomas W. Reps

Publication date: 18 August 2022

Published in: TAPSOFT '95: Theory and Practice of Software Development (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59293-8_226

Mathematics Subject Classification ID

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

Related Items (16)

Enforcing Programming Guidelines with Region Types and Effects ⋮ Finding suitable variability abstractions for lifted analysis ⋮ Horn Clause Solvers for Program Verification ⋮ Analysis and Transformation of Constrained Horn Clauses for Program Verification ⋮ Symbolic abstract heaps for polymorphic information-flow guard inference ⋮ Using Counterexample Analysis to Minimize the Number of Predicates for Predicate Abstraction ⋮ Efficient interprocedural data-flow analysis using treedepth and treewidth ⋮ Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis ⋮ Solving Multiple Dataflow Queries Using WPDSs ⋮ Conditional Dyck-CFL Reachability Analysis for Complete and Efficient Library Summarization ⋮ Precise interprocedural dataflow analysis with applications to constant propagation ⋮ SMT-based model checking for recursive programs ⋮ Automated Program Verification ⋮ Interprocedural Analysis of Concurrent Programs Under a Context Bound ⋮ Upper Adjoints for Fast Inter-procedural Variable Equalities ⋮ Program Analysis Using Weighted Pushdown Systems

Cites Work

• Unnamed Item
• Precise interprocedural dataflow analysis with applications to constant propagation
• Finite constants: Characterizations of a new decidable set of constants
• Affine relationships among variables of a program

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