Travelled to:1 × Canada
1 × Germany
1 × Italy
1 × Sweden
1 × United Kingdom
2 × China
2 × France
2 × Spain
9 × USA
Collaborated with:G.Ramalingam ∅ F.Tip G.Ramalingam R.Manevich S.Sagiv D.Goyal O.Tripp M.Sagiv R.Komondoor C.A.Varela T.Teitelbaum G.Yorsh S.Sinha S.Chandra E.Yahav J.A.Bergstra T.B.Dinesh J.Heering J.Choi A.Varshavsky B.Bloom N.Nystrom J.Östlund G.Richards R.Strnisa J.Vitek T.Wrigstad
Talks about:program (9) analysi (4) structur (3) rewrit (3) applic (3) slice (3) increment (2) parallel (2) abstract (2) semant (2)
Person: John Field
DBLP: Field:John
Facilitated 2 volumes:
Ed
EdContributed to:
2012
20112009
20062005
2005
200420032002200219991999
199619961995
1994
1993
1992
19901990Wrote 20 papers:
- PLDI-2012-TrippMFS #named #parallel
- JANUS: exploiting parallelism via hindsight (OT, RM, JF, MS), pp. 145–156.
- OOPSLA-2011-TrippYFS #data flow #effectiveness #named #parallel
- HAWKEYE: effective discovery of dataflow impediments to parallelization (OT, GY, JF, MS), pp. 207–224.
- OOPSLA-2009-BloomFNORSVW #concurrent #named #robust #virtual machine
- Thorn: robust, concurrent, extensible scripting on the JVM (BB, JF, NN, JÖ, GR, RS, JV, TW), pp. 117–136.
- ICSE-2006-RamalingamKFS #modelling #object-oriented #reverse engineering #semantics
- Semantics-based reverse engineering of object-oriented data models (GR, RK, JF, SS), pp. 192–201.
- POPL-2005-FieldV #consistency #distributed #maintenance #named #programming
- Transactors: a programming model for maintaining globally consistent distributed state in unreliable environments (JF, CAV), pp. 195–208.
- TACAS-2005-KomondoorRCF #comprehension #dependent type
- Dependent Types for Program Understanding (RK, GR, SC, JF), pp. 157–173.
- SAS-2004-ManevichSRF #abstraction
- Partially Disjunctive Heap Abstraction (RM, SS, GR, JF), pp. 265–279.
- SAS-2003-FieldGRY #abstraction #complexity #type system #verification
- Typestate Verification: Abstraction Techniques and Complexity Results (JF, DG, GR, EY), pp. 439–462.
- PLDI-2002-RamalingamWFGS #analysis #component #consistency
- Deriving Specialized Program Analyses for Certifying Component-Client Conformance (GR, AV, JF, DG, SS), pp. 83–94.
- SAS-2002-ManevichRFGS #first-order #representation #static analysis
- Compactly Representing First-Order Structures for Static Analysis (RM, GR, JF, DG, SS), pp. 196–212.
- PASTE-1999-FieldR #cobol #identification #source code
- Identifying Procedural Structure in Cobol Programs (JF, GR), pp. 1–10.
- POPL-1999-RamalingamFT #identification #program analysis
- Aggregate Structure Identification and Its Application to Program Analysis (GR, JF, FT), pp. 119–132.
- ESOP-1996-BergstraDFH #compilation #tool support
- A Complete Transformational Toolkit for Compilers (JAB, TBD, JF, JH), pp. 92–107.
- OOPSLA-1996-TipCFR #c++ #slicing
- Slicing Class Hierarchies in C++ (FT, JDC, JF, GR), pp. 179–197.
- POPL-1995-FieldRT #parametricity #slicing
- Parametric Program Slicing (JF, GR, FT), pp. 379–392.
- PLILP-1994-FieldT #dependence #slicing #term rewriting
- Dynamic Dependence in Term rewriting Systems and its Application to Program Slicing (JF, FT), pp. 415–431.
- RTA-1993-Field #approach #graph #incremental #reduction #term rewriting
- A Graph Reduction Approach to Incremental Term Rewriting (JF), pp. 259–273.
- PEPM-1992-Field #imperative #program analysis #semantics #source code
- A Simple Rewriting Semantics for Realistic Imperative Programs and its Application to Program Analysis (JF), pp. 98–107.
- LFP-1990-FieldT #incremental #reduction #λ-calculus
- Incremental Reduction in the λ Calculus (JF, TT), pp. 307–322.
- POPL-1990-Field #analysis #lazy evaluation #on the #specification #tool support
- On Laziness and Optimality in λ Interpreters: Tools for Specification and Analysis (JF), pp. 1–15.