| 2018 | ISoLA | On Modeling and Programming. | Neil D. Jones |
| 2017 | PEPM | Compiling untyped lambda calculus to lower-level code by game semantics and partial evaluation (invited paper). | Daniil Berezun, Neil D. Jones |
| 2012 | PEPM | Obfuscation by partial evaluation of distorted interpreters. | Roberto Giacobazzi, Neil D. Jones, Isabella Mastroeni |
| 2012 | PEPM | Distillation with labelled transition systems. | Geoffrey William Hamilton, Neil D. Jones |
| 2010 | SAS | Size-Change Termination and Transition Invariants. | Matthias Heizmann, Neil D. Jones, Andreas Podelski |
| 2008 | CiE | Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time. | Amir M. Ben-Amram, Neil D. Jones, Lars Kristiansen |
| 2008 | VMCAI | CTL as an Intermediate Language. | Neil D. Jones, Ren Rydhof Hansen |
| 2007 | APLAS | The Semantics of "Semantic Patches" in Coccinelle: Program Transformation for the Working Programmer. | Neil D. Jones, Ren Rydhof Hansen |
| 2005 | APLAS | Termination Analysis of Higher-Order Functional Programs. | Damien Sereni, Neil D. Jones |
| 2005 | CiE | The Flow of Data and the Complexity of Algorithms. | Lars Kristiansen, Neil D. Jones |
| 2002 | GPCE | Program Generation, Termination, and Binding-Time Analysis. | Neil D. Jones, Arne J. Glenstrup |
| 2002 | ICFP | Program generation, termination, and binding-time analysis. | Neil D. Jones, Arne J. Glenstrup |
| 2002 | POPL | Proving correctness of compiler optimizations by temporal logic. | David Lacey, Neil D. Jones, Eric Van Wyk, Carl Christian Frederiksen |
| 2002 | PPDP | Abstract and conclusions of PLI invited paper: program generation, termination, and binding-time analysis. | Neil D. Jones, Arne J. Glenstrup |
| 2001 | CADE | Program Termination Analysis by Size-Change Graphs (Abstract). | Neil D. Jones |
| 2001 | POPL | The size-change principle for program termination. | Chin Soon Lee, Neil D. Jones, Amir M. Ben-Amram |
| 1998 | PEPM | Partial Evaluation for the Lambda Calculus. | Neil D. Jones, Carsten K. Gomard, Peter Sestoft |
| 1997 | SAS | Combining Abstract Interpretation and Partial Evaluation (Brief Overview). | Neil D. Jones |
| 1995 | PEPM | Special Address: MIX ten years after. | Neil D. Jones |
| 1994 | ESOP | Towards Unifying Partial Evaluation, Deforestation, Supercompilation, and GPC. | Morten Heine Srensen, Robert Glck, Neil D. Jones |
| 1993 | STOC | Constant time factors do matter. | Neil D. Jones |
| 1990 | ICALP | Partial Evaluation, Self-Application and Types. | Neil D. Jones |
| 1987 | MFPS | MIX: A Self-Applicable Partial Evaluator for Experiments in Compiler Generation (Extended Abstract). | Neil D. Jones, Peter Sestoft, Harald Sndergaard |
| 1986 | POPL | Data Flow Analysis of Applicative Programs Using Minimal Function Graphs. | Neil D. Jones, Alan Mycroft |
| 1982 | POPL | A Flexible Approach to Interprocedural Data Flow Analysis and Programs with Recursive Data Structures. | Neil D. Jones, Steven S. Muchnick |
| 1981 | ICALP | Flow Analysis of Lambda Expressions (Preliminary Version). | Neil D. Jones |
| 1980 | CC | Attribute-influenced LR parsing. | Neil D. Jones, C. Michael Madsen |
| 1980 | CC | Compiler generation from denotational semantics. | Neil D. Jones, David A. Schmidt |
| 1980 | FOCS | Complexity of Flow Analysis, Inductive Assertion Synthesis and a Language Due to Dijkstra | Neil D. Jones, Steven S. Muchnick |
| 1979 | POPL | Flow Analysis and Optimization of Lisp-Like Structures. | Neil D. Jones, Steven S. Muchnick |
| 1977 | ICALP | Complexity of Some Problems Concerning L Systems. | Neil D. Jones, Sven Skyum |
| 1976 | POPL | Binding Time Optimization in Programming Languages: Some Thoughts Toward the Design of an Ideal Language. | Neil D. Jones, Steven S. Muchnick |
| 1975 | POPL | Even Simple Programs are Hard to Analyze. | Neil D. Jones, Steven S. Muchnick |
| 1974 | STOC | Complete Problems for Deterministic Polynomial Time | Neil D. Jones, William T. Laaser |
| 1973 | SIGCSE | Discrete structures in the undergraduate computer science curriculum. | Gerald L. Engel, Neil D. Jones |
| 1972 | STOC | Turing Machines and the Spectra of First-Order Formulas with Equality | Neil D. Jones, Alan L. Selman |
| 1971 | FOCS | Priority Paging Algorithms and the Extension Problem | Edward G. Coffman Jr., Neil D. Jones |
| 1967 | FOCS | Classes of Automata and Transitive Closure | Neil D. Jones |