The following pages link to (Q4068060):
Displayed 22 items.
- Precise interprocedural dataflow analysis with applications to constant propagation (Q671681) (← links)
- A region analysis algorithm for the live variables problem (Q799117) (← links)
- Transformational derivation of an improved alias analysis algorithm (Q815001) (← links)
- Properties of data flow frameworks: A unified model (Q910237) (← links)
- Efficient symbolic analysis of programs (Q1082800) (← links)
- The logic-termal equivalence is polynomial-time decidable (Q1144374) (← links)
- Tree equivalence of linear recursive schemata is polynomial-time decidable (Q1162152) (← links)
- Finite constants: Characterizations of a new decidable set of constants (Q1176239) (← links)
- Program equivalence and context-free grammars (Q1221492) (← links)
- Node listings for reducible flow graphs (Q1236887) (← links)
- Profitability computations on program flow graphs (Q1242449) (← links)
- Äquivalente Transformationen für Flußdiagramme (Q1249431) (← links)
- Bidirectional data flow analysis for type inferencing. (Q1399007) (← links)
- Automatic generation of interprocedural data-flow analyzers and optimizers (Q1433977) (← links)
- On sparse evaluation representations (Q1605227) (← links)
- Verified bytecode verifiers. (Q1874284) (← links)
- Instruction-level security analysis for information flow in stack-based assembly languages (Q2381502) (← links)
- A class of polynomially solvable range constraints for interval analysis without widenings (Q2575737) (← links)
- The Birth of Model Checking (Q3512430) (← links)
- Abstract Interpretation with Applications to Timing Validation (Q3512479) (← links)
- An algorithm for tracing live variables based on a straightened program graph (Q4101429) (← links)
- Program Analysis Using Weighted Pushdown Systems (Q5458821) (← links)