Neil D. Jones

According to our database, Neil D. Jones authored at least 107 papers between 1968 and 2020.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2020

Cons-free Programs and Complexity Classes between LOGSPACE and PTIME.

Neil D. Jones, Siddharth Bhaskar, Cynthia Kop, Jakob Grue Simonsen

Proceedings of the Proceedings 8th International Workshop on Verification and Program Transformation and 7th Workshop on Horn Clauses for Verification and Synthesis, 2020

2018

On Modeling and Programming.

Neil D. Jones

Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Modeling, 2018

2017

Compiling untyped lambda calculus to lower-level code by game semantics and partial evaluation (invited paper).

Daniil Berezun, Neil D. Jones

Proceedings of the 2017 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, 2017

2014

Asymptotic Speedups, Bisimulation and Distillation (Work in Progress).

Neil D. Jones, Geoff W. Hamilton

Proceedings of the Perspectives of System Informatics, 2014

2013

A Swiss Pocket Knife for Computability.

Neil D. Jones

Proceedings of the Semantics, 2013

2012

Fifty years of the spectrum problem: survey and new results.

Arnaud Durand, Neil D. Jones, Johann A. Makowsky, Malika More

Bull. Symb. Log., 2012

Distillation with labelled transition systems.

Geoffrey William Hamilton, Neil D. Jones

Proceedings of the ACM SIGPLAN 2012 Workshop on Partial Evaluation and Program Manipulation, 2012

Obfuscation by partial evaluation of distorted interpreters.

Roberto Giacobazzi, Neil D. Jones, Isabella Mastroeni

Proceedings of the ACM SIGPLAN 2012 Workshop on Partial Evaluation and Program Manipulation, 2012

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

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

Proving the Correctness of Unfold/Fold Program Transformations Using Bisimulation.

Geoff W. Hamilton, Neil D. Jones

Proceedings of the Perspectives of Systems Informatics, 2011

Computational Biology: A Programming Perspective.

Lars Hartmann, Neil D. Jones, Jakob Grue Simonsen, Søren Bjerregaard Vrist

Proceedings of the Formal Modeling: Actors, Open Systems, Biological Systems, 2011

2010

Programming in Biomolecular Computation.

Lars Hartmann, Neil D. Jones, Jakob Grue Simonsen

Proceedings of the 1st International Workshop on Interactions between Computer Science and Biology, 2010

Size-Change Termination and Transition Invariants.

Matthias Heizmann, Neil D. Jones, Andreas Podelski

Proceedings of the Static Analysis - 17th International Symposium, 2010

2009

A flow calculus of <i>mwp</i>-bounds for complexity analysis.

Neil D. Jones, Lars Kristiansen

ACM Trans. Comput. Log., 2009

2008

Call-by-Value Termination in the Untyped lambda-Calculus.

Neil D. Jones, Nina Bohr

Log. Methods Comput. Sci., 2008

CTL as an Intermediate Language.

Neil D. Jones, René Rydhof Hansen

Proceedings of the Verification, 2008

Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time.

Amir M. Ben-Amram, Neil D. Jones, Lars Kristiansen

Proceedings of the Logic and Theory of Algorithms, 2008

2007

Flow analysis of lazy higher-order functional programs.

Neil D. Jones, Nils Andersen

Theor. Comput. Sci., 2007

The Semantics of "Semantic Patches" in Coccinelle: Program Transformation for the Working Programmer.

Neil D. Jones, René Rydhof Hansen

Proceedings of the Programming Languages and Systems, 5th Asian Symposium, 2007

2006

Guest Editor's Foreword.

Neil D. Jones

Nord. J. Comput., 2006

Redundant Call Elimination via Tupling.

Wei-Ngan Chin, Siau-Cheng Khoo, Neil D. Jones

Fundam. Informaticae, 2006

2005

Termination analysis and specialization-point insertion in offline partial evaluation.

Arne J. Glenstrup, Neil D. Jones

ACM Trans. Program. Lang. Syst., 2005

The Flow of Data and the Complexity of Algorithms.

Lars Kristiansen, Neil D. Jones

Proceedings of the New Computational Paradigms, 2005

Termination Analysis of Higher-Order Functional Programs.

Damien Sereni, Neil D. Jones

Proceedings of the Programming Languages and Systems, Third Asian Symposium, 2005

2004

Transformation by interpreter specialisation.

Neil D. Jones

Sci. Comput. Program., 2004

Compiler Optimization Correctness by Temporal Logic.

David Lacey, Neil D. Jones, Eric Van Wyk, Carl Christian Frederiksen

High. Order Symb. Comput., 2004

Termination Analysis of the Untyped lamba-Calculus.

Neil D. Jones, Nina Bohr

Proceedings of the Rewriting Techniques and Applications, 15th International Conference, 2004

2002

Abstract and conclusions of PLI invited paper: program generation, termination, and binding-time analysis.

Neil D. Jones, Arne J. Glenstrup

Proceedings of the 4th international ACM SIGPLAN conference on Principles and practice of declarative programming, 2002

Proving correctness of compiler optimizations by temporal logic.

David Lacey, Neil D. Jones, Eric Van Wyk, Carl Christian Frederiksen

Proceedings of the Conference Record of POPL 2002: The 29th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2002

Program Generation, Termination, and Binding-Time Analysis.

Neil D. Jones, Arne J. Glenstrup

Proceedings of the Generative Programming and Component Engineering, 2002

2001

The expressive power of higher-order types or, life without CONS.

Neil D. Jones

J. Funct. Program., 2001

The size-change principle for program termination.

Chin Soon Lee, Neil D. Jones, Amir M. Ben-Amram

Proceedings of the Conference Record of POPL 2001: The 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2001

Program Analysis for Implicit Computational Complexity.

Neil D. Jones

Proceedings of the Programs as Data Objects, Second Symposium, 2001

Program Termination Analysis by Size-Change Graphs (Abstract).

Neil D. Jones

Proceedings of the Automated Reasoning, First International Joint Conference, 2001

2000

Computational complexity via programming languages: constant factors do matter.

Amir M. Ben-Amram, Neil D. Jones

Acta Informatica, 2000

1999

LOGSPACE and PTIME Characterized by Programming Languages.

Neil D. Jones

Theor. Comput. Sci., 1999

EAPLS: the European Association for Programming Languages and Systems.

Neil D. Jones

ACM SIGPLAN Notices, 1999

A Precise Version of a Time Hierarchy Theorem.

Amir M. Ben-Amram, Neil D. Jones

Fundam. Informaticae, 1999

1998

Partial Evaluation for the Lambda Calculus.

Neil D. Jones, Carsten K. Gomard, Peter Sestoft

Proceedings of the Partial Evaluation - Practice and Theory, DIKU 1998 International Summer School, Copenhagen, Denmark, June 29, 1998

1997

Higher-Order Minimal Function Graphs.

Neil D. Jones, Mads Rosendahl

J. Funct. Log. Program., 1997

Combining Abstract Interpretation and Partial Evaluation (Brief Overview).

Neil D. Jones

Proceedings of the Static Analysis, 4th International Symposium, 1997

Computability and complexity - from a programming perspective.

Neil D. Jones

Foundations of computing series, MIT Press, ISBN: 978-0-262-10064-9, 1997

1996

A Positive Supercompiler.

Morten Heine Sørensen, Robert Glück, Neil D. Jones

J. Funct. Program., 1996

An Introduction to Partial Evaluation.

Neil D. Jones

ACM Comput. Surv., 1996

BTA Algorithms to Ensure Termination of Off-Line Partial Evaluation.

Arne J. Glenstrup, Neil D. Jones

Proceedings of the Perspectives of System Informatics, 1996

What Not to Do When Writing an Interpreter for Specialisation.

Neil D. Jones

Proceedings of the Partial Evaluation, International Seminar, 1996

1995

Complexity and computability from a programming language perspective.

Neil D. Jones

Proceedings of the Eleventh Annual Conference on Mathematical Foundations of Programming Semantics, 1995

Special Address: MIX ten years after.

Neil D. Jones

Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, 1995

1994

Denotational Abstract Interpretation of Logic Programs.

Kim Marriott, Harald Søndergaard, Neil D. Jones

ACM Trans. Program. Lang. Syst., 1994

Abstract Interpretation and Partial Evaluation in Functional and Logic Programming.

Neil D. Jones

Proceedings of the Logic Programming, 1994

Program Speedups in Theory and Practice.

Neil D. Jones

Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994

Towards Unifying Partial Evaluation, Deforestation, Supercompilation, and GPC.

Morten Heine Sørensen, Robert Glück, Neil D. Jones

Proceedings of the Programming Languages and Systems, 1994

The Essence of Program Transformation by Partial Evaluation and Driving.

Neil D. Jones

Proceedings of the Logic, 1994

Generalizing Cook's Transformation to Imperative Stack Programs.

Nils Andersen, Neil D. Jones

Proceedings of the Results and Trends in Theoretical Computer Science, 1994

Higher-Order Minimal Functional Graphs.

Neil D. Jones, Mads Rosendahl

Proceedings of the Algebraic and Logic Programming, 4th International Conference, 1994

1993

Constant time factors do matter.

Neil D. Jones

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Partial evaluation and automatic program generation.

Neil D. Jones, Carsten K. Gomard, Peter Sestoft

Prentice Hall international series in computer science, Prentice Hall, ISBN: 978-0-13-020249-9, 1993

1991

Static Semantics, Types, and Binding Time Analysis.

Neil D. Jones

Theor. Comput. Sci., 1991

Compiler Generation by Partial Evaluation: A Case Study.

Carsten K. Gomard, Neil D. Jones

Struct. Program., 1991

Foreword (Selected Papers of ESOP '90).

Neil D. Jones

Sci. Comput. Program., 1991

A Partial Evaluator for the Untyped lambda-Calculus.

Carsten K. Gomard, Neil D. Jones

J. Funct. Program., 1991

Efficient Algebraic Operations on Programs.

Neil D. Jones

Proceedings of the Algebraic Methodology and Software Technology (AMAST '91), 1991

1990

A Self-Applicable Partial Evaluator for the Lambda Calculus.

Neil D. Jones, Carsten K. Gomard, Anders Bondorf, Olivier Danvy, Torben Æ. Mogensen

Proceedings of the 1990 Internation Conference on Computer Languages, 1990

Partial Evaluation, Self-Application and Types.

Neil D. Jones

Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

1989

Mix: A Self-Applicable Partial Evaluator for Experiments in Compiler Generation.

Neil D. Jones, Peter Sestoft, Harald Søndergaard

LISP Symb. Comput., 1989

Experiments with Implementations of Two Theoretical Constructions.

Torben Amtoft Hansen, Thomas Nikolajsen, Jesper Larsson Träff, Neil D. Jones

Proceedings of the Logic at Botik '89, 1989

1988

Challenging Problems in Partial Evaluation and Mixed Computation.

Neil D. Jones

New Gener. Comput., 1988

Scientific Foreword.

Neil D. Jones

New Gener. Comput., 1988

1987

MIX: A Self-Applicable Partial Evaluator for Experiments in Compiler Generation (Extended Abstract).

Neil D. Jones, Peter Sestoft, Harald Søndergaard

Proceedings of the Mathematical Foundations of Programming Language Semantics, 1987

1986

Data Flow Analysis of Applicative Programs Using Minimal Function Graphs.

Neil D. Jones, Alan Mycroft

Proceedings of the Conference Record of the Thirteenth Annual ACM Symposium on Principles of Programming Languages, 1986

1985

An experiment in partial evaluation: the generation of a compiler generator.

Neil D. Jones, Peter Sestoft, Harald Søndergaard

ACM SIGPLAN Notices, 1985

A relational framework for abstract interpretation.

Alan Mycroft, Neil D. Jones

Proceedings of the Programs as Data Objects, 1985

1984

A method for detecting structure in polyhedra.

Peter Johansen, Neil D. Jones, Jens Clausen

Pattern Recognit. Lett., 1984

Stepwise Development of Operational and Denotational Semantics for Prolog.

Neil D. Jones, Alan Mycroft

Proceedings of the 1984 International Symposium on Logic Programming, 1984

1982

A Flexible Approach to Interprocedural Data Flow Analysis and Programs with Recursive Data Structures.

Neil D. Jones, Steven S. Muchnick

Proceedings of the Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages, 1982

A Fixed-Program Machine for Combinator Expression Evaluation.

Steven S. Muchnick, Neil D. Jones

Proceedings of the 1982 ACM Symposium on LISP and Functional Programming, 1982

Control Flow Treatment in a Simple Semantics-Directed Compiler Generator.

Henning Christiansen, Neil D. Jones

Proceedings of the Formal Description of Programming Concepts : Proceedings of the IFIP Working Conference on Formal Description of Programming Concepts- II, 1982

1981

A Note on the Complexity of General D0L Membership.

Neil D. Jones, Sven Skyum

SIAM J. Comput., 1981

Flow Analysis of Lambda Expressions (Preliminary Version).

Neil D. Jones

Proceedings of the Automata, 1981

Program flow analysis - theory and applications.

Steven S. Muchnick, Neil D. Jones

Prentice Hall software series, Prentice Hall, ISBN: 978-0-13-729681-1, 1981

1980

Complexity of Flow Analysis, Inductive Assertion Synthesis and a Language Due to Dijkstra

Neil D. Jones, Steven S. Muchnick

Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980

Compiler generation from denotational semantics.

Neil D. Jones, David A. Schmidt

Proceedings of the Semantics-Directed Compiler Generation, 1980

Attribute-influenced LR parsing.

Neil D. Jones, C. Michael Madsen

Proceedings of the Semantics-Directed Compiler Generation, 1980

1979

Complexity of Some Problems Concerning L Systems.

Neil D. Jones, Sven Skyum

Math. Syst. Theory, 1979

Flow Analysis and Optimization of Lisp-Like Structures.

Neil D. Jones, Steven S. Muchnick

Proceedings of the Conference Record of the Sixth Annual ACM Symposium on Principles of Programming Languages, 1979

1978

Corrigendum: Context Free Languages and Rudimentary Attributes.

Neil D. Jones

Math. Syst. Theory, 1978

The Complexity of Finite Memory Programs with Recursion.

Neil D. Jones, Steven S. Muchnick

J. ACM, 1978

Parsers for indexed grammars.

Robert W. Sebesta, Neil D. Jones

Int. J. Parallel Program., 1978

TEMPO: A Unified Treatment of Binding Time and Parameter Passing Concepts in Programming Languages

Neil D. Jones, Steven S. Muchnick

Lecture Notes in Computer Science 66, Springer, ISBN: 3-540-09085-1, 1978

1977

Recognition of Deterministic ETOL Languages in Logarathimic Space

Neil D. Jones, Sven Skyum

Inf. Control., November, 1977

Complexity of Some Problems in Petri Nets.

Neil D. Jones, Lawrence H. Landweber, Y. Edmund Lien

Theor. Comput. Sci., 1977

Corrigendum: Space-Bounded Reducibility among Combinatorial Problems.

Neil D. Jones

J. Comput. Syst. Sci., 1977

Even Simple Programs Are Hard To Analyze.

Neil D. Jones, Steven S. Muchnick

J. ACM, 1977

A Note on Linear Time Simulation of Deterministic Two-Way Pushdown Automata.

Neil D. Jones

Inf. Process. Lett., 1977

1976

Complete Problems for Deterministic Polynomial Time.

Neil D. Jones, William T. Laaser

Theor. Comput. Sci., 1976

New Problems Complete for Nondeterministic Loc Space.

Neil D. Jones, Y. Edmund Lien, William T. Laaser

Math. Syst. Theory, 1976

Binding Time Optimization in Programming Languages: Some Thoughts Toward the Design of an Ideal Language.

Neil D. Jones, Steven S. Muchnick

Proceedings of the Conference Record of the Third ACM Symposium on Principles of Programming Languages, 1976

1975

Space-Bounded Reducibility among Combinatorial Problems.

Neil D. Jones

J. Comput. Syst. Sci., 1975

1974

Turing Machines and the Spectra of First-Order Formulas.

Neil D. Jones, Alan L. Selman

J. Symb. Log., 1974

1973

Discrete structures in the undergraduate computer science curriculum.

Gerald L. Engel, Neil D. Jones

Proceedings of the 3rd SIGCSE Technical Symposium on Computer Science Education, 1973

1972

Turing Machines and the Spectra of First-Order Formulas with Equality

Neil D. Jones, Alan L. Selman

Proceedings of the 4th Annual ACM Symposium on Theory of Computing, 1972

1971

Automata: a teaching aid for mathematical machines.

Lawrence L. Rose, Neil D. Jones, Bruce H. Barnes

ACM SIGCSE Bull., 1971

Priority Paging Algorithms and the Extension Problem

Edward G. Coffman Jr., Neil D. Jones

Proceedings of the 12th Annual Symposium on Switching and Automata Theory, 1971

1970

A Note on the Index of a Context-Free Language

Neil D. Jones

Inf. Control., April, 1970

1969

Context-Free Languages and Rudimentary Attributes.

Neil D. Jones

Math. Syst. Theory, 1969

1968

Classes of Automata and Transitive Closure

Neil D. Jones

Inf. Control., September, 1968