Pages that link to "Item:Q1245693"
From MaRDI portal
The following pages link to Monotone data flow analysis frameworks (Q1245693):
Displayed 20 items.
- XML graphs in program analysis (Q532414) (← links)
- A region analysis algorithm for the live variables problem (Q799117) (← links)
- Transformational derivation of an improved alias analysis algorithm (Q815001) (← links)
- Using postdomination to reduce space requirements of data flow analysis (Q844147) (← links)
- Properties of data flow frameworks: A unified model (Q910237) (← links)
- Mixed computation and compilation: New approaches to old problems (Q912601) (← links)
- Efficient symbolic analysis of programs (Q1082800) (← links)
- Eliminating partially dead code in explicitly parallel programs (Q1128737) (← links)
- Finite constants: Characterizations of a new decidable set of constants (Q1176239) (← links)
- A security flow control algorithm and its denotational semantics correctness proof (Q1203126) (← links)
- Bidirectional data flow analysis for type inferencing. (Q1399007) (← links)
- The tree equivalence of linear recursion schemes (Q1575234) (← links)
- Program reduction allowing for additional specifications (Q1910970) (← links)
- Dataflow Analysis for Datarace-Free Programs (Q3000580) (← links)
- The Birth of Model Checking (Q3512430) (← links)
- Abstract Interpretation with Applications to Timing Validation (Q3512479) (← links)
- Search for invariant linear relationships in programs (Q3698287) (← links)
- Iterative methods of program analysis (Q4005340) (← links)
- Program Analysis Using Weighted Pushdown Systems (Q5458821) (← links)
- Transfer Function Synthesis without Quantifier Elimination (Q5892491) (← links)