참고문헌
- Thomas Ball and James R. Lams. Optimally profiling and tracing program. ACM Transactions on Programming Languages and Systems, 16(4):1319-1360, July 1994 https://doi.org/10.1145/183432.183527
- Thomas Ball, Peter Mataga, and Mooly Sagiv. Edge profiling versus path profiling: the showdown. In Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, January 1998 https://doi.org/10.1145/268946.268958
- Robin Milner, Mads Tofte, Robert Harper, and David MacQueen. The Definition of Standard ML (Revised). MIT Press, 1997
- Martin S. Feather. A survery and classification of some program transformation approaches and techniques. In L.G.L.T. Meertens, editor, Program Specification and Transformation, pages 165-195. Elsevier Science Publishers, 1987
- Cormac Flanagan and Matthias Felleisen. Componential set-based analysis. In Proceedings of the SIGPLAN conference on Programming Language Design and Implementation, 1997 https://doi.org/10.1145/258915.258937
- Nevin Heintze. Set Based Program Analysis. PhD thesis, Carnegie Mellon University, October 1992
- Nevin Heintze. Set based analysis of ML Programs. Technical Report CMU-CS-93-193, Carnegie Mellon University, July 1993
- Nevin Heintze and David McAllesterLinear-time subtransitive control flow analysis. In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation, pages 261-272, June 1997 https://doi.org/10.1145/258915.258939
- Alex Aiken and Nevin Heintze. Constraint-based program analysis. Tutorial Notes of the ACM Symposium on Principles of Programming Languages, January 1995
- Frank Tip. A survey of program slicing techniques. Technical Report CS-R9438, Centrum voor Wiskunde en Informatica, 1994
- Witold Charatonik and Andreas Podelski. Co-definite set constraints. In Lecture Notes in Computer Science, volume 1379, pages 211-225. Springer-Verlag, Proceedings of the 9th International Conference on Rewriting Techniques and Applications - RTA'98 edition, 1998 https://doi.org/10.1007/BFb0052372
- Hubert Comon, Max Dauchet, Remi Gilleron, Florent Jacquemard, Denis Lugiez, Sophie Tison, and Marc Tommasi. Tree automata techniques and applications, April 1999
- Patrik Cousot and Radhia Causat. Compositional and indective semantic definitions in fixpoint, equational, constraint, closure-condition, rule-based and game-theoretic form. In Lecture Notes in Computer Science, volume 939, pages 293-308. Springer-Veriag, proceedings of the 7th international conference on computer'-aided verification edition, 1995 https://doi.org/10.1007/3-540-60045-0_58
- Steven McCanne and Van Jacobson. The BSD packet filter: A new architecture for user-level packet capture. In Proceedings of the Winter 1993 USENIX Conference, pages 259-269. USENIX Association, January 1993
- Shamik Sharma, Anurag Acharya, and Joel Saltz. Deferred data-flow analysis. Technical Report TRCS98-38, University of California, Santa Barbara, December 1998
- Sungdo Moon, Mary W. Hall, and Brian R. Murphy. Predicated array data-flow analysis for run-time parallelization. In Proceedings of the ACM International Conference on Supercomputing, July 1998 https://doi.org/10.1145/277830.277874
- Glenn Ammons and James Larus. Improving data-flow analysis with path profiles. In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation, June 1998 https://doi.org/10.1145/277650.277665
- Charles Consel and Francois Noel. A general approach for run-time specialization and its application to C. In Proceedings of The ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, January 1996 https://doi.org/10.1145/237721.237767
- Mark Leone and Peter Lee. Optimizing ML with run-time speicialzation. Technical Heport CMU-CS-95-205, Carnegie Mellon University, December 1995
- Jeol Auslander, matthai philipose, Craig Chambers, Susan J. Eggers, and Brian N. Bershad. Fast, effective dynamic compilation. In Proceedings of SIGPLAN conference on Programming Language Design Implementation, June 1998 https://doi.org/10.1145/231379.231409
- Brian Grant, Markus Mock, Matthai Philipose, Craig Chambers, and Susan J. Eggers. Annotation-directed run-time specialization in C. In Proceedings of The ACM Symposium on Partial Evaluation and Program Manipulations https://doi.org/10.1145/258993.259016
- Charles Consel and Olivier Danvy. Tutorial notes on partial evaluation. In the Twentieth ACM Symposium on Principles of Programming Languages, January 1993 https://doi.org/10.1145/158511.158707
- You-Chin Fuh and Pratect Mishra. Type inference with subtypes. Theoretical Computer Science, 73:155-175, 1990 https://doi.org/10.1016/0304-3975(90)90144-7
- Tim Freeman and Frank Pfenning. Refinement types for ML. In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation, pages 268-277, 1991 https://doi.org/10.1145/113445.113468
- Mario Coppo, Ferruccio Damiani, and Paola Giannini. Refinement types for program analysis. In Lecture Notes in Computer Science, volume 1145. Springer-Verlag, 1996 https://doi.org/10.1007/3-540-61739-6_39
- Thomas Reps and Todd Turnidge. Program specialization via program slicing. In Lecture Notes in Computer Science, volume 1110, pages 409-429. Springer-Verlag, 1996 https://doi.org/10.1007/3-540-61580-6_20
- Yanhong A. Liu. Dependence analysis for recursive data. In Proceedings of the IEEE International Conference on Computer Language, pages 206-215, May 1998
- Francois Bourdoncle. Abstract debugging of higher-order imperative Languages. In Proceedings of the SIGPLAN conference on Programming Language Design and Implementation, 1993 https://doi.org/10.1145/155090.155095
- Sandip K. Biswas. A demand-driven set-based analysis. In Proceedings of The ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 372-385, 1997 https://doi.org/10.1145/263699.263753