default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn Field
Person information
- affiliation: Google Research
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[p1]John Field:
Lifelong Learning for Working People. Encyclopedia of Education and Information Technologies 2020: 1-11
2010 – 2019
- 2014
- [c28]Phillip Kuang, John Field, Carlos A. Varela:
Fault Tolerant Distributed Computing Using Asynchronous Local Checkpointing. AGERE!@SPLASH 2014: 81-93 - 2013
- [j9]Derek Dreyer, John Field, Roberto Giacobazzi, Michael Hicks, Suresh Jagannathan, Mooly Sagiv, Peter Sewell
, Philip Wadler:
Principles of POPL. ACM SIGPLAN Notices 48(4S): 12-16 (2013) - 2012
- [j8]John Field, Vasco Thudichum Vasconcelos:
Selected Papers from the Eleventh International Conference on Coordination Models and Languages. Sci. Comput. Program. 77(6): 661-662 (2012) - [c27]Raghavan Komondoor, V. Krishna Nandivada, Saurabh Sinha, John Field:
Identifying services from legacy batch applications. ISEC 2012: 13-22 - [c26]Omer Tripp, Roman Manevich, John Field, Mooly Sagiv:
JANUS: exploiting parallelism via hindsight. PLDI 2012: 145-156 - [e3]John Field, Michael Hicks:
Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2012, Philadelphia, Pennsylvania, USA, January 22-28, 2012. ACM 2012, ISBN 978-1-4503-1083-3 [contents] - 2011
- [c25]Omer Tripp, Greta Yorsh, John Field, Mooly Sagiv:
HAWKEYE: effective discovery of dataflow impediments to parallelization. OOPSLA 2011: 207-224
2000 – 2009
- 2009
- [j7]John Field, Maria-Cristina V. Marinescu, Christian Stefansen:
Reactors: A data-oriented synchronous/asynchronous programming model for distributed applications. Theor. Comput. Sci. 410(2-3): 168-201 (2009) - [c24]Tobias Wrigstad, Patrick Eugster, John Field, Nate Nystrom, Jan Vitek:
Software hardening: a research agenda. STOP@ECOOP 2009: 58-70 - [c23]Bard Bloom, John Field, Nathaniel Nystrom, Johan Östlund, Gregor Richards, Rok Strnisa, Jan Vitek, Tobias Wrigstad:
Thorn: robust, concurrent, extensible scripting on the JVM. OOPSLA 2009: 117-136 - [c22]Bard Bloom, John Field, Nathaniel Nystrom, Johan Östlund, Gregor Richards, Rok Strnisa, Jan Vitek, Tobias Wrigstad:
Thorn: robust concurrent scripting on the JVM. OOPSLA Companion 2009: 789-790 - [e2]John Field, Vasco Thudichum Vasconcelos:
Coordination Models and Languages, 11th International Conference, COORDINATION 2009, Lisboa, Portugal, June 9-12, 2009. Proceedings. Lecture Notes in Computer Science 5521, Springer 2009, ISBN 978-3-642-02052-0 [contents] - 2007
- [c21]John Field, Maria-Cristina V. Marinescu, Christian Stefansen:
Reactors: A Data-Oriented Synchronous/Asynchronous Programming Model for Distributed Applications. COORDINATION 2007: 76-95 - 2006
- [j6]Satish Chandra, Jackie De Vries, John Field, Howard M. Hess, Manivannan Kalidasan, Raghavan Komondoor, Frans Nieuwerth, Ganesan Ramalingam, Justin Xue:
Technical forum: Using logical data models for understanding and transforming legacy business applications. IBM Syst. J. 45(3): 647-655 (2006) - [c20]Roman Manevich, John Field, Thomas A. Henzinger, G. Ramalingam, Mooly Sagiv:
Abstract Counterexample-Based Refinement for Powerset Domains. Program Analysis and Compilation 2006: 273-292 - [c19]Ganesan Ramalingam, Raghavan Komondoor, John Field, Saurabh Sinha:
Semantics-based reverse engineering of object-oriented data models. ICSE 2006: 192-201 - 2005
- [j5]John Field, Deepak Goyal, Ganesan Ramalingam, Eran Yahav:
Typestate verification: Abstraction techniques and complexity results. Sci. Comput. Program. 58(1-2): 57-82 (2005) - [c18]John Field, Carlos A. Varela:
Transactors: a programming model for maintaining globally consistent distributed state in unreliable environments. POPL 2005: 195-208 - [c17]Raghavan Komondoor, Ganesan Ramalingam, Satish Chandra, John Field:
Dependent Types for Program Understanding. TACAS 2005: 157-173 - [c16]Nurit Dor, John Field, Denis Gopan, Tal Lev-Ami, Alexey Loginov, Roman Manevich, G. Ramalingam, Thomas W. Reps, Noam Rinetzky, Mooly Sagiv, Reinhard Wilhelm, Eran Yahav, Greta Yorsh:
Automatic Verification of Strongly Dynamic Software Systems. VSTTE 2005: 82-92 - 2004
- [c15]Roman Manevich, Shmuel Sagiv, Ganesan Ramalingam, John Field:
Partially Disjunctive Heap Abstraction. SAS 2004: 265-279 - 2003
- [c14]John Field, Deepak Goyal, G. Ramalingam, Eran Yahav:
Typestate Verification: Abstraction Techniques and Complexity Results. SAS 2003: 439-462 - 2002
- [c13]G. Ramalingam, Alex Varshavsky, John Field, Deepak Goyal, Shmuel Sagiv:
Deriving Specialized Program Analyses for Certifying Component-Client Conformance. PLDI 2002: 83-94 - [c12]Roman Manevich, G. Ramalingam, John Field, Deepak Goyal, Shmuel Sagiv:
Compactly Representing First-Order Structures for Static Analysis. SAS 2002: 196-212 - [c11]John Field, Carlos A. Varela:
Towards a Programming Model for Building Reliable Systems with Distributed State. FOCLASA 2002: 328-346 - 2001
- [e1]John Field, Gregor Snelting:
Proceedings of the 2001 ACM SIGPLAN-SIGSOFT Workshop on Program Analysis For Software Tools and Engineering, PASTE'01, Snowbird, Utah, USA, June 18-19, 2001. ACM 2001, ISBN 1-58113-413-4 [contents]
1990 – 1999
- 1999
- [j4]John Field, G. Ramalingam:
Identifying procedural structure in Cobol programs. ACM SIGSOFT Softw. Eng. Notes 24(5): 1-10 (1999) - [c10]John Field, G. Ramalingam:
Identifying Procedural Structure in Cobol Programs. PASTE 1999: 1-10 - [c9]G. Ramalingam, John Field, Frank Tip:
Aggregate Structure Identification and Its Application to Program Analysis. POPL 1999: 119-132 - 1998
- [j3]John Field, Jan Heering, T. B. Dinesh:
Equations as a Uniform Framework for Partial Evaluation and Abstract Interpretation. ACM Comput. Surv. 30(3es): 2 (1998) - [j2]John Field, Frank Tip:
Dynamic dependence in term rewriting systems and its application to program slicing. Inf. Softw. Technol. 40(11-12): 609-636 (1998) - 1997
- [j1]Jan A. Bergstra, T. B. Dinesh, John Field, Jan Heering:
Toward a Complete Transformational Toolkit for Compilers. ACM Trans. Program. Lang. Syst. 19(5): 639-684 (1997) - 1996
- [c8]Jan A. Bergstra, T. B. Dinesh, John Field, Jan Heering:
A Complete Transformational Toolkit for Compilers. ESOP 1996: 92-107 - [c7]Frank Tip, Jong-Deok Choi, John Field, G. Ramalingam:
Slicing Class Hierarchies in C++. OOPSLA 1996: 179-197 - 1995
- [c6]John Field, G. Ramalingam, Frank Tip:
Parametric Program Slicing. POPL 1995: 379-392 - 1994
- [c5]John Field, Frank Tip:
Dynamic Dependence in Term rewriting Systems and its Application to Program Slicing. PLILP 1994: 415-431 - 1993
- [c4]John Field:
A Graph Reduction Approach to Incremental Term Rewriting (Preliminary Report). RTA 1993: 259-273 - 1992
- [c3]John Field:
A Simple Rewriting Semantics for Realistic Imperative Programs and its Application to Program Analysis. PEPM 1992: 98-107 - 1991
- [b1]John Field:
Incremental Reduction and Semantics. Cornell University, USA, 1991 - 1990
- [c2]John Field, Tim Teitelbaum:
Incremental Reduction in the lambda Calculus. LISP and Functional Programming 1990: 307-322 - [c1]John Field:
On Laziness and Optimality in Lambda Interpreters: Tools for Specification and Analysis. POPL 1990: 1-15
Coauthor Index
aka: Ganesan Ramalingam
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
