Neil D. Jones

	2012
111		Geoffrey William Hamilton, Neil D. Jones: Distillation with labelled transition systems. PEPM 2012: 15-24
110		Roberto Giacobazzi, Neil D. Jones, Isabella Mastroeni: Obfuscation by partial evaluation of distorted interpreters. PEPM 2012: 63-72
	2011
109		Geoff W. Hamilton, Neil D. Jones: Proving the Correctness of Unfold/Fold Program Transformations Using Bisimulation. Ershov Memorial Conference 2011: 153-169
108		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
107		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)
	2010
106		Matthias Heizmann, Neil D. Jones, Andreas Podelski: Size-Change Termination and Transition Invariants. SAS 2010: 22-50
105		Lars Hartmann, Neil D. Jones, Jakob Grue Simonsen: Programming in Biomolecular Computation. Electr. Notes Theor. Comput. Sci. 268: 97-114 (2010)
	2009
104		Neil 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
103		Neil D. Jones, Lars Kristiansen: A flow calculus of mwp-bounds for complexity analysis. ACM Trans. Comput. Log. 10(4): (2009)
	2008
102		Amir M. Ben-Amram, Neil D. Jones, Lars Kristiansen: Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time. CiE 2008: 67-76
101		Neil D. Jones, René Rydhof Hansen: CTL as an Intermediate Language. VMCAI 2008: 4
100		Neil D. Jones, Nina Bohr: Call-by-value Termination in the Untyped Lambda-calculus CoRR abs/0801.0882: (2008)
99		Neil D. Jones, Nina Bohr: Call-by-Value Termination in the Untyped lambda-Calculus. Logical Methods in Computer Science 4(1): (2008)
	2007
98		Neil D. Jones, René Rydhof Hansen: The Semantics of "Semantic Patches" in Coccinelle: Program Transformation for the Working Programmer. APLAS 2007: 303-318
97		Neil D. Jones, Nils Andersen: Flow analysis of lazy higher-order functional programs. Theor. Comput. Sci. 375(1-3): 120-136 (2007)
	2006
96		Neil D. Jones: Guest Editor's Foreword. Nord. J. Comput. 13(1-2): 1 (2006)
	2005
95		Damien Sereni, Neil D. Jones: Termination Analysis of Higher-Order Functional Programs. APLAS 2005: 281-297
94		Lars Kristiansen, Neil D. Jones: The Flow of Data and the Complexity of Algorithms. CiE 2005: 263-274
93		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)
	2004
92		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
91		Neil D. Jones, Nina Bohr: Termination Analysis of the Untyped lamba-Calculus. RTA 2004: 1-23
90		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)
89		Neil D. Jones: Transformation by interpreter specialisation. Sci. Comput. Program. 52: 307-339 (2004)
	2002
88		Neil D. Jones, Arne J. Glenstrup: Program Generation, Termination, and Binding-Time Analysis. GPCE 2002: 1-31
87		Neil D. Jones, Arne J. Glenstrup: Program generation, termination, and binding-time analysis. ICFP 2002: 283
86		David Lacey, Neil D. Jones, Eric Van Wyk, Carl Christian Frederiksen: Proving correctness of compiler optimizations by temporal logic. POPL 2002: 283-294
85		Neil D. Jones, Arne J. Glenstrup: Abstract and conclusions of PLI invited paper: program generation, termination, and binding-time analysis. PPDP 2002: 1
	2001
84		Neil D. Jones: Program Termination Analysis by Size-Change Graphs (Abstract). IJCAR 2001: 1-4
83		Neil D. Jones: Program Analysis for Implicit Computational Complexity. PADO 2001: 1
82		Chin Soon Lee, Neil D. Jones, Amir M. Ben-Amram: The size-change principle for program termination. POPL 2001: 81-92
81		Neil D. Jones: The expressive power of higher-order types or, life without CONS. J. Funct. Program. 11(1): 5-94 (2001)
	2000
80		Amir M. Ben-Amram, Neil D. Jones: Computational complexity via programming languages: constant factors do matter. Acta Inf. 37(2): 83-120 (2000)
	1999
79		Neil D. Jones: The Essence of Program Transformation by Partial Evaluation and Driving. Ershov Memorial Conference 1999: 62-79
78		Amir M. Ben-Amram, Neil D. Jones: A Precise Version of a Time Hierarchy Theorem. Fundam. Inform. 38(1-2): 1-15 (1999)
77		Neil D. Jones: EAPLS: the European Association for Programming Languages and Systems. SIGPLAN Notices 34(2): 19-20 (1999)
76		Neil D. Jones: LOGSPACE and PTIME Characterized by Programming Languages. Theor. Comput. Sci. 228(1-2): 151-174 (1999)
	1998
75		Neil D. Jones, Carsten K. Gomard, Peter Sestoft: Partial Evaluation for the Lambda Calculus. Partial Evaluation 1998: 203-220
	1997
74		Peter Lee, Fritz Henglein, Neil D. Jones: 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
73		Neil D. Jones: Computability and complexity - from a programming perspective. MIT Press 1997: I-XVI, 1-466
72		Neil D. Jones: Combining Abstract Interpretation and Partial Evaluation (Brief Overview). SAS 1997: 396-405
71		Neil D. Jones, Mads Rosendahl: Higher-Order Minimal Function Graphs. Journal of Functional and Logic Programming 1997(2): (1997)
	1996
70		Neil D. Jones: What Not to Do When Writing an Interpreter for Specialisation. Dagstuhl Seminar on Partial Evaluation 1996: 216-237
69		Arne J. Glenstrup, Neil D. Jones: BTA Algorithms to Ensure Termination of Off-Line Partial Evaluation. Ershov Memorial Conference 1996: 273-284
68		Neil D. Jones: An Introduction to Partial Evaluation. ACM Comput. Surv. 28(3): 480-503 (1996)
67		Morten Heine Sørensen, Robert Glück, Neil D. Jones: A Positive Supercompiler. J. Funct. Program. 6(6): 811-838 (1996)
	1995
66		Neil D. Jones: 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
65		Neil D. Jones: Special Address: MIX ten years after. PEPM 1995: 24-38
64		Neil D. Jones: Complexity and computability from a programming language perspective. Electr. Notes Theor. Comput. Sci. 1: 313-333 (1995)
	1994
63		Neil D. Jones, Masami Hagiya, Masahiko Sato: Logic, Language and Computation, Festschrift in Honor of Satoru Takasu Springer 1994
62		Neil D. Jones, Mads Rosendahl: Higher-Order Minimal Functional Graphs. ALP 1994: 242-252
61		Morten Heine Sørensen, Robert Glück, Neil D. Jones: Towards Unifying Partial Evaluation, Deforestation, Supercompilation, and GPC. ESOP 1994: 485-500
60		Neil D. Jones: Program Speedups in Theory and Practice. IFIP Congress (1) 1994: 595-602
59		Neil D. Jones: The Essence of Program Transformation by Partial Evaluation and Driving. Logic, Language and Computation 1994: 206-224
58		Nils Andersen, Neil D. Jones: Generalizing Cook's Transformation to Imperative Stack Programs. Results and Trends in Theoretical Computer Science 1994: 1-18
57		Neil D. Jones: Abstract Interpretation and Partial Evaluation in Functional and Logic Programming. SLP 1994: 17-22
56		Kim Marriott, Harald Søndergaard, Neil D. Jones: Denotational Abstract Interpretation of Logic Programs. ACM Trans. Program. Lang. Syst. 16(3): 607-648 (1994)
	1993
55		Neil D. Jones, Carsten K. Gomard, Peter Sestoft: Partial evaluation and automatic program generation. Prentice Hall 1993: I-XII, 1-415
54		Neil D. Jones: Constant time factors do matter. STOC 1993: 602-611
	1991
53		Neil D. Jones: Efficient Algebraic Operations on Programs. AMAST 1991: 393-420
52		Carsten K. Gomard, Neil D. Jones: A Partial Evaluator for the Untyped lambda-Calculus. J. Funct. Program. 1(1): 21-69 (1991)
51		Neil D. Jones: Foreword (Selected Papers of ESOP '90). Sci. Comput. Program. 17(1-3): 1-2 (1991)
50		Carsten K. Gomard, Neil D. Jones: Compiler Generation by Partial Evaluation: A Case Study. Structured Programming 12(3): 123-144 (1991)
49		Neil D. Jones: Static Semantics, Types, and Binding Time Analysis. Theor. Comput. Sci. 90(1): 95-118 (1991)
	1990
48		Neil D. Jones: ESOP'90, 3rd European Symposium on Programming, Copenhagen, Denmark, May 15-18, 1990, Proceedings Springer 1990
47		Neil D. Jones: Partial Evaluation, Self-Application and Types. ICALP 1990: 639-659
46		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
45		Carsten K. Gomard, Neil D. Jones: Compiler Generation by Partial Evaluation: A Case Study. IFIP Congress 1989: 1139-1144
44		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
43		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
42		Neil D. Jones: Challenging Problems in Partial Evaluation and Mixed Computation. New Generation Comput. 6(2&3): 291-302 (1988)
41		Neil D. Jones: Scientific Foreword. New Generation Comput. 6(2&3): 87-90 (1988)
	1987
40		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
	1986
39		Harald Ganzinger, Neil D. Jones: Programs as Data Objects, Proceedings of a Workshop, Copenhagen, Denmark, October 17-19, 1985 Springer 1986
38		Neil D. Jones, Alan Mycroft: Data Flow Analysis of Applicative Programs Using Minimal Function Graphs. POPL 1986: 296-306
	1985
37		Alan Mycroft, Neil D. Jones: A relational framework for abstract interpretation. Programs as Data Objects 1985: 156-171
36		Neil D. Jones, Peter Sestoft, Harald Søndergaard: An Experiment in Partial Evaluation: The Generation of a Compiler Generator. RTA 1985: 124-140
	1984
35		Neil D. Jones, Alan Mycroft: Stepwise Development of Operational and Denotational Semantics for Prolog. SLP 1984: 281-288
	1982
34		Neil D. Jones, Steven S. Muchnick: A Flexible Approach to Interprocedural Data Flow Analysis and Programs with Recursive Data Structures. POPL 1982: 66-74
33		Steven S. Muchnick, Neil D. Jones: A Fixed-Program Machine for Combinator Expression Evaluation. Symposium on LISP and Functional Programming 1982: 11-20
	1981
32		Steven S. Muchnick, Neil D. Jones: Program flow analysis - theory and applications. Prentice Hall 1981: I-XVII, 1-418
31		Neil D. Jones: Flow Analysis of Lambda Expressions (Preliminary Version). ICALP 1981: 114-128
30		Neil D. Jones, Sven Skyum: A Note on the Complexity of General D0L Membership. SIAM J. Comput. 10(1): 114-117 (1981)
	1980
29		Neil D. Jones: Semantics-Directed Compiler Generation, Proceedings of a Workshop, Aarhus, Denmark, January 14-18, 1980 Springer 1980
28		Neil D. Jones, Steven S. Muchnick: Complexity of Flow Analysis, Inductive Assertion Synthesis and a Language Due to Dijkstra FOCS 1980: 185-190
27		Neil D. Jones, C. Michael Madsen: Attribute-influenced LR parsing. Semantics-Directed Compiler Generation 1980: 393-407
26		Neil D. Jones, David A. Schmidt: Compiler generation from denotational semantics. Semantics-Directed Compiler Generation 1980: 70-93
	1979
25		Neil D. Jones, Steven S. Muchnick: Flow Analysis and Optimization of Lisp-Like Structures. POPL 1979: 244-256
24		Neil D. Jones, Sven Skyum: Complexity of Some Problems Concerning L Systems. Mathematical Systems Theory 13: 29-43 (1979)
	1978
23		Neil D. Jones, Steven S. Muchnick: TEMPO: A Unified Treatment of Binding Time and Parameter Passing Concepts in Programming Languages Springer 1978
22		Robert W. Sebesta, Neil D. Jones: Parsers for indexed grammars. International Journal of Parallel Programming 7(4): 345-359 (1978)
21		Neil 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
19		Neil 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)
16		Neil 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 SWAT (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 SWAT (FOCS) 1967: 296-306

Coauthor Index

1	Torben Amtoft (Torben Amtoft Hansen)	[44]
2	Nils Andersen	[58] [97]
3	Amir M. Ben-Amram	[78] [80] [82] [102]
4	Nina Bohr	[91] [99] [100]
5	Anders Bondorf	[46]
6	Edward G. Coffman Jr.	[5]
7	Olivier Danvy	[46]
8	Carl Christian Frederiksen	[86] [90]
9	Harald Ganzinger	[39]
10	Roberto Giacobazzi	[110]
11	Arne J. Glenstrup	[69] [85] [87] [88] [93]
12	Robert Glück	[61] [67]
13	Carsten K. Gomard	[45] [46] [50] [52] [55] [75]
14	Masami Hagiya	[63]
15	Geoff W. Hamilton (Geoff Hamilton)	[109]
16	Geoffrey William Hamilton	[111]
17	René Rydhof Hansen	[98] [101]
18	Lars Hartmann	[105] [108]
19	Matthias Heizmann	[106]
20	Fritz Henglein	[74]
21	Lars Kristiansen	[94] [102] [103]
22	William T. Laaser	[8] [11] [12]
23	David Lacey	[86] [90]
24	Lawrence H. Landweber	[14]
25	Chin Soon Lee	[82]
26	Peter Lee	[74]
27	Xavier Leroy	[92]
28	Y. Edmund Lien	[12] [14]
29	C. Michael Madsen	[27]
30	Kim Marriott	[56]
31	Isabella Mastroeni	[110]
32	Torben Æ. Mogensen	[46]
33	Steven S. Muchnick	[10] [13] [16] [21] [23] [25] [28] [32] [33] [34]
34	Markus Müller-Olm	[104] [107]
35	Alan Mycroft	[35] [37] [38]
36	Thomas Nikolajsen	[44]
37	Andreas Podelski	[106]
38	Mads Rosendahl	[62] [71]
39	Masahiko Sato	[63]
40	David A. Schmidt	[26]
41	Robert W. Sebesta	[22]
42	Alan L. Selman	[6] [7]
43	Damien Sereni	[95]
44	Peter Sestoft	[36] [40] [43] [55] [75]
45	Jakob Grue Simonsen	[105] [108]
46	Sven Skyum	[17] [19] [24] [30]
47	Harald Søndergaard	[36] [40] [43] [56]
48	Morten Heine Sørensen	[61] [67]
49	Jesper Larsson Träff	[44]
50	Søren Bjerregaard Vrist	[108]
51	Eric Van Wyk	[86] [90]

Colors in the list of coauthors

Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page