Classes of Automata and Transitive Closure - Neil D. Jones (Inf. Control., 1968)

Context-Free Languages and Rudimentary Attributes. - Neil D. Jones (Math. Syst. Theory, 1969)

A Note on the Index of a Context-Free Language - Neil D. Jones (Inf. Control., 1970)

Priority Paging Algorithms and the Extension Problem - Edward G. Coffman Jr.; Neil D. Jones (SWAT, 1971)

Automata: a teaching aid for mathematical machines. - Lawrence L. Rose; Neil D. Jones; Bruce H. Barnes (ACM SIGCSE Bull., 1971)

Turing Machines and the Spectra of First-Order Formulas with Equality - Neil D. Jones; Alan L. Selman (STOC, 1972)

Discrete structures in the undergraduate computer science curriculum. - Gerald L. Engel; Neil D. Jones (SIGCSE, 1973)

Turing Machines and the Spectra of First-Order Formulas. - Neil D. Jones; Alan L. Selman (J. Symb. Log., 1974)

Space-Bounded Reducibility among Combinatorial Problems. - Neil D. Jones (J. Comput. Syst. Sci., 1975)

Binding Time Optimization in Programming Languages: Some Thoughts Toward the Design of an Ideal Language. - Neil D. Jones; Steven S. Muchnick (POPL, 1976)

New Problems Complete for Nondeterministic Loc Space. - Neil D. Jones; Y. Edmund Lien; William T. Laaser (Math. Syst. Theory, 1976)

Complete Problems for Deterministic Polynomial Time. - Neil D. Jones; William T. Laaser (Theor. Comput. Sci., 1976)

A Note on Linear Time Simulation of Deterministic Two-Way Pushdown Automata. - Neil D. Jones (Inf. Process. Lett., 1977)

Even Simple Programs Are Hard To Analyze. - Neil D. Jones; Steven S. Muchnick (J. ACM, 1977)

Corrigendum: Space-Bounded Reducibility among Combinatorial Problems. - Neil D. Jones (J. Comput. Syst. Sci., 1977)

Complexity of Some Problems in Petri Nets. - Neil D. Jones; Lawrence H. Landweber; Y. Edmund Lien (Theor. Comput. Sci., 1977)

Recognition of Deterministic ETOL Languages in Logarathimic Space - Neil D. Jones; Sven Skyum (Inf. Control., 1977)

TEMPO: A Unified Treatment of Binding Time and Parameter Passing Concepts in Programming Languages - Neil D. Jones; Steven S. Muchnick (Springer, 1978)

Parsers for indexed grammars. - Robert W. Sebesta; Neil D. Jones (Int. J. Parallel Program., 1978)

The Complexity of Finite Memory Programs with Recursion. - Neil D. Jones; Steven S. Muchnick (J. ACM, 1978)

Corrigendum: Context Free Languages and Rudimentary Attributes. - Neil D. Jones (Math. Syst. Theory, 1978)

Flow Analysis and Optimization of Lisp-Like Structures. - Neil D. Jones; Steven S. Muchnick (POPL, 1979)

Complexity of Some Problems Concerning L Systems. - Neil D. Jones; Sven Skyum (Math. Syst. Theory, 1979)

Attribute-influenced LR parsing. - Neil D. Jones; C. Michael Madsen (Semantics-Directed Compiler Generation, 1980)

Compiler generation from denotational semantics. - Neil D. Jones; David A. Schmidt (Semantics-Directed Compiler Generation, 1980)

Complexity of Flow Analysis, Inductive Assertion Synthesis and a Language Due to Dijkstra - Neil D. Jones; Steven S. Muchnick (FOCS, 1980)

Program flow analysis - theory and applications. - Steven S. Muchnick; Neil D. Jones (Prentice Hall, 1981)

Flow Analysis of Lambda Expressions (Preliminary Version). - Neil D. Jones (ICALP, 1981)

A Note on the Complexity of General D0L Membership. - Neil D. Jones; Sven Skyum (SIAM J. Comput., 1981)

Control Flow Treatment in a Simple Semantics-Directed Compiler Generator. - Henning Christiansen 001; Neil D. Jones (Formal Description of Programming Concepts, 1982)

A Fixed-Program Machine for Combinator Expression Evaluation. - Steven S. Muchnick; Neil D. Jones (Symposium on LISP and Functional Programming, 1982)

A Flexible Approach to Interprocedural Data Flow Analysis and Programs with Recursive Data Structures. - Neil D. Jones; Steven S. Muchnick (POPL, 1982)

Stepwise Development of Operational and Denotational Semantics for Prolog. - Neil D. Jones; Alan Mycroft (SLP, 1984)

A method for detecting structure in polyhedra. - Peter Johansen; Neil D. Jones; Jens Clausen (Pattern Recognit. Lett., 1984)

A relational framework for abstract interpretation. - Alan Mycroft; Neil D. Jones (Programs as Data Objects, 1985)

An experiment in partial evaluation: the generation of a compiler generator. - Neil D. Jones; Peter Sestoft; Harald Søndergaard (ACM SIGPLAN Notices, 1985)

Data Flow Analysis of Applicative Programs Using Minimal Function Graphs. - Neil D. Jones; Alan Mycroft (POPL, 1986)

MIX: A Self-Applicable Partial Evaluator for Experiments in Compiler Generation (Extended Abstract). - Neil D. Jones; Peter Sestoft; Harald Søndergaard (MFPS, 1987)

Scientific Foreword. - Neil D. Jones (New Gener. Comput., 1988)

Challenging Problems in Partial Evaluation and Mixed Computation. - Neil D. Jones (New Gener. Comput., 1988)

Experiments with Implementations of Two Theoretical Constructions. - Torben Amtoft Hansen; Thomas Nikolajsen; Jesper Larsson Träff; Neil D. Jones (Logic at Botik, 1989)

Mix: A Self-Applicable Partial Evaluator for Experiments in Compiler Generation. - Neil D. Jones; Peter Sestoft; Harald Søndergaard (LISP Symb. Comput., 1989)

Partial Evaluation, Self-Application and Types. - Neil D. Jones (ICALP, 1990)

A Self-Applicable Partial Evaluator for the Lambda Calculus. - Neil D. Jones; Carsten K. Gomard; Anders Bondorf; Olivier Danvy; Torben Æ. Mogensen (ICCL, 1990)

Efficient Algebraic Operations on Programs. - Neil D. Jones (AMAST, 1991)

A Partial Evaluator for the Untyped lambda-Calculus. - Carsten K. Gomard; Neil D. Jones (J. Funct. Program., 1991)

Foreword (Selected Papers of ESOP '90). - Neil D. Jones (Sci. Comput. Program., 1991)

Compiler Generation by Partial Evaluation: A Case Study. - Carsten K. Gomard; Neil D. Jones (Struct. Program., 1991)

Static Semantics, Types, and Binding Time Analysis. - Neil D. Jones (Theor. Comput. Sci., 1991)

Partial evaluation and automatic program generation. - Neil D. Jones; Carsten K. Gomard; Peter Sestoft (Prentice Hall, 1993)

Constant time factors do matter. - Neil D. Jones (STOC, 1993)

Higher-Order Minimal Functional Graphs. - Neil D. Jones; Mads Rosendahl (ALP, 1994)

Generalizing Cook's Transformation to Imperative Stack Programs. - Nils Andersen; Neil D. Jones (Results and Trends in Theoretical Computer Science, 1994)

The Essence of Program Transformation by Partial Evaluation and Driving. - Neil D. Jones (Logic, Language and Computation, 1994)

Towards Unifying Partial Evaluation, Deforestation, Supercompilation, and GPC. - Morten Heine Sørensen; Robert Glück; Neil D. Jones (ESOP, 1994)

Program Speedups in Theory and Practice. - Neil D. Jones (IFIP Congress (1), 1994)

Abstract Interpretation and Partial Evaluation in Functional and Logic Programming. - Neil D. Jones (ILPS, 1994)

Denotational Abstract Interpretation of Logic Programs. - Kim Marriott; Harald Søndergaard; Neil D. Jones (ACM Trans. Program. Lang. Syst., 1994)

Special Address: MIX ten years after. - Neil D. Jones (PEPM, 1995)

Complexity and computability from a programming language perspective. - Neil D. Jones (MFPS, 1995)

What Not to Do When Writing an Interpreter for Specialisation. - Neil D. Jones (Dagstuhl Seminar on Partial Evaluation, 1996)

BTA Algorithms to Ensure Termination of Off-Line Partial Evaluation. - Arne J. Glenstrup; Neil D. Jones (Ershov Memorial Conference, 1996)

An Introduction to Partial Evaluation. - Neil D. Jones (ACM Comput. Surv., 1996)

A Positive Supercompiler. - Morten Heine Sørensen; Robert Glück; Neil D. Jones (J. Funct. Program., 1996)

Computability and complexity - from a programming perspective. - Neil D. Jones (MIT Press, 1997)

Combining Abstract Interpretation and Partial Evaluation (Brief Overview). - Neil D. Jones (SAS, 1997)

Higher-Order Minimal Function Graphs. - Neil D. Jones; Mads Rosendahl (J. Funct. Log. Program., 1997)

Partial Evaluation for the Lambda Calculus. - Neil D. Jones; Carsten K. Gomard; Peter Sestoft (Partial Evaluation, 1998)

A Precise Version of a Time Hierarchy Theorem. - Amir M. Ben-Amram; Neil D. Jones (Fundam. Informaticae, 1999)

EAPLS: the European Association for Programming Languages and Systems. - Neil D. Jones (ACM SIGPLAN Notices, 1999)

LOGSPACE and PTIME Characterized by Programming Languages. - Neil D. Jones (Theor. Comput. Sci., 1999)

Computational complexity via programming languages: constant factors do matter. - Amir M. Ben-Amram; Neil D. Jones (Acta Informatica, 2000)

Program Termination Analysis by Size-Change Graphs (Abstract). - Neil D. Jones (IJCAR, 2001)

Program Analysis for Implicit Computational Complexity. - Neil D. Jones (PADO, 2001)

The size-change principle for program termination. - Chin Soon Lee; Neil D. Jones; Amir M. Ben-Amram (POPL, 2001)

The expressive power of higher-order types or, life without CONS. - Neil D. Jones (J. Funct. Program., 2001)

Program Generation, Termination, and Binding-Time Analysis. - Neil D. Jones; Arne J. Glenstrup (GPCE, 2002)

Proving correctness of compiler optimizations by temporal logic. - David Lacey; Neil D. Jones; Eric Van Wyk; Carl Christian Frederiksen (POPL, 2002)

Abstract and conclusions of PLI invited paper: program generation, termination, and binding-time analysis. - Neil D. Jones; Arne J. Glenstrup (PPDP, 2002)

Termination Analysis of the Untyped lamba-Calculus. - Neil D. Jones; Nina Bohr (RTA, 2004)

Compiler Optimization Correctness by Temporal Logic. - David Lacey; Neil D. Jones; Eric Van Wyk; Carl Christian Frederiksen (High. Order Symb. Comput., 2004)

Transformation by interpreter specialisation. - Neil D. Jones (Sci. Comput. Program., 2004)

Termination Analysis of Higher-Order Functional Programs. - Damien Sereni; Neil D. Jones (APLAS, 2005)

The Flow of Data and the Complexity of Algorithms. - Lars Kristiansen; Neil D. Jones (CiE, 2005)

Termination analysis and specialization-point insertion in offline partial evaluation. - Arne J. Glenstrup; Neil D. Jones (ACM Trans. Program. Lang. Syst., 2005)

Redundant Call Elimination via Tupling. - Wei-Ngan Chin; Siau-Cheng Khoo; Neil D. Jones (Fundam. Informaticae, 2006)

Guest Editor's Foreword. - Neil D. Jones (Nord. J. Comput., 2006)

The Semantics of "Semantic Patches" in Coccinelle: Program Transformation for the Working Programmer. - Neil D. Jones; René Rydhof Hansen (APLAS, 2007)

Flow analysis of lazy higher-order functional programs. - Neil D. Jones; Nils Andersen (Theor. Comput. Sci., 2007)

Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time. - Amir M. Ben-Amram; Neil D. Jones; Lars Kristiansen (CiE, 2008)

CTL as an Intermediate Language. - Neil D. Jones; René Rydhof Hansen (VMCAI, 2008)

Call-by-Value Termination in the Untyped lambda-Calculus. - Neil D. Jones; Nina Bohr (Log. Methods Comput. Sci., 2008)

A flow calculus of mwp-bounds for complexity analysis. - Neil D. Jones; Lars Kristiansen (ACM Trans. Comput. Log., 2009)

Size-Change Termination and Transition Invariants. - Matthias Heizmann; Neil D. Jones; Andreas Podelski (SAS, 2010)

Programming in Biomolecular Computation. - Lars Hartmann; Neil D. Jones; Jakob Grue Simonsen (CS2Bio, 2010)

Computational Biology: A Programming Perspective. - Lars Hartmann; Neil D. Jones; Jakob Grue Simonsen; Søren Bjerregaard Vrist (Formal Modeling: Actors, Open Systems, Biological Systems, 2011)

Proving the Correctness of Unfold/Fold Program Transformations Using Bisimulation. - Geoff W. Hamilton; Neil D. Jones (Ershov Memorial Conference, 2011)

Programming in Biomolecular Computation: Programs, Self-Interpretation and Visualisation. - Lars Hartmann; Neil D. Jones; Jakob Grue Simonsen; Søren Bjerregaard Vrist (Sci. Ann. Comput. Sci., 2011)

Preface to a special section on verification, model checking, and abstract interpretation. - Neil D. Jones; Markus Müller-Olm (Int. J. Softw. Tools Technol. Transf., 2011)

Obfuscation by partial evaluation of distorted interpreters. - Roberto Giacobazzi; Neil D. Jones; Isabella Mastroeni (PEPM, 2012)

Distillation with labelled transition systems. - Geoffrey William Hamilton; Neil D. Jones (PEPM, 2012)

Fifty years of the spectrum problem: survey and new results. - Arnaud Durand 001; Neil D. Jones; Johann A. Makowsky; Malika More (Bull. Symb. Log., 2012)

A Swiss Pocket Knife for Computability. - Neil D. Jones (Festschrift for Dave Schmidt, 2013)

Asymptotic Speedups, Bisimulation and Distillation (Work in Progress). - Neil D. Jones; Geoff W. Hamilton (Ershov Memorial Conference, 2014)

Compiling untyped lambda calculus to lower-level code by game semantics and partial evaluation (invited paper). - Daniil Berezun; Neil D. Jones (PEPM, 2017)

On Modeling and Programming. - Neil D. Jones (ISoLA (1), 2018)

Cons-free Programs and Complexity Classes between LOGSPACE and PTIME. - Neil D. Jones; Siddharth Bhaskar; Cynthia Kop; Jakob Grue Simonsen (VPT/HCVS@ETAPS, 2020)