Specialization of imperative programs through analysis of relational expressions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1110, Issue , 1996, Pages 429-445

  Sakharov, Alexander ^a  

^a MOTOROLA INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FLOW GRAPHS; GRAPHIC METHODS; INFERENCE ENGINES;

CONDITIONAL BRANCH; CONTROL FLOW GRAPHS; FIX-POINT ALGORITHMS; IMPERATIVE PROGRAMS; INTER-PROCEDURAL; PROGRAM POINTS; RESIDUAL PROGRAMS; RULE-BASED INFERENCE;

DATA FLOW ANALYSIS;

EID: 84957678840     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61580-6_21     Document Type: Conference Paper

References (26)

1. A.V. Aho, R. Sethi, J. D. Ullman, Compilers. Principles, Techniques, and Tools, Addison-Wesley, 1986.
2. L. 0. Andersen. Partial Evaluation of C and Automatic Compiler Generation. Lecture Notes in Computer Science, v. 641, 1992, 251-257.
3. R. Baier, R. Glueck, R. Zochling. Partial Evaluation of Numerical Programs in Fortran. Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation, 1994, 119-132.
4. S. Blazy, P. Facon. Partial Evaluation for The Understanding of Fortran Programs. International Journal of Software Engineering and Knowledge Engineering, v. 4, 1994, #4, 535-559.
5. F. Bourdoncle. Abstract Debugging of Higher-Order Imperative Languages. Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 1993, 47-55.
6. M. A. Bulyonkov. Polyvariant Mixed Computation for Analyzer Programs. Acta Informatica, v. 21, 1984, 473-484.
7. P.R. Carini, M. Hind. Flow-Sensitive Interprocedural Constant Propagation. Proceedings of the SIGPLAN Symposium on Programming Language Design and Implementation, 1995, 23-31.
8. C.-L. Chang, R. C.-T. Lee. Symbolic Logic and Mechanical Theorem Proving, Academic Press, 1973.
9. C. Consel, S.C. Khoo. Parameterized Partial Evaluation. ACM Transactions on Programming Languages and Systems, v. 15, 1993, #3, 463-493.
10. P. Cousot, R. Cousot. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. Proceedings of the ACM Symposium on Principles of Programming Languages, 1977, 238-252.
11. C.N. Fisher, R.J. LeBlanc, Jr. Crafting A Compiler, Benjamin/Cummings, 1988.
12. Y. Futamura, K. Nogi. Generalized partial computation. In: Partial Evaluation and Mixed Computation (D. Bjomer, A.P. Ershov, N.D. Jones, Eds.), North-Holland, 1988.
13. R. Glueck, A. V. Klimov. Occam's Razor in Metacomputation: the Notion of a Perfect Process Tree. Lecture Notes in Computer Science, v. 724, 1993, 112-123.
14. M.S. Hecht. Flow Analysis of Computer Programs, Elsevier North-Holland, 1977.
15. H. Johnson. Data Flow Analysis for 'Intractable' System Software. Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 1986, 109-117.
16. N. Jones. The Essence of Program Transformation by Partial Evaluation and Driving. Lecture Notes in Computer Science, v. 792, 1994, 206-224.
17. N.D. Jones, C. K. Gomard, P. Sestoft. Partial Evaluation and Automatic Program Generation, Prentice Hall, 1993.
18. J.B. Kam, J.D. Ullman. Monotone Data Flow Analysis Frameworks. Acta Informatica, v. 7, 1977, 305-317.
19. D.E. Knuth, P.B. Benda. Simple Word Problems in Universal Algebras. In: Computational Problems in Abstract Algebra (J. Leech, Ed.), Pergamon Press, 1970.
20. W. Landi, B.G. Ryder. A Safe Approximate Algorithm for Interprocedural Pointer Aliasing. Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 1992, 235-248.
21. U. Meyer. Techniques for Partial Evaluation of Imperative Languages. Proceedings of the ACM Symposium on Partial Evaluation and Semantics-Based Program Manipulation, 1991, 94-105.
22. F. Mueller, D.B. Whalley. Avoiding Conditional Branches by Code Replication. Proceedings of the SIGPLAN Symposium on Programming Language Design and Implementation, 1995, 56-66.
23. S. Sagiv et al. A Logic-Based Approach to Data Flow Analysis Problems. Lecture Notes in Computer Science, v. 456, 1990, 52-65.
24. A. Sakharov. Propagation of Constants and Assertions. SIGPLAN Notices, v. 29, 1994, #5, 36.
25. B. Wegbreit. Property Extraction in Well-Founded Property Sets. IEEE Transactions on Software Engineering, v. 1, 1977, #3, 270-285.
26. M.N. Wegman, F.K. Zadeck. Constant Propagation with Conditional Branches. ACM Transactions on Programming Languages and Systems, v. 13, 1991, #2, 181-210.