Transforming the .NET intermediate language using path logic programming

Proceedings of the ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP'02)

Volumn , Issue , 2002, Pages 133-144

  Drape, Stephen ^a   De Moor, Oege ^a   Sittampalam, Ganesh ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Compiler Optimisations; Logic Programming; Meta Programming; Obfuscation; Program Analysis; Program Transformation

Indexed keywords

ARRAYS; BOOLEAN FUNCTIONS; DATA STRUCTURES; GRAPH THEORY; JAVA PROGRAMMING LANGUAGE; LOGIC PROGRAMMING; OPTIMIZATION; PROGRAM COMPILERS;

INTERMEDIATE LANGUAGES; META PROGRAMMING;

PROLOG (PROGRAMMING LANGUAGE);

EID: 0036989068     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/571157.571171     Document Type: Conference Paper

References (32)

1. AHO, A., SETHI, R., AND ULLMAN, J. Compilers: Principles, Techniques, and Tools. Addison-Wesley, 1985.
2. ARCHER, T. Inside C#. Microsoft Press, 2001.
3. ASSMANN, U. How to specify program analysis and transformation with graph rewrite systems. In Compiler Construction 1996 (1996), P. Fritzson, Ed., vol. 1060 of Lecture Notes in Computer Science, pp. 372-395.
4. BIK, A. J. C., BRINKHAUS, P. J., KNIJNENBURG, P. M. W., AND WIJSHOFF, H. A. G. Transformation mechanisms in MT1. Technical report, Leiden Institute of Advanced Computer Science, 1998.
5. BOROVANSKÝ, P., KIRCHNER, C., KIRCHNER, H., AND RINGEISSEN, C. Rewriting with strategies in ELAN: a functional semantics. International Journal of Foundations of Computer Science 12, 1 (2001), 69-98. Also available as Technical Report A01-R-388, LORIA, Nancy (France).
6. BUNEMAN, P., FERNANDEZ, M., AND SUCIU, D. UnQL: A query language and algebra for semistructured data based on structural recursion. VLDB Journal 9, 1 (2000), 76-110.
7. CHOU, A., CHELF, B., HALLAM, S., AND ENGLER, D. Checking system rules using system-specific, programmer-written compiler extensions. In USENIX Symposium on Operating System Design and Implementation (2000).
8. COLLBERG, C., THOMBORSON, C., AND LOW, D. A taxonomy of obfuscating transformations. Tech. Rep. 148, Department of Computer Science, University of Auckland, July 1997. Available from URL: http://www.cs.auckland.ac.nz/̃collberg/Research/Publications/CollbergTh%omb orsonLow97a/index.html.
9. CREW, R. F. ASTLOG: a language for examining abstract syntax trees. In Proceedings of the USENIX Conference on Domain-Specific Languages (1997), C. Ramming, Ed., pp. 229-242.
10. CUI, B., DONG, Y., DU, X., KUMAR, K. N., RAMAKRISHNAN, C. R., RAMAKRISHNAN, I. V., ROYCHOUDHURY, A., SMOLKA, S. A., AND WARREN, D. S. Logic programming and model checking. In PLILP/ALP (1998), pp. 1-20.
11. DAWSON, S., RAMAKRISHNAN, C. R., AND WARREN, D. S. Practical program analysis using general purpose logic programming systems - a case study. In SIGPLAN Conference on Programming Language Design and Implementation (1996), pp. 117-126.
12. DE MOOR, O., LACEY, D., AND VAN WYK, E. Universal regular path queries. Higher-order and symbolic computation (2002), to appear.
13. DE VOLDER, K. Type-oriented logic meta-programming. PhD dissertation, Vrije Universiteit Brussels, 1998.
14. DOWD, T., HENDERSON, F., AND ROSS, P. Compiling Mercury to the .NET common language runtime. In BABEL '01: First International Workshop on Multi-Language Infrastructure and Interoperability (To appear, 2002), vol. 59 of Electronic Notes in Theoretical Computer Science.
15. ECMA. Standard ECMA-335: Common language infrastructure (CLI). Available from http://www.ecma.ch/ecma1/STAND/ecma-335.htm.
16. FELTY, A. A logic programming approach to implementing higher-order term rewriting. In Proceedings of the January 1991 Workshop on Extensions to Logic Programming (1992), L.-H. Eriksson, L. Hallnäs, and P. Schroeder-Heister, Eds., vol. 596, Springer-Verlag Lecture Notes in Artificial Intelligence, pp. 135-161.
17. GUNNERSON, E. A programmer's introduction to C#. APress, 2001.
18. KICZALES, G., LAMPING, J., MENHDHEKAR, A., MAEDA, C., LOPES, C., LOINGTIER, J.-M., AND IRWIN, J. Aspect-oriented programming. In Proceedings European Conference on Object-Oriented Programming, M. Akşit and S. Matsuoka, Eds., vol. 1241. Springer-Verlag, Berlin, Heidelberg, and New York, 1997, pp. 220-242.
19. LACEY, D., AND DE MOOR, O. Imperative program transformation by rewriting. In Proceedings of the 10th International Conference on Compiler Construction (2001), R. Wilhelm, Ed., vol. 2027 of LNCS, Springer Verlag, pp. 52-68.
20. LIU, Y. A., AND YU, F. Solving regular path queries. In Proceedings of the 6th International Conference on Mathematics of Program Construction (2002), pp. 195-208.
21. MASUHARA, H., KICZALES, G., AND DUTCHYN, C. Compilation semantics of aspect-oriented programs. In Proceedings of the AOSD workshop on Foundations of Aspect-oriented Languages (2002), vol. TR-02-06 of Technical report, Department of Computer Science, Iowa State University, pp. 17-25.
22. MEIJER, E., AND GOUGH, J. A technical overview of the commmon language infrastructure. Available from URL: http://research.microsoft.com/̃emeijer/Papers/CLR.pdf.
23. MELSKI, D., AND REPS, T. Interconvertibility of a class of set constraints and context-free language reachability. Theoretical Computer Science, 248 (2000), 29-98.
24. NADATHUR, G., AND MILLER, D. Higher-order logic programming. In Handbook of logics for artificial intelligence and logic programming, D. M. Gabbay, C. Hogger, and J. A. Robinson, Eds., vol. 5. Clarendon Press, 1998, pp. 499-590.
25. ORGUN, M. A., AND MA, W. An overview of temporal and modal logic programming. In Proceedings of ICTL'94: The 1st International Conference on Temporal Logic (Berlin Heidelberg, 1994), D. M. Gabbay and H. J. Ohlbach, Eds., Springer-Verlag, pp. 445-479.
26. PAIGE, R. Viewing a program transformation system at work. In Proceedings of the Sixth International Symposium on Programming Language Implementation and Logic Programming (1994), M. Hermenegildo and J. Penjam, Eds., Springer Verlag, pp. 5-24.
27. SOMOGYI, Z., HENDERSON, F., AND CONWAY, T. Mercury: an efficient purely declarative logic programming language. In Proceedings of the Australian Computer Science Conference (1995), pp. 499-512.
28. SPIVEY, M. Logic Programming for Programmers. Prentice Hall, 1996.
29. VALLEE-RAI, R., GAGNON, E., HENDREN, L. J., LAM, P., POMINVILLE, P., AND SUNDARESAN, V. Optimizing Java bytecode using the Soot framework: Is it feasible? In Proceedings of the International Conference on Compiler Construction (2000), pp. 18-34.
30. VALLEE-RAI, R., HENDREN, L., SUNDARESAN, V., LAM, P., GAGNON, E., AND CO, P. Soot - a Java optimization framework. In Proceedings of CASCON 1999 (1999), pp. 125-135.
31. VISSER, E. Stratego: A language for program transformation based on rewriting strategies. System description of Stratego 0.5. In Rewriting Techniques and Applications (RTA'01) (May 2001), A. Middeldorp, Ed., no. 2051 in Lecture Notes in Computer Science, Springer-Verlag, pp. 357-362.
32. WHITFIELD, D. L., AND SOFFA, M. L. An approach for exploring code improving transformations. ACM Transactions on Programming Languages and Systems 19, 6 (1997), 1053-1084.