PAG - An efficient program analyzer generator

International Journal on Software Tools for Technology Transfer

Volumn 2, Issue 1, 1998, Pages 46-67

  Martin, Florian ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

Abstract interpretation; Compiler construction; Data flow analysis; Interprocedural analysis; Specification and generation of analyzers

Indexed keywords

ABSTRACT INTERPRETATIONS; COMPILER CONSTRUCTION; COMPLEX DATA STRUCTURES; CONSTANT PROPAGATION; EFFICIENT IMPLEMENTATION; FIXED POINT ITERATION; INTER-PROCEDURAL ANALYSIS; PROGRAM TRANSFORMATIONS;

ABSTRACTING; ALGORITHMS; DATA FLOW ANALYSIS; PROGRAM COMPILERS; QUALITY CONTROL; SEMANTICS; SPECIFICATION LANGUAGES;

PHOTORESISTORS;

EID: 84896693327     PISSN: 14332779     EISSN: 14332787     Source Type: Journal    
DOI: 10.1007/s100090050017     Document Type: Article

References (38)

1. Alt, M., Ferdinand, C., Martin, F., Wilhelm, R.: Cache Behavior Prediction by Abstract Interpretation. In: Cousot, R., Schmidt, D. A. (eds.): SAS '96, Static Analysis Symposium, LNCS 1145. Berlin, Heidelberg, NewYork: Springer, 1996, pp. 51-66. Long version accepted for SAS. 96 special issue of Science of Computer Programming.
2. Alt, M., Martin, F.: Generation of Efficient Interprocedural Analyzers with PAG. In: Mycroft, A. (ed.): SAS '95, Static Analysis Symposium, LNCS 983. Berlin, Heidelberg, NewYork: Springer, 1995, pp. 33-50.
3. Alt, M., Martin, F.: Practical comparison of call string and functional approach in data flow analysis. In: Kuchen, H. (ed.): Arbeitstagung Programmiersprachen, Vol. 58 of Arbeitsberichte des Institutes für Wirtschaftsinformatik. Westfälische Wilhelms-Universität Münster, 1997.
4. Alt, M., Martin, F., Wilhelm, R.: Generating Dataflow Analyzers with PAG. Technical Report A 10-95, Universität des Saarlandes, 1995.
5. Aßmann, U.: How To Uniformly Specify Program Analysis and Transformation. In: Fritzson, P. (ed.): Proceedings of the 6th International Conference on Compiler Construction, LNCS 1060. Berlin, Heidelberg, NewYork: Springer, 1996, pp. 121-135.
6. Bourdoncle, F.: Efficient chaotic iteration strategies with widenings. In: Björner, D., Broy, M., Pottosin, I. V. (eds.): Proceedings of Formal Methods in Programming and Their Applications, LNCS 735. Berlin, Heidelberg, NewYork: Springer, 1993, pp. 128-141.
7. Callahan, D., Cooper, K. D., Kennedy, K., Torczon, L.: Interprocedural constant propagation. In: Proceedings of the ACM SIGPLAN'86 Symposium on Compiler Construction, Vol. 21, 1986, pp. 152-161.
8. Chambers, C., Dean, J., Grove, D.: Frameworks for Intra-and Interprocedural Dataflow Analysis. Technical Report TR-96-11-02, University of Washington, Department of Computer Science and Engineering, 1996.
9. Codish, M., Mulkers, A., Bruynooghe, M., de la Banda, M. G., Hermenegildo, M.: Improving Abstract Interpretations by Combining Domains. ACM Transactions on Programming Languages and Systems 17(1): 28-44, 1995.
10. Cousot, P., Cousot, R.: Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In: Conference Record of the 4th ACM Symposium on Principles of Programming Languages, 1977, ACM Press, pp. 238-252.
11. Cousot, P., Cousot, R.: Abstract Interpretation and applications to logic programs. Journal of Logic Programming 13(2-3): 103-180, 1992.
12. Emmelmann, H., Schroeer, F.-W., Landwehr, R.: BEG: A generator for efficient back ends. SIGPLAN Notices 24(7): 227-237, 1989.
13. Ferdinand, C., Martin, F., Wilhelm, R.: Applying Compiler Techniques to Cache Behavior Prediction. In: Workshop on Languages, Compilers and Tools for Real-Time Systems, pp. 37-46, 1997.
14. Fraser, C. W., Hanson, D. R., Proebsting, T. A.: Engineering a simple, efficient code generator generator. ACM Letters on Programming Languages and Systems 1(3): 213-226, 1992.
15. Giegerich, R., Mönke, U., Wilhelm, R.: Invariance of approximative semantics with respect to program transformation. In: Proceedings GI-11. Jahrestagung, Vol. 50 of Informatik Fachberichte, Berlin, Heidelberg, NewYork: Springer, 1981, pp. 1-10.
16. Glaser, H., Hankin, C., Till, D.: Principles of functional programming. Prentice-Hall, Englewood Cliffs, NJ, 1984.
17. Hall, M. W., Mellor-Crummey, J. M., Carle, A., Rodríguez, R. G.: FIAT: A framework for interprocedural analysis and transformations. In: Banerjee, U., Gelernter, D., Nicolau, A., Padua, D. (eds.): Proceedings of the 6th Workshop on Languages and Compilers for Parallel Computing, LNCS 768. Berlin, Heidelberg, NewYork: Springer, 1993, pp. 522-545.
18. Jones, N. D., Nielson, F.: Abstract Interpretation: A Semantics Based Tool for Program Analysis. In: Handbook of Logic in Computer Science, Oxford University Press, 1995.
19. Kam, J., Ullman, J. D.: Monotone data flow analysis frameworks. Acta Informatica 7: 305-317, 1977.
20. Knoop, J., Rüthing, O., Steffen, B.: Towards a tool kit for the automatic generation of interprocedural data flow analyses. Journal of Programming Languages 4: 211-246, 1996.
21. Knoop, J., Steffen, B.: The Interprocedural Coincidence Theorem. In: Proceedings of the 4th International Conference on Compiler Construction, LNCS 641. Berlin, Heidelberg, NewYork: Springer, 1992, pp. 125-140.
22. Marlowe, T. J., Ryder, B. G.: Properties of dataflow frameworks: A unified model. Acta Informatica 28, 1990.
23. Martin, F.: Entwurf und Implementierung eines Generators für Datenflußanalysatoren. Masterthesis, Universität des Saarlandes, 1995.
24. Martin, F., Alt, M., Ferdinand, C., Wilhelm, R.: Analysis of Loops. In: Koskimies, K. (ed.): Proceedings of the 7th International Conference on Compiler Construction, LNCS 1383. Berlin, Heidelberg, NewYork: Springer, 1998, pp. 80-94.
25. Milner, R., Tofte, M., Harper, R.: The Definition of Standard ML. MIT Press, 1990.
26. Nielson, F., Nielson, H. R., Hankin, C. L.: Principles of Program Analysis-Flows and Effects. Preliminary version of March 4, 1998; complete version to appear 1999.
27. Reps, T., Horwitz, S., Sagiv, M.: Precise interprocedural dataflow analysis via graph reachability. In: Conference Record of the 22nd ACM Symposium on Principles of Programming Languages, ACM Press, 1995, pp. 49-61.
28. Sagiv, M., Reps, T., Wilhelm, R.: Solving Shape-Analysis Problems in Languages with Destructive Updating. In: Conference Record of the 23rd ACM Symposium on Principles of Programming Languages. ACM Press, 1996.
29. Sander, G.: Graph layout through the VCG tool. In: Proceedings of the DIMACS International Workshop on Graph Drawing, LNCS 894. Berlin, Heidelberg, NewYork: Springer, 1994, pp. 194-205.
30. Sharir, M., Pnueli, A.: Two Approaches to Interprocedural Data Flow Analysis. In: Muchnick, S. S., Jones, N. D. (eds.): Program Flow Analysis: Theory and Applications, Chap. 7. Prentice-Hall, 1981, pp. 189-233.
31. Steffen, B.: Generating data flow analysis algorithms from modal specifications. International Journal on Science of Computer Programming 21: 115-139, 1993.
32. Steffen, B., Claßen, A., Klein, M., Knoop, J., Margaria, T.: The fixpoint analysis machine. In: Lee, I., Smolka, S. A. (eds.): Proceedings of the 6th International Conference on Concurrency Theory, LNCS 962. Berlin, Heidelberg, NewYork: Springer, 1995, pp. 72-87.
33. Thesing, S., Martin, F., Lauer, O., Alt, M.: PAG User's Manual, 1997.
34. Tjiang, S. W. K., Hennessy, J. L.: Sharlit-A tool for building optimizers. In: Proceedings of the ACM SIGPLAN'92 Conference on Programming Language Design and Implementation, Vol. 27. ACM Press, 1992, pp. 82-93.
35. Venkatesch, G., Fischer, C. N.: Spare: A development environment for Program Analysis Algorithms. In: IEEE Transactions Software Engineering, Vol. 18, 1992.
36. Wegman, M. N., Zadeck, F. K.: Constant propagation with conditional branches. In: Conference Record of the 12th ACM Symposium on Principles of Programming Languages, ACM Press, 1985, pp. 291-299.
37. Wilhelm, R., Maurer, D.: Compiler Design. International Computer Science Series. Addison-Wesley, 1995.
38. Yi, K., Harrison III, W. L.: Automatic generation and management of interprocedural program analyses. In: Conference Record of the 20th ACM Symposium on Principles of Programming Languages, ACM Press, 1993, pp. 246-259.