Neil D. Jones

Publication Activity (10 Years)

Years Active: 1967-2020
Publications (10 Years): 3

Top Venues

PEPM

Bull. Symb. Log.

Ershov Memorial Conference

Festschrift for Dave Schmidt

Publications

Neil D. Jones, Siddharth Bhaskar, Cynthia Kop, Jakob Grue Simonsen
Cons-free Programs and Complexity Classes between LOGSPACE and PTIME. VPT/HCVS@ETAPS (2020)
Neil D. Jones
On Modeling and Programming. ISoLA (1) (2018)
Daniil Berezun, Neil D. Jones
Compiling untyped lambda calculus to lower-level code by game semantics and partial evaluation (invited paper). PEPM (2017)
Neil D. Jones, Geoff W. Hamilton
Asymptotic Speedups, Bisimulation and Distillation (Work in Progress). Ershov Memorial Conference (2014)
Neil D. Jones
A Swiss Pocket Knife for Computability. Festschrift for Dave Schmidt (2013)
Arnaud Durand, Neil D. Jones, Johann A. Makowsky, Malika More
Fifty years of the spectrum problem: survey and new results. Bull. Symb. Log. 18 (4) (2012)
Roberto Giacobazzi, Neil D. Jones, Isabella Mastroeni
Obfuscation by partial evaluation of distorted interpreters. PEPM (2012)
Geoffrey William Hamilton, Neil D. Jones
Distillation with labelled transition systems. PEPM (2012)
Lars Hartmann, Neil D. Jones, Jakob Grue Simonsen, Søren Bjerregaard Vrist
Programming in Biomolecular Computation: Programs, Self-Interpretation and Visualisation. Sci. Ann. Comput. Sci. 21 (1) (2011)
Lars Hartmann, Neil D. Jones, Jakob Grue Simonsen, Søren Bjerregaard Vrist
Computational Biology: A Programming Perspective. Formal Modeling: Actors, Open Systems, Biological Systems (2011)
Geoff W. Hamilton, Neil D. Jones
Proving the Correctness of Unfold/Fold Program Transformations Using Bisimulation. Ershov Memorial Conference (2011)
Neil D. Jones, Markus Müller-Olm
Preface to a special section on verification, model checking, and abstract interpretation. Int. J. Softw. Tools Technol. Transf. 13 (6) (2011)
Lars Hartmann, Neil D. Jones, Jakob Grue Simonsen
Programming in Biomolecular Computation. Electron. Notes Theor. Comput. Sci. 268 (2010)
Matthias Heizmann, Neil D. Jones, Andreas Podelski
Size-Change Termination and Transition Invariants. SAS (2010)
Neil D. Jones, Lars Kristiansen
-bounds for complexity analysis. ACM Trans. Comput. Log. 10 (4) (2009)
Neil D. Jones, René Rydhof Hansen
CTL as an Intermediate Language. VMCAI (2008)
Amir M. Ben-Amram, Neil D. Jones, Lars Kristiansen
Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time. CiE (2008)
Neil D. Jones, Nina Bohr
Call-by-value Termination in the Untyped Lambda-calculus CoRR (2008)
Neil D. Jones, Nina Bohr
Call-by-Value Termination in the Untyped lambda-Calculus. Log. Methods Comput. Sci. 4 (1) (2008)
Neil D. Jones, René Rydhof Hansen
The Semantics of "Semantic Patches" in Coccinelle: Program Transformation for the Working Programmer. APLAS (2007)
Neil D. Jones, Nils Andersen
Flow analysis of lazy higher-order functional programs. Theor. Comput. Sci. 375 (1-3) (2007)
Wei-Ngan Chin, Siau-Cheng Khoo, Neil D. Jones
Redundant Call Elimination via Tupling. Fundam. Informaticae 69 (1-2) (2006)
Neil D. Jones
Guest Editor's Foreword. Nord. J. Comput. 13 (1-2) (2006)
Lars Kristiansen, Neil D. Jones
The Flow of Data and the Complexity of Algorithms. CiE (2005)
Damien Sereni, Neil D. Jones
Termination Analysis of Higher-Order Functional Programs. APLAS (2005)
Arne J. Glenstrup, Neil D. Jones
Termination analysis and specialization-point insertion in offline partial evaluation. ACM Trans. Program. Lang. Syst. 27 (6) (2005)
David Lacey, Neil D. Jones, Eric Van Wyk, Carl Christian Frederiksen
Compiler Optimization Correctness by Temporal Logic. High. Order Symb. Comput. 17 (3) (2004)
Neil D. Jones
Transformation by interpreter specialisation. Sci. Comput. Program. 52 (2004)
Neil D. Jones, Nina Bohr
Termination Analysis of the Untyped lamba-Calculus. RTA (2004)
David Lacey, Neil D. Jones, Eric Van Wyk, Carl Christian Frederiksen
Proving correctness of compiler optimizations by temporal logic. POPL (2002)
Neil D. Jones, Arne J. Glenstrup
Abstract and conclusions of PLI invited paper: program generation, termination, and binding-time analysis. PPDP (2002)
Neil D. Jones, Arne J. Glenstrup
Program generation, termination, and binding-time analysis. ICFP (2002)
Neil D. Jones, Arne J. Glenstrup
Program Generation, Termination, and Binding-Time Analysis. GPCE (2002)
Chin Soon Lee, Neil D. Jones, Amir M. Ben-Amram
The size-change principle for program termination. POPL (2001)
Neil D. Jones
The expressive power of higher-order types or, life without CONS. J. Funct. Program. 11 (1) (2001)
Neil D. Jones
Program Analysis for Implicit Computational Complexity. PADO (2001)
Neil D. Jones
Program Termination Analysis by Size-Change Graphs (Abstract). IJCAR (2001)
Amir M. Ben-Amram, Neil D. Jones
Computational complexity via programming languages: constant factors do matter. Acta Informatica 37 (2) (2000)
Neil D. Jones
The Essence of Program Transformation by Partial Evaluation and Driving. Ershov Memorial Conference (1999)
Neil D. Jones
LOGSPACE and PTIME Characterized by Programming Languages. Theor. Comput. Sci. 228 (1-2) (1999)
Amir M. Ben-Amram, Neil D. Jones
A Precise Version of a Time Hierarchy Theorem. Fundam. Informaticae 38 (1-2) (1999)
Neil D. Jones
EAPLS: the European Association for Programming Languages and Systems. ACM SIGPLAN Notices 34 (2) (1999)
Neil D. Jones, Carsten K. Gomard, Peter Sestoft
Partial Evaluation for the Lambda Calculus. Partial Evaluation (1998)
Neil D. Jones, Mads Rosendahl
Higher-Order Minimal Function Graphs. J. Funct. Log. Program. 1997 (2) (1997)
Neil D. Jones
Combining Abstract Interpretation and Partial Evaluation (Brief Overview). SAS (1997)
Morten Heine Sørensen, Robert Glück, Neil D. Jones
A Positive Supercompiler. J. Funct. Program. 6 (6) (1996)
Neil D. Jones
An Introduction to Partial Evaluation. ACM Comput. Surv. 28 (3) (1996)
Neil D. Jones
What Not to Do When Writing an Interpreter for Specialisation. Dagstuhl Seminar on Partial Evaluation (1996)
Arne J. Glenstrup, Neil D. Jones
BTA Algorithms to Ensure Termination of Off-Line Partial Evaluation. Ershov Memorial Conference (1996)
Neil D. Jones
Complexity and computability from a programming language perspective. MFPS (1995)
Neil D. Jones
Special Address: MIX ten years after. PEPM (1995)
Neil D. Jones
Abstract Interpretation and Partial Evaluation in Functional and Logic Programming. ILPS (1994)
Nils Andersen, Neil D. Jones
Generalizing Cook's Transformation to Imperative Stack Programs. Results and Trends in Theoretical Computer Science (1994)
Neil D. Jones
The Essence of Program Transformation by Partial Evaluation and Driving. Logic, Language and Computation (1994)
Neil D. Jones, Mads Rosendahl
Higher-Order Minimal Functional Graphs. ALP (1994)
Kim Marriott, Harald Søndergaard, Neil D. Jones
Denotational Abstract Interpretation of Logic Programs. ACM Trans. Program. Lang. Syst. 16 (3) (1994)
Neil D. Jones
Program Speedups in Theory and Practice. IFIP Congress (1) (1994)
Morten Heine Sørensen, Robert Glück, Neil D. Jones
Towards Unifying Partial Evaluation, Deforestation, Supercompilation, and GPC. ESOP (1994)
Neil D. Jones
Constant time factors do matter. STOC (1993)
Neil D. Jones
Foreword (Selected Papers of ESOP '90). Sci. Comput. Program. 17 (1-3) (1991)
Carsten K. Gomard, Neil D. Jones
Compiler Generation by Partial Evaluation: A Case Study. Struct. Program. 12 (3) (1991)
Carsten K. Gomard, Neil D. Jones
A Partial Evaluator for the Untyped lambda-Calculus. J. Funct. Program. 1 (1) (1991)
Neil D. Jones
Static Semantics, Types, and Binding Time Analysis. Theor. Comput. Sci. 90 (1) (1991)
Neil D. Jones
Efficient Algebraic Operations on Programs. AMAST (1991)
Neil D. Jones, Carsten K. Gomard, Anders Bondorf, Olivier Danvy, Torben Æ. Mogensen
A Self-Applicable Partial Evaluator for the Lambda Calculus. ICCL (1990)
Neil D. Jones
Partial Evaluation, Self-Application and Types. ICALP (1990)
Carsten K. Gomard, Neil D. Jones
Compiler Generation by Partial Evaluation: A Case Study. IFIP Congress (1989)
Torben Amtoft Hansen, Thomas Nikolajsen, Jesper Larsson Träff, Neil D. Jones
Experiments with Implementations of Two Theoretical Constructions. Logic at Botik (1989)
Neil D. Jones, Peter Sestoft, Harald Søndergaard
Mix: A Self-Applicable Partial Evaluator for Experiments in Compiler Generation. LISP Symb. Comput. 2 (1) (1989)
Neil D. Jones
Scientific Foreword. New Gener. Comput. 6 (2&3) (1988)
Neil D. Jones
Challenging Problems in Partial Evaluation and Mixed Computation. New Gener. Comput. 6 (2&3) (1988)
Neil D. Jones, Peter Sestoft, Harald Søndergaard
MIX: A Self-Applicable Partial Evaluator for Experiments in Compiler Generation (Extended Abstract). MFPS (1987)
Neil D. Jones, Alan Mycroft
Data Flow Analysis of Applicative Programs Using Minimal Function Graphs. POPL (1986)
Alan Mycroft, Neil D. Jones
A relational framework for abstract interpretation. Programs as Data Objects (1985)
Neil D. Jones, Peter Sestoft, Harald Søndergaard
An experiment in partial evaluation: the generation of a compiler generator. ACM SIGPLAN Notices 20 (8) (1985)
Neil D. Jones, Peter Sestoft, Harald Søndergaard
An Experiment in Partial Evaluation: The Generation of a Compiler Generator. RTA (1985)
Neil D. Jones, Alan Mycroft
Stepwise Development of Operational and Denotational Semantics for Prolog. SLP (1984)
Peter Johansen, Neil D. Jones, Jens Clausen
A method for detecting structure in polyhedra. Pattern Recognit. Lett. 2 (4) (1984)
Steven S. Muchnick, Neil D. Jones
A Fixed-Program Machine for Combinator Expression Evaluation. Symposium on LISP and Functional Programming (1982)
Neil D. Jones, Steven S. Muchnick
A Flexible Approach to Interprocedural Data Flow Analysis and Programs with Recursive Data Structures. POPL (1982)
Henning Christiansen, Neil D. Jones
Control Flow Treatment in a Simple Semantics-Directed Compiler Generator. Formal Description of Programming Concepts (1982)
Neil D. Jones
Flow Analysis of Lambda Expressions (Preliminary Version). ICALP (1981)
Neil D. Jones, Sven Skyum
A Note on the Complexity of General D0L Membership. SIAM J. Comput. 10 (1) (1981)
Neil D. Jones, David A. Schmidt
Compiler generation from denotational semantics. Semantics-Directed Compiler Generation (1980)
Neil D. Jones, C. Michael Madsen
Attribute-influenced LR parsing. Semantics-Directed Compiler Generation (1980)
Neil D. Jones, Steven S. Muchnick
Complexity of Flow Analysis, Inductive Assertion Synthesis and a Language Due to Dijkstra FOCS (1980)
Neil D. Jones, Sven Skyum
Complexity of Some Problems Concerning L Systems. Math. Syst. Theory 13 (1979)
Neil D. Jones, Steven S. Muchnick
Flow Analysis and Optimization of Lisp-Like Structures. POPL (1979)
Neil D. Jones
Corrigendum: Context Free Languages and Rudimentary Attributes. Math. Syst. Theory 11 (1978)
Neil D. Jones, Steven S. Muchnick
The Complexity of Finite Memory Programs with Recursion. J. ACM 25 (2) (1978)
Robert W. Sebesta, Neil D. Jones
Parsers for indexed grammars. Int. J. Parallel Program. 7 (4) (1978)
Neil D. Jones
A Note on Linear Time Simulation of Deterministic Two-Way Pushdown Automata. Inf. Process. Lett. 6 (4) (1977)
Neil D. Jones, Steven S. Muchnick
Even Simple Programs Are Hard To Analyze. J. ACM 24 (2) (1977)
Neil D. Jones
Corrigendum: Space-Bounded Reducibility among Combinatorial Problems. J. Comput. Syst. Sci. 15 (2) (1977)
Neil D. Jones, Lawrence H. Landweber, Y. Edmund Lien
Complexity of Some Problems in Petri Nets. Theor. Comput. Sci. 4 (3) (1977)
Neil D. Jones, Sven Skyum
Complexity of Some Problems Concerning L Systems. ICALP (1977)
Neil D. Jones, Sven Skyum
Recognition of Deterministic ETOL Languages in Logarathimic Space Inf. Control. 35 (3) (1977)
Neil D. Jones, William T. Laaser
Complete Problems for Deterministic Polynomial Time. Theor. Comput. Sci. 3 (1) (1976)
Neil D. Jones, Y. Edmund Lien, William T. Laaser
New Problems Complete for Nondeterministic Loc Space. Math. Syst. Theory 10 (1976)
Neil D. Jones, Steven S. Muchnick
Binding Time Optimization in Programming Languages: Some Thoughts Toward the Design of an Ideal Language. POPL (1976)

Neil D. Jones.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Neil D. Jones