Neil D. Jones

According to our database1, Neil D. Jones
  • authored at least 111 papers between 1967 and 2017.
  • has a "Dijkstra number"2 of four.

Awards

ACM Fellow

ACM Fellow 1998, "For outstanding contributions to semantics-directed compilation, especially partial evaluation, and to the theory of computation, formal models and their practical realization.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Compiling untyped lambda calculus to lower-level code by game semantics and partial evaluation (invited paper).
Proceedings of the 2017 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, 2017

2014
Asymptotic Speedups, Bisimulation and Distillation (Work in Progress).
Proceedings of the Perspectives of System Informatics, 2014

2013
A Swiss Pocket Knife for Computability.
Proceedings of the Semantics, 2013

2012
Fifty years of the spectrum problem: survey and new results.
Bulletin of Symbolic Logic, 2012

Distillation with labelled transition systems.
Proceedings of the ACM SIGPLAN 2012 Workshop on Partial Evaluation and Program Manipulation, 2012

Obfuscation by partial evaluation of distorted interpreters.
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.
STTT, 2011

Programming in Biomolecular Computation: Programs, Self-Interpretation and Visualisation.
Sci. Ann. Comp. Sci., 2011

Proving the Correctness of Unfold/Fold Program Transformations Using Bisimulation.
Proceedings of the Perspectives of Systems Informatics, 2011

Computational Biology: A Programming Perspective.
Proceedings of the Formal Modeling: Actors, Open Systems, Biological Systems, 2011

2010
Programming in Biomolecular Computation.
Electr. Notes Theor. Comput. Sci., 2010

Size-Change Termination and Transition Invariants.
Proceedings of the Static Analysis - 17th International Symposium, 2010

2009
A flow calculus of mwp-bounds for complexity analysis.
ACM Trans. Comput. Log., 2009

2008
Call-by-Value Termination in the Untyped lambda-Calculus.
Logical Methods in Computer Science, 2008

Call-by-value Termination in the Untyped Lambda-calculus
CoRR, 2008

CTL as an Intermediate Language.
Proceedings of the Verification, 2008

Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time.
Proceedings of the Logic and Theory of Algorithms, 2008

2007
Flow analysis of lazy higher-order functional programs.
Theor. Comput. Sci., 2007

The Semantics of "Semantic Patches" in Coccinelle: Program Transformation for the Working Programmer.
Proceedings of the Programming Languages and Systems, 5th Asian Symposium, 2007

2006
Guest Editor's Foreword.
Nord. J. Comput., 2006

Redundant Call Elimination via Tupling.
Fundam. Inform., 2006

2005
Termination analysis and specialization-point insertion in offline partial evaluation.
ACM Trans. Program. Lang. Syst., 2005

The Flow of Data and the Complexity of Algorithms.
Proceedings of the New Computational Paradigms, 2005

Termination Analysis of Higher-Order Functional Programs.
Proceedings of the Programming Languages and Systems, Third Asian Symposium, 2005

2004
Transformation by interpreter specialisation.
Sci. Comput. Program., 2004

Compiler Optimization Correctness by Temporal Logic.
Higher-Order and Symbolic Computation, 2004

Termination Analysis of the Untyped lamba-Calculus.
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.
Proceedings of the 4th international ACM SIGPLAN conference on Principles and practice of declarative programming, 2002

Proving correctness of compiler optimizations by temporal logic.
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.
Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming (ICFP '02), 2002

Program Generation, Termination, and Binding-Time Analysis.
Proceedings of the Generative Programming and Component Engineering, 2002

2001
The expressive power of higher-order types or, life without CONS.
J. Funct. Program., 2001

The size-change principle for program termination.
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.
Proceedings of the Programs as Data Objects, Second Symposium, 2001

Program Termination Analysis by Size-Change Graphs (Abstract).
Proceedings of the Automated Reasoning, First International Joint Conference, 2001

2000
Computational complexity via programming languages: constant factors do matter.
Acta Inf., 2000

1999
LOGSPACE and PTIME Characterized by Programming Languages.
Theor. Comput. Sci., 1999

EAPLS: the European Association for Programming Languages and Systems.
SIGPLAN Notices, 1999

A Precise Version of a Time Hierarchy Theorem.
Fundam. Inform., 1999

The Essence of Program Transformation by Partial Evaluation and Driving.
Proceedings of the Perspectives of System Informatics, 1999

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

1997
Higher-Order Minimal Function Graphs.
Journal of Functional and Logic Programming, 1997

Combining Abstract Interpretation and Partial Evaluation (Brief Overview).
Proceedings of the Static Analysis, 4th International Symposium, 1997

Computability and complexity - from a programming perspective.
Foundations of computing series, MIT Press, ISBN: 978-0-262-10064-9, 1997

1996
A Positive Supercompiler.
J. Funct. Program., 1996

An Introduction to Partial Evaluation.
ACM Comput. Surv., 1996

BTA Algorithms to Ensure Termination of Off-Line Partial Evaluation.
Proceedings of the Perspectives of System Informatics, 1996

What Not to Do When Writing an Interpreter for Specialisation.
Proceedings of the Partial Evaluation, International Seminar, 1996

1995
Complexity and computability from a programming language perspective.
Electr. Notes Theor. Comput. Sci., 1995

Special Address: MIX ten years after.
Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, 1995

1994
Denotational Abstract Interpretation of Logic Programs.
ACM Trans. Program. Lang. Syst., 1994

Abstract Interpretation and Partial Evaluation in Functional and Logic Programming.
Proceedings of the Logic Programming, 1994

Program Speedups in Theory and Practice.
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.
Proceedings of the Programming Languages and Systems, 1994

The Essence of Program Transformation by Partial Evaluation and Driving.
Proceedings of the Logic, 1994

Generalizing Cook's Transformation to Imperative Stack Programs.
Proceedings of the Results and Trends in Theoretical Computer Science, 1994

Higher-Order Minimal Functional Graphs.
Proceedings of the Algebraic and Logic Programming, 4th International Conference, 1994

1993
Constant time factors do matter.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Partial evaluation and automatic program generation.
Prentice Hall international series in computer science, Prentice Hall, ISBN: 978-0-13-020249-9, 1993

1991
Static Semantics, Types, and Binding Time Analysis.
Theor. Comput. Sci., 1991

Compiler Generation by Partial Evaluation: A Case Study.
Structured Programming, 1991

Foreword (Selected Papers of ESOP '90).
Sci. Comput. Program., 1991

A Partial Evaluator for the Untyped lambda-Calculus.
J. Funct. Program., 1991

Efficient Algebraic Operations on Programs.
Proceedings of the Algebraic Methodology and Software Technology (AMAST '91), 1991

1990
A Self-Applicable Partial Evaluator for the Lambda Calculus.
Proceedings of the 1990 Internation Conference on Computer Languages, 1990

Partial Evaluation, Self-Application and Types.
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

1989
Mix: A Self-Applicable Partial Evaluator for Experiments in Compiler Generation.
Lisp and Symbolic Computation, 1989

Compiler Generation by Partial Evaluation: A Case Study.
IFIP Congress, 1989

Experiments with Implementations of Two Theoretical Constructions.
Proceedings of the Logic at Botik '89, 1989

1988
Challenging Problems in Partial Evaluation and Mixed Computation.
New Generation Comput., 1988

Scientific Foreword.
New Generation Comput., 1988

1987
MIX: A Self-Applicable Partial Evaluator for Experiments in Compiler Generation (Extended Abstract).
Proceedings of the Mathematical Foundations of Programming Language Semantics, 1987

1986
Data Flow Analysis of Applicative Programs Using Minimal Function Graphs.
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.
SIGPLAN Notices, 1985

An Experiment in Partial Evaluation: The Generation of a Compiler Generator.
Proceedings of the Rewriting Techniques and Applications, First International Conference, 1985

A relational framework for abstract interpretation.
Proceedings of the Programs as Data Objects, 1985

1984
A method for detecting structure in polyhedra.
Pattern Recognition Letters, 1984

Stepwise Development of Operational and Denotational Semantics for Prolog.
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.
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.
Symposium on LISP and Functional Programming, 1982

1981
A Note on the Complexity of General D0L Membership.
SIAM J. Comput., 1981

Flow Analysis of Lambda Expressions (Preliminary Version).
Proceedings of the Automata, 1981

Program flow analysis - theory and applications.
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
Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980

Compiler generation from denotational semantics.
Proceedings of the Semantics-Directed Compiler Generation, 1980

Attribute-influenced LR parsing.
Proceedings of the Semantics-Directed Compiler Generation, 1980

1979
Complexity of Some Problems Concerning L Systems.
Mathematical Systems Theory, 1979

Flow Analysis and Optimization of Lisp-Like Structures.
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.
Mathematical Systems Theory, 1978

The Complexity of Finite Memory Programs with Recursion.
J. ACM, 1978

Parsers for indexed grammars.
International Journal of Parallel Programming, 1978

TEMPO: A Unified Treatment of Binding Time and Parameter Passing Concepts in Programming Languages
Lecture Notes in Computer Science 66, Springer, ISBN: 3-540-09085-1, 1978

1977
Recognition of Deterministic ETOL Languages in Logarathimic Space
Information and Control, November, 1977

Complexity of Some Problems in Petri Nets.
Theor. Comput. Sci., 1977

Corrigendum: Space-Bounded Reducibility among Combinatorial Problems.
J. Comput. Syst. Sci., 1977

Even Simple Programs Are Hard To Analyze.
J. ACM, 1977

A Note on Linear Time Simulation of Deterministic Two-Way Pushdown Automata.
Inf. Process. Lett., 1977

Complexity of Some Problems Concerning L Systems.
Proceedings of the Automata, 1977

1976
Complete Problems for Deterministic Polynomial Time.
Theor. Comput. Sci., 1976

New Problems Complete for Nondeterministic Loc Space.
Mathematical Systems Theory, 1976

Binding Time Optimization in Programming Languages: Some Thoughts Toward the Design of an Ideal Language.
Proceedings of the Conference Record of the Third ACM Symposium on Principles of Programming Languages, 1976

1975
Space-Bounded Reducibility among Combinatorial Problems.
J. Comput. Syst. Sci., 1975

Even Simple Programs are Hard to Analyze.
Proceedings of the Conference Record of the Second ACM Symposium on Principles of Programming Languages, 1975

1974
Turing Machines and the Spectra of First-Order Formulas.
J. Symb. Log., 1974

Complete Problems for Deterministic Polynomial Time
Proceedings of the 6th Annual ACM Symposium on Theory of Computing, April 30, 1974

1972
Turing Machines and the Spectra of First-Order Formulas with Equality
Proceedings of the 4th Annual ACM Symposium on Theory of Computing, 1972

1971
Priority Paging Algorithms and the Extension Problem
Proceedings of the 12th Annual Symposium on Switching and Automata Theory, 1971

1970
A Note on the Index of a Context-Free Language
Information and Control, April, 1970

1969
Context-Free Languages and Rudimentary Attributes.
Mathematical Systems Theory, 1969

1968
Classes of Automata and Transitive Closure
Information and Control, September, 1968

1967
Classes of Automata and Transitive Closure
Proceedings of the 8th Annual Symposium on Switching and Automata Theory, 1967


  Loading...