Neil D. Jones

Geoffrey William Hamilton, Neil D. Jones: Distillation with labelled transition systems. PEPM 2012: 15-24

Roberto Giacobazzi, Neil D. Jones, Isabella Mastroeni: Obfuscation by partial evaluation of distorted interpreters. PEPM 2012: 63-72

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

Neil D. Jones, Markus Müller-Olm: Preface to a special section on verification, model checking, and abstract interpretation. STTT 13(6): 491-493 (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: 403-433

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

Lars Hartmann, Neil D. Jones, Jakob Grue Simonsen: Programming in Biomolecular Computation. Electr. Notes Theor. Comput. Sci. 268: 97-114 (2010)

Matthias Heizmann, Neil D. Jones, Andreas Podelski: Size-Change Termination and Transition Invariants. SAS 2010: 22-50

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

Neil D. Jones, Markus Müller-Olm (Eds.): Verification, Model Checking, and Abstract Interpretation, 10th International Conference, VMCAI 2009, Savannah, GA, USA, January 18-20, 2009. Proceedings. Lecture Notes in Computer Science 5403, Springer 2009, isbn 978-3-540-93899-6

Neil D. Jones, Nina Bohr: Call-by-Value Termination in the Untyped lambda-Calculus. Logical Methods in Computer Science 4(1) (2008)

Amir M. Ben-Amram, Neil D. Jones, Lars Kristiansen: Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time. CiE 2008: 67-76

Neil D. Jones, René Rydhof Hansen: CTL as an Intermediate Language. VMCAI 2008: 4

Neil D. Jones, Nina Bohr: Call-by-value Termination in the Untyped Lambda-calculus. CoRR abs/0801.0882 (2008)

Neil D. Jones, Nils Andersen: Flow analysis of lazy higher-order functional programs. Theor. Comput. Sci. 375(1-3): 120-136 (2007)

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

Neil D. Jones: Guest Editor's Foreword. Nord. J. Comput. 13(1-2): 1 (2006)

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

Damien Sereni, Neil D. Jones: Termination Analysis of Higher-Order Functional Programs. APLAS 2005: 281-297

Lars Kristiansen, Neil D. Jones: The Flow of Data and the Complexity of Algorithms. CiE 2005: 263-274

David Lacey, Neil D. Jones, Eric Van Wyk, Carl Christian Frederiksen: Compiler Optimization Correctness by Temporal Logic. Higher-Order and Symbolic Computation 17(3): 173-206 (2004)

Neil D. Jones: Transformation by interpreter specialisation. Sci. Comput. Program. 52: 307-339 (2004)

Neil D. Jones, Nina Bohr: Termination Analysis of the Untyped lamba-Calculus. RTA 2004: 1-23

Neil D. Jones, Xavier Leroy (Eds.): Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2004, Venice, Italy, January 14-16, 2004. ACM 2004, isbn 1-58113-729-X

Neil D. Jones, Arne J. Glenstrup: Program Generation, Termination, and Binding-Time Analysis. GPCE 2002: 1-31

Neil D. Jones, Arne J. Glenstrup: Program generation, termination, and binding-time analysis. ICFP 2002: 283

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

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

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

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

Neil D. Jones: Program Analysis for Implicit Computational Complexity. PADO 2001: 1

Chin Soon Lee, Neil D. Jones, Amir M. Ben-Amram: The size-change principle for program termination. POPL 2001: 81-92

Amir M. Ben-Amram, Neil D. Jones: Computational complexity via programming languages: constant factors do matter. Acta Inf. 37(2): 83-120 (2000)

Amir M. Ben-Amram, Neil D. Jones: A Precise Version of a Time Hierarchy Theorem. Fundam. Inform. 38(1-2): 1-15 (1999)

Neil D. Jones: EAPLS: the European Association for Programming Languages and Systems. SIGPLAN Notices 34(2): 19-20 (1999)

Neil D. Jones: LOGSPACE and PTIME Characterized by Programming Languages. Theor. Comput. Sci. 228(1-2): 151-174 (1999)

Neil D. Jones: The Essence of Program Transformation by Partial Evaluation and Driving. Ershov Memorial Conference 1999: 62-79

Neil D. Jones, Carsten K. Gomard, Peter Sestoft: Partial Evaluation for the Lambda Calculus. Partial Evaluation 1998: 203-220

Neil D. Jones: Computability and complexity - from a programming perspective. Foundations of computing series, MIT Press 1997, isbn 978-0-262-10064-9, pp. I-XVI, 1-466

Neil D. Jones, Mads Rosendahl: Higher-Order Minimal Function Graphs. Journal of Functional and Logic Programming 1997(2) (1997)

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

Peter Lee, Fritz Henglein, Neil D. Jones (Eds.): Conference Record of POPL'97: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Papers Presented at the Symposium, Paris, France, 15-17 January 1997. ACM Press 1997, isbn 0-89791-853-3

Neil D. Jones: An Introduction to Partial Evaluation. ACM Comput. Surv. 28(3): 480-503 (1996)

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

Neil D. Jones: What Not to Do When Writing an Interpreter for Specialisation. Dagstuhl Seminar on Partial Evaluation 1996: 216-237

Arne J. Glenstrup, Neil D. Jones: BTA Algorithms to Ensure Termination of Off-Line Partial Evaluation. Ershov Memorial Conference 1996: 273-284

Neil D. Jones: Complexity and computability from a programming language perspective. Electr. Notes Theor. Comput. Sci. 1: 313-333 (1995)

Neil D. Jones: Special Address: MIX ten years after. PEPM 1995: 24-38

Neil D. Jones (Ed.): Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, La Jolla, California, USA, June 21-23, 1995. ACM Press 1995, isbn 0-89791-720-0

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

Neil D. Jones, Mads Rosendahl: Higher-Order Minimal Functional Graphs. ALP 1994: 242-252

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

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

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

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

Neil D. Jones: Abstract Interpretation and Partial Evaluation in Functional and Logic Programming. SLP 1994: 17-22

Neil D. Jones, Masami Hagiya, Masahiko Sato (Eds.): Logic, Language and Computation, Festschrift in Honor of Satoru Takasu. Lecture Notes in Computer Science 792, Springer 1994

Neil D. Jones, Carsten K. Gomard, Peter Sestoft: Partial evaluation and automatic program generation. Prentice Hall international series in computer science, Prentice Hall 1993, isbn 978-0-13-020249-9, pp. I-XII, 1-415

Neil D. Jones: Constant time factors do matter. STOC 1993: 602-611

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

Neil D. Jones: Foreword (Selected Papers of ESOP '90). Sci. Comput. Program. 17(1-3): 1-2 (1991)

Carsten K. Gomard, Neil D. Jones: Compiler Generation by Partial Evaluation: A Case Study. Structured Programming 12(3): 123-144 (1991)

Neil D. Jones: Static Semantics, Types, and Binding Time Analysis. Theor. Comput. Sci. 90(1): 95-118 (1991)

Neil D. Jones: Efficient Algebraic Operations on Programs. AMAST 1991: 393-420

Neil D. Jones: Partial Evaluation, Self-Application and Types. ICALP 1990: 639-659

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

Neil D. Jones (Ed.): ESOP'90, 3rd European Symposium on Programming, Copenhagen, Denmark, May 15-18, 1990, Proceedings. Lecture Notes in Computer Science 432, Springer 1990, isbn 3-540-52592-0

Neil D. Jones, Peter Sestoft, Harald Søndergaard: Mix: A Self-Applicable Partial Evaluator for Experiments in Compiler Generation. Lisp and Symbolic Computation 2(1): 9-50 (1989)

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

Carsten K. Gomard, Neil D. Jones: Compiler Generation by Partial Evaluation: A Case Study. IFIP Congress 1989: 1139-1144

Neil D. Jones: Scientific Foreword. New Generation Comput. 6(2&3): 87-90 (1988)

Neil D. Jones: Challenging Problems in Partial Evaluation and Mixed Computation. New Generation Comput. 6(2&3): 291-302 (1988)

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

Neil D. Jones, Alan Mycroft: Data Flow Analysis of Applicative Programs Using Minimal Function Graphs. POPL 1986: 296-306

Harald Ganzinger, Neil D. Jones (Eds.): Programs as Data Objects, Proceedings of a Workshop, Copenhagen, Denmark, October 17-19, 1985. Lecture Notes in Computer Science 217, Springer 1986, isbn 3-540-16446-4

Alan Mycroft, Neil D. Jones: A relational framework for abstract interpretation. Programs as Data Objects 1985: 156-171

Neil D. Jones, Peter Sestoft, Harald Søndergaard: An Experiment in Partial Evaluation: The Generation of a Compiler Generator. RTA 1985: 124-140

Neil D. Jones, Alan Mycroft: Stepwise Development of Operational and Denotational Semantics for Prolog. SLP 1984: 281-288

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

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

Steven S. Muchnick, Neil D. Jones: Program flow analysis - theory and applications. Prentice Hall software series, Prentice Hall 1981, isbn 978-0-13-729681-1, pp. I-XVII, 1-418

Neil D. Jones, Sven Skyum: A Note on the Complexity of General D0L Membership. SIAM J. Comput. 10(1): 114-117 (1981)

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

Neil D. Jones, David A. Schmidt: Compiler generation from denotational semantics. Semantics-Directed Compiler Generation 1980: 70-93

Neil D. Jones, C. Michael Madsen: Attribute-influenced LR parsing. Semantics-Directed Compiler Generation 1980: 393-407

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

Neil D. Jones (Ed.): Semantics-Directed Compiler Generation, Proceedings of a Workshop, Aarhus, Denmark, January 14-18, 1980. Lecture Notes in Computer Science 94, Springer 1980, isbn 3-540-10250-7

Neil D. Jones, Sven Skyum: Complexity of Some Problems Concerning L Systems. Mathematical Systems Theory 13: 29-43 (1979)

Neil D. Jones, Steven S. Muchnick: Flow Analysis and Optimization of Lisp-Like Structures. POPL 1979: 244-256

Neil D. Jones, Steven S. Muchnick: TEMPO: A Unified Treatment of Binding Time and Parameter Passing Concepts in Programming Languages. Lecture Notes in Computer Science 66, Springer 1978, isbn 3-540-09085-1

Robert W. Sebesta, Neil D. Jones: Parsers for indexed grammars. International Journal of Parallel Programming 7(4): 345-359 (1978)

Neil D. Jones, Steven S. Muchnick: The Complexity of Finite Memory Programs with Recursion. J. ACM 25(2): 312-321 (1978)

Neil D. Jones: Corrigendum: Context Free Languages and Rudimentary Attributes. Mathematical Systems Theory 11: 379-380 (1978)

Neil D. Jones, Sven Skyum: Recognition of Deterministic ETOL Languages in Logarathimic Space. Information and Control 35(3): 177-181 (1977)

Neil D. Jones: A Note on Linear Time Simulation of Deterministic Two-Way Pushdown Automata. Inf. Process. Lett. 6(4): 110-112 (1977)

Neil D. Jones, Steven S. Muchnick: Even Simple Programs Are Hard To Analyze. J. ACM 24(2): 338-350 (1977)

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

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

Neil D. Jones, Sven Skyum: Complexity of Some Problems Concerning L Systems. ICALP 1977: 301-308

Neil D. Jones, Y. Edmund Lien, William T. Laaser: New Problems Complete for Nondeterministic Loc Space. Mathematical Systems Theory 10: 1-17 (1976)

Neil D. Jones, William T. Laaser: Complete Problems for Deterministic Polynomial Time. Theor. Comput. Sci. 3(1): 105-117 (1976)

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

Neil D. Jones: Space-Bounded Reducibility among Combinatorial Problems. J. Comput. Syst. Sci. 11(1): 68-85 (1975)

Neil D. Jones, Steven S. Muchnick: Even Simple Programs are Hard to Analyze. POPL 1975: 106-118

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

Neil D. Jones, William T. Laaser: Complete Problems for Deterministic Polynomial Time. STOC 1974: 40-46

Neil D. Jones, Alan L. Selman: Turing Machines and the Spectra of First-Order Formulas with Equality. STOC 1972: 157-167

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

Neil D. Jones: A Note on the Index of a Context-Free Language. Information and Control 16(2): 201-202 (1970)

Neil D. Jones: Context-Free Languages and Rudimentary Attributes. Mathematical Systems Theory 3(2): 102-109 (1969)

Neil D. Jones: Classes of Automata and Transitive Closure. Information and Control 13(3): 207-229 (1968)

Neil D. Jones: Classes of Automata and Transitive Closure. SWAT (FOCS) 1967: 296-306