dblp.uni-trier.dewww.uni-trier.de

Neil D. Jones Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
98EENeil D. Jones, Markus Müller-Olm: Verification, Model Checking, and Abstract Interpretation, 10th International Conference, VMCAI 2009, Savannah, GA, USA, January 18-20, 2009. Proceedings Springer 2009
97EENeil D. Jones, Lars Kristiansen: A flow calculus of mwp-bounds for complexity analysis. ACM Trans. Comput. Log. 10(4): (2009)
2008
96EEAmir M. Ben-Amram, Neil D. Jones, Lars Kristiansen: Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time. CiE 2008: 67-76
95EENeil D. Jones, René Rydhof Hansen: CTL as an Intermediate Language. VMCAI 2008: 4
94EENeil D. Jones, Nina Bohr: Call-by-value Termination in the Untyped Lambda-calculus CoRR abs/0801.0882: (2008)
93EENeil D. Jones, Nina Bohr: Call-by-Value Termination in the Untyped lambda-Calculus. Logical Methods in Computer Science 4(1): (2008)
2007
92EENeil D. Jones, René Rydhof Hansen: The Semantics of "Semantic Patches" in Coccinelle: Program Transformation for the Working Programmer. APLAS 2007: 303-318
91EENeil D. Jones, Nils Andersen: Flow analysis of lazy higher-order functional programs. Theor. Comput. Sci. 375(1-3): 120-136 (2007)
2006
90 Neil D. Jones: Guest Editor's Foreword. Nord. J. Comput. 13(1-2): 1 (2006)
2005
89EEDamien Sereni, Neil D. Jones: Termination Analysis of Higher-Order Functional Programs. APLAS 2005: 281-297
88EELars Kristiansen, Neil D. Jones: The Flow of Data and the Complexity of Algorithms. CiE 2005: 263-274
87EEArne 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)
2004
86 Neil D. Jones, Xavier Leroy: Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2004, Venice, Italy, January 14-16, 2004 ACM 2004
85EENeil D. Jones, Nina Bohr: Termination Analysis of the Untyped lamba-Calculus. RTA 2004: 1-23
84EEDavid 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)
83EENeil D. Jones: Transformation by interpreter specialisation. Sci. Comput. Program. 52: 307-339 (2004)
2002
82EENeil D. Jones, Arne J. Glenstrup: Program Generation, Termination, and Binding-Time Analysis. GPCE 2002: 1-31
81EENeil D. Jones, Arne J. Glenstrup: Program generation, termination, and binding-time analysis. ICFP 2002: 283
80EEDavid Lacey, Neil D. Jones, Eric Van Wyk, Carl Christian Frederiksen: Proving correctness of compiler optimizations by temporal logic. POPL 2002: 283-294
79EENeil D. Jones, Arne J. Glenstrup: Abstract and conclusions of PLI invited paper: program generation, termination, and binding-time analysis. PPDP 2002: 1
2001
78EENeil D. Jones: Program Termination Analysis by Size-Change Graphs (Abstract). IJCAR 2001: 1-4
77EENeil D. Jones: Program Analysis for Implicit Computational Complexity. PADO 2001: 1
76EEChin Soon Lee, Neil D. Jones, Amir M. Ben-Amram: The size-change principle for program termination. POPL 2001: 81-92
75 Neil D. Jones: The expressive power of higher-order types or, life without CONS. J. Funct. Program. 11(1): 5-94 (2001)
2000
74EEAmir M. Ben-Amram, Neil D. Jones: Computational complexity via programming languages: constant factors do matter. Acta Inf. 37(2): 83-120 (2000)
1999
73EENeil D. Jones: The Essence of Program Transformation by Partial Evaluation and Driving. Ershov Memorial Conference 1999: 62-79
72 Amir M. Ben-Amram, Neil D. Jones: A Precise Version of a Time Hierarchy Theorem. Fundam. Inform. 38(1-2): 1-15 (1999)
71 Neil D. Jones: EAPLS: the European Association for Programming Languages and Systems. SIGPLAN Notices 34(2): 19-20 (1999)
70EENeil D. Jones: LOGSPACE and PTIME Characterized by Programming Languages. Theor. Comput. Sci. 228(1-2): 151-174 (1999)
1998
69 Neil D. Jones, Carsten K. Gomard, Peter Sestoft: Partial Evaluation for the Lambda Calculus. Partial Evaluation 1998: 203-220
1997
68 Neil D. Jones: Combining Abstract Interpretation and Partial Evaluation (Brief Overview). SAS 1997: 396-405
67 Neil D. Jones, Mads Rosendahl: Higher-Order Minimal Function Graphs. Journal of Functional and Logic Programming 1997(2): (1997)
1996
66 Neil D. Jones: What Not to Do When Writing an Interpreter for Specialisation. Dagstuhl Seminar on Partial Evaluation 1996: 216-237
65EEArne J. Glenstrup, Neil D. Jones: BTA Algorithms to Ensure Termination of Off-Line Partial Evaluation. Ershov Memorial Conference 1996: 273-284
64 Neil D. Jones: An Introduction to Partial Evaluation. ACM Comput. Surv. 28(3): 480-503 (1996)
63 Morten Heine Sørensen, Robert Glück, Neil D. Jones: A Positive Supercompiler. J. Funct. Program. 6(6): 811-838 (1996)
1995
62 Neil D. Jones: Special Address: MIX ten years after. PEPM 1995: 24-38
61EENeil D. Jones: Complexity and computability from a programming language perspective. Electr. Notes Theor. Comput. Sci. 1: (1995)
1994
60 Neil D. Jones, Masami Hagiya, Masahiko Sato: Logic, Language and Computation, Festschrift in Honor of Satoru Takasu Springer 1994
59EENeil D. Jones, Mads Rosendahl: Higher-Order Minimal Functional Graphs. ALP 1994: 242-252
58EEMorten Heine Sørensen, Robert Glück, Neil D. Jones: Towards Unifying Partial Evaluation, Deforestation, Supercompilation, and GPC. ESOP 1994: 485-500
57 Neil D. Jones: Program Speedups in Theory and Practice. IFIP Congress (1) 1994: 595-602
56 Neil D. Jones: The Essence of Program Transformation by Partial Evaluation and Driving. Logic, Language and Computation 1994: 206-224
55 Nils Andersen, Neil D. Jones: Generalizing Cook's Transformation to Imperative Stack Programs. Results and Trends in Theoretical Computer Science 1994: 1-18
54 Neil D. Jones: Abstract Interpretation and Partial Evaluation in Functional and Logic Programming. SLP 1994: 17-22
53EEKim Marriott, Harald Søndergaard, Neil D. Jones: Denotational Abstract Interpretation of Logic Programs. ACM Trans. Program. Lang. Syst. 16(3): 607-648 (1994)
1993
52EENeil D. Jones: Constant time factors do matter. STOC 1993: 602-611
1991
51 Neil D. Jones: Efficient Algebraic Operations on Programs. AMAST 1991: 393-420
50 Carsten K. Gomard, Neil D. Jones: A Partial Evaluator for the Untyped lambda-Calculus. J. Funct. Program. 1(1): 21-69 (1991)
49 Neil D. Jones: Foreword (Selected Papers of ESOP '90). Sci. Comput. Program. 17(1-3): 1-2 (1991)
48 Carsten K. Gomard, Neil D. Jones: Compiler Generation by Partial Evaluation: A Case Study. Structured Programming 12(3): 123-144 (1991)
47 Neil D. Jones: Static Semantics, Types, and Binding Time Analysis. Theor. Comput. Sci. 90(1): 95-118 (1991)
1990
46 Neil D. Jones: ESOP'90, 3rd European Symposium on Programming, Copenhagen, Denmark, May 15-18, 1990, Proceedings Springer 1990
45EENeil D. Jones: Partial Evaluation, Self-Application and Types. ICALP 1990: 639-659
44 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
1989
43 Carsten K. Gomard, Neil D. Jones: Compiler Generation by Partial Evaluation: A Case Study. IFIP Congress 1989: 1139-1144
42EETorben Amtoft Hansen, Thomas Nikolajsen, Jesper Larsson Träff, Neil D. Jones: Experiments with Implementations of Two Theoretical Constructions. Logic at Botik 1989: 119-133
41 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)
1988
40 Neil D. Jones: Challenging Problems in Partial Evaluation and Mixed Computation. New Generation Comput. 6(2&3): 291-302 (1988)
39 Neil D. Jones: Scientific Foreword. New Generation Comput. 6(2&3): 87-90 (1988)
1987
38EENeil D. Jones, Peter Sestoft, Harald Søndergaard: MIX: A Self-Applicable Partial Evaluator for Experiments in Compiler Generation (Extended Abstract). MFPS 1987: 386-413
1986
37 Harald Ganzinger, Neil D. Jones: Programs as Data Objects, Proceedings of a Workshop, Copenhagen, Denmark, October 17-19, 1985 Springer 1986
36 Neil D. Jones, Alan Mycroft: Data Flow Analysis of Applicative Programs Using Minimal Function Graphs. POPL 1986: 296-306
1985
35 Alan Mycroft, Neil D. Jones: A relational framework for abstract interpretation. Programs as Data Objects 1985: 156-171
34EENeil D. Jones, Peter Sestoft, Harald Søndergaard: An Experiment in Partial Evaluation: The Generation of a Compiler Generator. RTA 1985: 124-140
1984
33 Neil D. Jones, Alan Mycroft: Stepwise Development of Operational and Denotational Semantics for Prolog. SLP 1984: 281-288
1982
32 Neil D. Jones, Steven S. Muchnick: A Flexible Approach to Interprocedural Data Flow Analysis and Programs with Recursive Data Structures. POPL 1982: 66-74
31 Steven S. Muchnick, Neil D. Jones: A Fixed-Program Machine for Combinator Expression Evaluation. Symposium on LISP and Functional Programming 1982: 11-20
1981
30EENeil D. Jones: Flow Analysis of Lambda Expressions (Preliminary Version). ICALP 1981: 114-128
29 Neil D. Jones, Sven Skyum: A Note on the Complexity of General D0L Membership. SIAM J. Comput. 10(1): 114-117 (1981)
1980
28 Neil D. Jones: Semantics-Directed Compiler Generation, Proceedings of a Workshop, Aarhus, Denmark, January 14-18, 1980 Springer 1980
27 Neil D. Jones, Steven S. Muchnick: Complexity of Flow Analysis, Inductive Assertion Synthesis and a Language Due to Dijkstra FOCS 1980: 185-190
26EENeil D. Jones, C. Michael Madsen: Attribute-influenced LR parsing. Semantics-Directed Compiler Generation 1980: 393-407
25EENeil D. Jones, David A. Schmidt: Compiler generation from denotational semantics. Semantics-Directed Compiler Generation 1980: 70-93
1979
24EENeil D. Jones, Steven S. Muchnick: Flow Analysis and Optimization of Lisp-Like Structures. POPL 1979: 244-256
23 Neil D. Jones, Sven Skyum: Complexity of Some Problems Concerning L Systems. Mathematical Systems Theory 13: 29-43 (1979)
1978
22 Neil D. Jones, Steven S. Muchnick: TEMPO: A Unified Treatment of Binding Time and Parameter Passing Concepts in Programming Languages Springer 1978
21EENeil D. Jones, Steven S. Muchnick: The Complexity of Finite Memory Programs with Recursion. J. ACM 25(2): 312-321 (1978)
20 Neil D. Jones: Corrigendum: Context Free Languages and Rudimentary Attributes. Mathematical Systems Theory 11: 379-380 (1978)
1977
19EENeil D. Jones, Sven Skyum: Complexity of Some Problems Concerning L Systems. ICALP 1977: 301-308
18 Neil D. Jones: A Note on Linear Time Simulation of Deterministic Two-Way Pushdown Automata. Inf. Process. Lett. 6(4): 110-112 (1977)
17 Neil D. Jones, Sven Skyum: Recognition of Deterministic ETOL Languages in Logarathimic Space Information and Control 35(3): 177-181 (1977)
16EENeil D. Jones, Steven S. Muchnick: Even Simple Programs Are Hard To Analyze. J. ACM 24(2): 338-350 (1977)
15 Neil D. Jones: Corrigendum: Space-Bounded Reducibility among Combinatorial Problems. J. Comput. Syst. Sci. 15(2): 241 (1977)
14 Neil D. Jones, Lawrence H. Landweber, Y. Edmund Lien: Complexity of Some Problems in Petri Nets. Theor. Comput. Sci. 4(3): 277-299 (1977)
1976
13 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
12 Neil D. Jones, Y. Edmund Lien, William T. Laaser: New Problems Complete for Nondeterministic Loc Space. Mathematical Systems Theory 10: 1-17 (1976)
11 Neil D. Jones, William T. Laaser: Complete Problems for Deterministic Polynomial Time. Theor. Comput. Sci. 3(1): 105-117 (1976)
1975
10 Neil D. Jones, Steven S. Muchnick: Even Simple Programs are Hard to Analyze. POPL 1975: 106-118
9 Neil D. Jones: Space-Bounded Reducibility among Combinatorial Problems. J. Comput. Syst. Sci. 11(1): 68-85 (1975)
1974
8 Neil D. Jones, William T. Laaser: Complete Problems for Deterministic Polynomial Time STOC 1974: 40-46
7 Neil D. Jones, Alan L. Selman: Turing Machines and the Spectra of First-Order Formulas. J. Symb. Log. 39(1): 139-150 (1974)
1972
6 Neil D. Jones, Alan L. Selman: Turing Machines and the Spectra of First-Order Formulas with Equality STOC 1972: 157-167
1971
5 Edward G. Coffman Jr., Neil D. Jones: Priority Paging Algorithms and the Extension Problem FOCS 1971: 177-181
1970
4 Neil D. Jones: A Note on the Index of a Context-Free Language Information and Control 16(2): 201-202 (1970)
1969
3 Neil D. Jones: Context-Free Languages and Rudimentary Attributes. Mathematical Systems Theory 3(2): 102-109 (1969)
1968
2 Neil D. Jones: Classes of Automata and Transitive Closure Information and Control 13(3): 207-229 (1968)
1967
1 Neil D. Jones: Classes of Automata and Transitive Closure FOCS 1967: 296-306

Coauthor Index

1Torben Amtoft (Torben Amtoft Hansen) [42]
2Nils Andersen [55] [91]
3Amir M. Ben-Amram [72] [74] [76] [96]
4Nina Bohr [85] [93] [94]
5Anders Bondorf [44]
6Edward G. Coffman Jr. [5]
7Olivier Danvy [44]
8Carl Christian Frederiksen [80] [84]
9Harald Ganzinger [37]
10Arne J. Glenstrup [65] [79] [81] [82] [87]
11Robert Glück [58] [63]
12Carsten K. Gomard [43] [44] [48] [50] [69]
13Masami Hagiya [60]
14René Rydhof Hansen [92] [95]
15Lars Kristiansen [88] [96] [97]
16William T. Laaser [8] [11] [12]
17David Lacey [80] [84]
18Lawrence H. Landweber [14]
19Chin Soon Lee [76]
20Xavier Leroy [86]
21Y. Edmund Lien [12] [14]
22C. Michael Madsen [26]
23Kim Marriott [53]
24Torben Æ. Mogensen [44]
25Steven S. Muchnick [10] [13] [16] [21] [22] [24] [27] [31] [32]
26Markus Müller-Olm [98]
27Alan Mycroft [33] [35] [36]
28Thomas Nikolajsen [42]
29Mads Rosendahl [59] [67]
30Masahiko Sato [60]
31David A. Schmidt [25]
32Alan L. Selman [6] [7]
33Damien Sereni [89]
34Peter Sestoft [34] [38] [41] [69]
35Sven Skyum [17] [19] [23] [29]
36Harald Søndergaard [34] [38] [41] [53]
37Morten Heine Sørensen [58] [63]
38Jesper Larsson Träff [42]
39Eric Van Wyk [80] [84]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)