John Field
Research Interests
My research interests include program understanding
and analysis tools, algorithms for program
analysis, logics of programs, term- and graph-rewriting,
program slicing, and compiler optimization, incremental
algorithms.
Coordinates
IBM T. J. Watson Research Center
H1-B24
P.O. Box 704
Yorktown Heights, NY 10598
USA
Publications
Refereed Conferences and Workshops
- J. Field and G. Ramalingam, Identifying Procedural Structure in Cobol
Programs. Invited paper in Proc. Second Annual Workshop on Program Analysis
for Software Tools and Engineering, (Toulouse, France, September 1999), pp. 1-10.
- G. Ramalingam, John Field, and Frank Tip,
Aggregate Structure Identification and its
Application to Program Analysis. In Proc. Twenty-Sixth Annual ACM Symp. on Principles
of Programming Languages, (San Antonio, TX, January 1999) pp. 119-132.
- Frank Tip, Jong-Deok Choi, John Field, and
G. Ramalingam, Slicing Class Hierarchies in C++. In Proc. Eleventh Annual Conf. on Object-Oriented
Programming Systems, Languages, and Applications, (San Jose, CA, October 1996), pp. 179-197.
Appeared in ACM SIGPLAN Notices 31(10).
- Jan Bergstra, John Field, Jan Heering, and
T.B. Dinesh, A Complete Transformational Toolkit for Compilers, In Proc. European Symp. on Programming, (Linköping, Sweden, April 1996).
- John Field, G. Ramalingam, and Frank Tip,
Parametric Program Slicing. In Proc. Twenty-Second ACM Symp. on Principles
of Programming Languages , (San Francisco, CA, January 23-25, 1995),
pp. 379-392.
- John Field and Frank Tip, Dynamic Dependence in Term Rewriting Systems
and its Application to Program Slicing. In Proc. Sixth International Symp. on Programming
Language Implementation and Logic Programming, (Madrid, September 1994). Published
in Lecture Notes in Computer Science 844, M. Hermenegildo and J. Penjam (Eds.),
Springer-Verlag, Heidelberg, 1994, pp. 415-431.
- John Field, Incremental Reduction in Term Rewriting Systems. In Proc. Fifth International Conf. on Rewriting
Techniques and Applications, (Montreal, June 1993). Published in
Lecture Notes in Computer Science 690, Claude Kirchner (Ed.), Springer-Verlag,
Heidelberg, 1994, pp. 259-273.
- John Field, A Simple Rewriting Semantics for Realistic
Imperative Programs and its Application to
Program Analysis. In Proc. ACM Workshop on Partial Evaluation
and Semantics-Based Program Manipulation,
(San Francisco, June 1992). Proceedings
published as Yale University Technical Report
YALEU/DCS/RR-909.
- John Field and Amr Sabry, Reasoning about Implicit and Explicit Representations
of State. In Proc. ACM Workshop on State in Programming
Languages, (Copehnagen, June 1993).
- John Field and Tim Teitelbaum, Incremental Reduction in the Lambda Calculus. In Proc. ACM Conf. on Lisp and Functional Programming,
(Nice, France, June 1990).
- John Field, On Laziness and Optimality in Lambda Interpreters:
Tools for Specification and Analysis. In Proc. Seventeenth Annual ACM Symp. on Principles
of Programming Languages, (San Francisco, January 1990).
Journal Articles
- John Field and Frank Tip, Dynamic Dependence in Term Rewriting Systems
and its Application to Program Slicing, Information and Software Technology 40(11-12), November/December 1998, 609-636.
- John Field, Jan Heering, and T.B. Dinesh,
Equations as a Uniform Framework for Partial
Evaluation and Abstract Interpretation, ACM Computing Surveys 30, 3es (September
1998).
- Jan Bergstra, John Field, Jan Heering, and
T.B. Dinesh, Toward a Complete Transformational Toolkit
for Compilers, ACM Transactions on Program Languages and
Systems 19(5), September 1997.
PhD Thesis
- John Field, Incremental Reduction in the Lambda Calculus
and Related Reduction Systems, Department of Computer Science, Cornell University,
November, 1991.
Technical Reports
- John Field and Frank Tip, Dynamic Dependence in Term Rewriting Systems
and its Application to Program Slicing, IBM Research Report RC 21117, IBM T.J.
Watson Research Center, February 1998.
- G. Ramalingam, John Field, and Frank Tip,
Aggregate Structure Identification and its
Application to Program Analysis, IBM Research Report RC 21246, IBM T.J.
Watson Research Center, July 1997.
- Jan Bergstra, John Field, Jan Heering, and
T.B. Dinesh, Toward a Complete Transformational Toolkit
for Compilers, IBM Research Report RC 20342, IBM T.J.
Watson Research Center, 1996.
- John Field, Incremental Reduction in the Lambda Calculus
and Related Reduction Systems, Department of Computer Science, Cornell University,
November, 1991. (Revised version of
Ph.D. Thesis).
- John Field, On Laziness and Optimality in Lambda Interpreters:
Tools for Specification and Analysis, Cornell University Dept. of Computer Science
Technical Report 90-1091. (Revised
and expanded version of Conference Paper).
- John Field and Tim Teitelbaum, Incremental Reduction in the Lambda Calculus. Cornell University Dept. of Computer
Science Technical Report 90-1130.
Other
- Dexter Kozen, Tim Teitelbaum, Wilfred Chen,
John Field, William Pugh, and Brad Vander
Zanden, ALEX-An Alexical Programming Language. Chapter 7 of Visual Languages and Applications, T. Ichikawa, E. Jungert, and R.R. Korfhage,
eds., Plenum Press, New York, 1990, pp. 147-160.
Last modified: 24 November 1999
John Field, jfield@watson.ibm.com
[ Research home page | IBM home page | Order | Search | Contact IBM | Legal ]
