Pages that link to "Item:Q671681"
From MaRDI portal
The following pages link to Precise interprocedural dataflow analysis with applications to constant propagation (Q671681):
Displaying 34 items.
- Context-sensitive analysis without calling-context (Q656869) (← links)
- Asynchronous sequential processes (Q1013090) (← links)
- Reducing concurrent analysis under a context bound to sequential analysis (Q1039852) (← links)
- Efficient symbolic analysis of programs (Q1082800) (← links)
- An efficient general iterative algorithm for dataflow analysis (Q1088400) (← links)
- Interprocedural analyses of Fortran programs (Q1128864) (← links)
- A logic-based approach to program flow analysis (Q1130162) (← links)
- Finite constants: Characterizations of a new decidable set of constants (Q1176239) (← links)
- Interconvertibility of a class of set constraints and context-free-language reachability (Q1583350) (← links)
- Demand-driven interprocedural analysis for map-based abstract domains (Q1785851) (← links)
- PAG -- an efficient program analyzer generator (Q1856182) (← links)
- Syntax-directed model checking of sequential programs (Q1858441) (← links)
- Precise interprocedural dependence analysis of parallel programs (Q1884938) (← links)
- Automatic synthesis of data-flow analyzers (Q2145353) (← links)
- Data flow analysis of asynchronous systems using infinite abstract domains (Q2233447) (← links)
- A sparse evaluation technique for detailed semantic analyses (Q2339156) (← links)
- Automatically proving termination and memory safety for programs with pointer arithmetic (Q2362494) (← links)
- A program auto-parallelizer based on the component technology of optimizing compiler construction (Q2654999) (← links)
- Quantitative interprocedural analysis (Q2819838) (← links)
- Strategies for source-to-source constant propagation (Q2843613) (← links)
- Faster Algorithms for Weighted Recursive State Machines (Q2988644) (← links)
- Conditional Dyck-CFL Reachability Analysis for Complete and Efficient Library Summarization (Q2988672) (← links)
- Model Checking Procedural Programs (Q3176375) (← links)
- Global Data Flow Analysis Problems Arising in Locally Least-Cost Error Recovery (Q3321438) (← links)
- Solving Multiple Dataflow Queries Using WPDSs (Q3522064) (← links)
- Finite constants: Characterizations of a new decidable set of constants (Q3975169) (← links)
- (Q4411963) (← links)
- On edge addition rewrite systems and their relevance to program analysis (Q4645285) (← links)
- Interprocedural Shape Analysis for Effectively Cutpoint-Free Programs (Q4916088) (← links)
- Time Stamps for Fixed-Point Approximation (Q4917049) (← links)
- Precise interprocedural dataflow analysis with applications to constant propagation (Q5096757) (← links)
- Program Analysis Using Weighted Pushdown Systems (Q5458821) (← links)
- Static Analysis (Q5466570) (← links)
- Programming Languages and Systems (Q5902359) (← links)
