Search the dblp DataBase
Neil D. Jones :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Neil D. Jones , William T. Laaser Complete Problems for Deterministic Polynomial Time. [Citation Graph (3, 0)][DBLP ] Theor. Comput. Sci., 1976, v:3, n:1, pp:105-117 [Journal ] Neil D. Jones Space-Bounded Reducibility among Combinatorial Problems. [Citation Graph (2, 0)][DBLP ] J. Comput. Syst. Sci., 1975, v:11, n:1, pp:68-85 [Journal ] Neil D. Jones , Lawrence H. Landweber , Y. Edmund Lien Complexity of Some Problems in Petri Nets. [Citation Graph (2, 0)][DBLP ] Theor. Comput. Sci., 1977, v:4, n:3, pp:277-299 [Journal ] Kim Marriott , Harald Søndergaard , Neil D. Jones Denotational Abstract Interpretation of Logic Programs. [Citation Graph (1, 0)][DBLP ] ACM Trans. Program. Lang. Syst., 1994, v:16, n:3, pp:607-648 [Journal ] Neil D. Jones , Mads Rosendahl Higher-Order Minimal Functional Graphs. [Citation Graph (0, 0)][DBLP ] ALP, 1994, pp:242-252 [Conf ] Neil D. Jones Efficient Algebraic Operations on Programs. [Citation Graph (0, 0)][DBLP ] AMAST, 1991, pp:393-420 [Conf ] Damien Sereni , Neil D. Jones Termination Analysis of Higher-Order Functional Programs. [Citation Graph (0, 0)][DBLP ] APLAS, 2005, pp:281-297 [Conf ] Nils Andersen , Neil D. Jones Generalizing Cook's Transformation to Imperative Stack Programs. [Citation Graph (0, 0)][DBLP ] Results and Trends in Theoretical Computer Science, 1994, pp:1-18 [Conf ] Neil D. Jones The Essence of Program Transformation by Partial Evaluation and Driving. [Citation Graph (0, 0)][DBLP ] Logic, Language and Computation, 1994, pp:206-224 [Conf ] Neil D. Jones Program Termination Analysis by Size-Change Graphs (Abstract). [Citation Graph (0, 0)][DBLP ] IJCAR, 2001, pp:1-4 [Conf ] Neil D. Jones , C. Michael Madsen Attribute-influenced LR parsing. [Citation Graph (0, 0)][DBLP ] Semantics-Directed Compiler Generation, 1980, pp:393-407 [Conf ] Neil D. Jones , David A. Schmidt Compiler generation from denotational semantics. [Citation Graph (0, 0)][DBLP ] Semantics-Directed Compiler Generation, 1980, pp:70-93 [Conf ] Lars Kristiansen , Neil D. Jones The Flow of Data and the Complexity of Algorithms. [Citation Graph (0, 0)][DBLP ] CiE, 2005, pp:263-274 [Conf ] Neil D. Jones What Not to Do When Writing an Interpreter for Specialisation. [Citation Graph (0, 0)][DBLP ] Dagstuhl Seminar on Partial Evaluation, 1996, pp:216-237 [Conf ] Neil D. Jones The Essence of Program Transformation by Partial Evaluation and Driving. [Citation Graph (0, 0)][DBLP ] Ershov Memorial Conference, 1999, pp:62-79 [Conf ] Arne J. Glenstrup , Neil D. Jones BTA Algorithms to Ensure Termination of Off-Line Partial Evaluation. [Citation Graph (0, 0)][DBLP ] Ershov Memorial Conference, 1996, pp:273-284 [Conf ] Torben Amtoft Hansen , Thomas Nikolajsen , Jesper Larsson Träff , Neil D. Jones Experiments with Implementations of Two Theoretical Constructions. [Citation Graph (0, 0)][DBLP ] Logic at Botik, 1989, pp:119-133 [Conf ] Morten Heine Sørensen , Robert Glück , Neil D. Jones Towards Unifying Partial Evaluation, Deforestation, Supercompilation, and GPC. [Citation Graph (0, 0)][DBLP ] ESOP, 1994, pp:485-500 [Conf ] Edward G. Coffman Jr. , Neil D. Jones Priority Paging Algorithms and the Extension Problem [Citation Graph (0, 0)][DBLP ] FOCS, 1971, pp:177-181 [Conf ] Neil D. Jones Classes of Automata and Transitive Closure [Citation Graph (0, 0)][DBLP ] FOCS, 1967, pp:296-306 [Conf ] Neil D. Jones , Steven S. Muchnick Complexity of Flow Analysis, Inductive Assertion Synthesis and a Language Due to Dijkstra [Citation Graph (0, 0)][DBLP ] FOCS, 1980, pp:185-190 [Conf ] Neil D. Jones , Arne J. Glenstrup Program Generation, Termination, and Binding-Time Analysis. [Citation Graph (0, 0)][DBLP ] GPCE, 2002, pp:1-31 [Conf ] Neil D. Jones Flow Analysis of Lambda Expressions (Preliminary Version). [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:114-128 [Conf ] Neil D. Jones Partial Evaluation, Self-Application and Types. [Citation Graph (0, 0)][DBLP ] ICALP, 1990, pp:639-659 [Conf ] Neil D. Jones , Sven Skyum Complexity of Some Problems Concerning L Systems. [Citation Graph (0, 0)][DBLP ] ICALP, 1977, pp:301-308 [Conf ] Neil D. Jones , Carsten K. Gomard , Anders Bondorf , Olivier Danvy , Torben Æ. Mogensen A Self-Applicable Partial Evaluator for the Lambda Calculus. [Citation Graph (0, 0)][DBLP ] ICCL, 1990, pp:49-58 [Conf ] Neil D. Jones , Arne J. Glenstrup Program generation, termination, and binding-time analysis. [Citation Graph (0, 0)][DBLP ] ICFP, 2002, pp:283- [Conf ] Carsten K. Gomard , Neil D. Jones Compiler Generation by Partial Evaluation: A Case Study. [Citation Graph (0, 0)][DBLP ] IFIP Congress, 1989, pp:1139-1144 [Conf ] Neil D. Jones Program Speedups in Theory and Practice. [Citation Graph (0, 0)][DBLP ] IFIP Congress (1), 1994, pp:595-602 [Conf ] Steven S. Muchnick , Neil D. Jones A Fixed-Program Machine for Combinator Expression Evaluation. [Citation Graph (0, 0)][DBLP ] Symposium on LISP and Functional Programming, 1982, pp:11-20 [Conf ] Neil D. Jones , Peter Sestoft , Harald Søndergaard MIX: A Self-Applicable Partial Evaluator for Experiments in Compiler Generation (Extended Abstract). [Citation Graph (0, 0)][DBLP ] MFPS, 1987, pp:386-413 [Conf ] Neil D. Jones Program Analysis for Implicit Computational Complexity. [Citation Graph (0, 0)][DBLP ] PADO, 2001, pp:1- [Conf ] Alan Mycroft , Neil D. Jones A relational framework for abstract interpretation. [Citation Graph (0, 0)][DBLP ] Programs as Data Objects, 1985, pp:156-171 [Conf ] Neil D. Jones Special Address: MIX ten years after. [Citation Graph (0, 0)][DBLP ] PEPM, 1995, pp:24-38 [Conf ] Neil D. Jones , Carsten K. Gomard , Peter Sestoft Partial Evaluation for the Lambda Calculus. [Citation Graph (0, 0)][DBLP ] Partial Evaluation, 1998, pp:203-220 [Conf ] David Lacey , Neil D. Jones , Eric Van Wyk , Carl Christian Frederiksen Proving correctness of compiler optimizations by temporal logic. [Citation Graph (0, 0)][DBLP ] POPL, 2002, pp:283-294 [Conf ] Neil D. Jones , Steven S. Muchnick Even Simple Programs are Hard to Analyze. [Citation Graph (0, 0)][DBLP ] POPL, 1975, pp:106-118 [Conf ] Neil D. Jones , Steven S. Muchnick Binding Time Optimization in Programming Languages: Some Thoughts Toward the Design of an Ideal Language. [Citation Graph (0, 0)][DBLP ] POPL, 1976, pp:77-94 [Conf ] Neil D. Jones , Steven S. Muchnick Flow Analysis and Optimization of Lisp-Like Structures. [Citation Graph (0, 0)][DBLP ] POPL, 1979, pp:244-256 [Conf ] Neil D. Jones , Steven S. Muchnick A Flexible Approach to Interprocedural Data Flow Analysis and Programs with Recursive Data Structures. [Citation Graph (0, 0)][DBLP ] POPL, 1982, pp:66-74 [Conf ] Neil D. Jones , Alan Mycroft Data Flow Analysis of Applicative Programs Using Minimal Function Graphs. [Citation Graph (0, 0)][DBLP ] POPL, 1986, pp:296-306 [Conf ] Chin Soon Lee , Neil D. Jones , Amir M. Ben-Amram The size-change principle for program termination. [Citation Graph (0, 0)][DBLP ] POPL, 2001, pp:81-92 [Conf ] Neil D. Jones , Arne J. Glenstrup Abstract and conclusions of PLI invited paper: program generation, termination, and binding-time analysis. [Citation Graph (0, 0)][DBLP ] PPDP, 2002, pp:1- [Conf ] Neil D. Jones , Nina Bohr Termination Analysis of the Untyped lamba-Calculus. [Citation Graph (0, 0)][DBLP ] RTA, 2004, pp:1-23 [Conf ] Neil D. Jones , Peter Sestoft , Harald Søndergaard An Experiment in Partial Evaluation: The Generation of a Compiler Generator. [Citation Graph (0, 0)][DBLP ] RTA, 1985, pp:124-140 [Conf ] Neil D. Jones Combining Abstract Interpretation and Partial Evaluation (Brief Overview). [Citation Graph (0, 0)][DBLP ] SAS, 1997, pp:396-405 [Conf ] Neil D. Jones Abstract Interpretation and Partial Evaluation in Functional and Logic Programming. [Citation Graph (0, 0)][DBLP ] SLP, 1994, pp:17-22 [Conf ] Neil D. Jones , Alan Mycroft Stepwise Development of Operational and Denotational Semantics for Prolog. [Citation Graph (0, 0)][DBLP ] SLP, 1984, pp:281-288 [Conf ] Neil D. Jones Constant time factors do matter. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:602-611 [Conf ] Neil D. Jones , William T. Laaser Complete Problems for Deterministic Polynomial Time [Citation Graph (0, 0)][DBLP ] STOC, 1974, pp:40-46 [Conf ] Neil D. Jones , Alan L. Selman Turing Machines and the Spectra of First-Order Formulas with Equality [Citation Graph (0, 0)][DBLP ] STOC, 1972, pp:157-167 [Conf ] Amir M. Ben-Amram , Neil D. Jones Computational complexity via programming languages: constant factors do matter. [Citation Graph (0, 0)][DBLP ] Acta Inf., 2000, v:37, n:2, pp:83-120 [Journal ] Neil D. Jones An Introduction to Partial Evaluation. [Citation Graph (0, 0)][DBLP ] ACM Comput. Surv., 1996, v:28, n:3, pp:480-503 [Journal ] Neil D. Jones Complexity and computability from a programming language perspective. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 1995, v:1, n:, pp:- [Journal ] Amir M. Ben-Amram , Neil D. Jones A Precise Version of a Time Hierarchy Theorem. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 1999, v:38, n:1-2, pp:1-15 [Journal ] Neil D. Jones Classes of Automata and Transitive Closure [Citation Graph (0, 0)][DBLP ] Information and Control, 1968, v:13, n:3, pp:207-229 [Journal ] Neil D. Jones A Note on the Index of a Context-Free Language [Citation Graph (0, 0)][DBLP ] Information and Control, 1970, v:16, n:2, pp:201-202 [Journal ] Neil D. Jones , Sven Skyum Recognition of Deterministic ETOL Languages in Logarathimic Space [Citation Graph (0, 0)][DBLP ] Information and Control, 1977, v:35, n:3, pp:177-181 [Journal ] Neil D. Jones A Note on Linear Time Simulation of Deterministic Two-Way Pushdown Automata. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1977, v:6, n:4, pp:110-112 [Journal ] Neil D. Jones , Steven S. Muchnick Even Simple Programs Are Hard To Analyze. [Citation Graph (0, 0)][DBLP ] J. ACM, 1977, v:24, n:2, pp:338-350 [Journal ] Neil D. Jones , Steven S. Muchnick The Complexity of Finite Memory Programs with Recursion. [Citation Graph (0, 0)][DBLP ] J. ACM, 1978, v:25, n:2, pp:312-321 [Journal ] Neil D. Jones Corrigendum: Space-Bounded Reducibility among Combinatorial Problems. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1977, v:15, n:2, pp:241- [Journal ] Neil D. Jones , Mads Rosendahl Higher-Order Minimal Function Graphs. [Citation Graph (0, 0)][DBLP ] Journal of Functional and Logic Programming, 1997, v:1997, n:2, pp:- [Journal ] Carsten K. Gomard , Neil D. Jones A Partial Evaluator for the Untyped lambda-Calculus. [Citation Graph (0, 0)][DBLP ] J. Funct. Program., 1991, v:1, n:1, pp:21-69 [Journal ] Neil D. Jones The expressive power of higher-order types or, life without CONS. [Citation Graph (0, 0)][DBLP ] J. Funct. Program., 2001, v:11, n:1, pp:5-94 [Journal ] Morten Heine Sørensen , Robert Glück , Neil D. Jones A Positive Supercompiler. [Citation Graph (0, 0)][DBLP ] J. Funct. Program., 1996, v:6, n:6, pp:811-838 [Journal ] Neil D. Jones , Alan L. Selman Turing Machines and the Spectra of First-Order Formulas. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1974, v:39, n:1, pp:139-150 [Journal ] David Lacey , Neil D. Jones , Eric Van Wyk , Carl Christian Frederiksen Compiler Optimization Correctness by Temporal Logic. [Citation Graph (0, 0)][DBLP ] Higher-Order and Symbolic Computation, 2004, v:17, n:3, pp:173-206 [Journal ] Neil D. Jones , Peter Sestoft , Harald Søndergaard Mix: A Self-Applicable Partial Evaluator for Experiments in Compiler Generation. [Citation Graph (0, 0)][DBLP ] Lisp and Symbolic Computation, 1989, v:2, n:1, pp:9-50 [Journal ] Neil D. Jones Context-Free Languages and Rudimentary Attributes. [Citation Graph (0, 0)][DBLP ] Mathematical Systems Theory, 1969, v:3, n:2, pp:102-109 [Journal ] Neil D. Jones Corrigendum: Context Free Languages and Rudimentary Attributes. [Citation Graph (0, 0)][DBLP ] Mathematical Systems Theory, 1978, v:11, n:, pp:379-380 [Journal ] Neil D. Jones , Y. Edmund Lien , William T. Laaser New Problems Complete for Nondeterministic Loc Space. [Citation Graph (0, 0)][DBLP ] Mathematical Systems Theory, 1976, v:10, n:, pp:1-17 [Journal ] Neil D. Jones , Sven Skyum Complexity of Some Problems Concerning L Systems. [Citation Graph (0, 0)][DBLP ] Mathematical Systems Theory, 1979, v:13, n:, pp:29-43 [Journal ] Neil D. Jones Scientific Foreword. [Citation Graph (0, 0)][DBLP ] New Generation Comput., 1988, v:6, n:2&3, pp:87-90 [Journal ] Neil D. Jones Challenging Problems in Partial Evaluation and Mixed Computation. [Citation Graph (0, 0)][DBLP ] New Generation Comput., 1988, v:6, n:2&3, pp:291-302 [Journal ] Neil D. Jones Transformation by interpreter specialisation. [Citation Graph (0, 0)][DBLP ] Sci. Comput. Program., 2004, v:52, n:, pp:307-339 [Journal ] Neil D. Jones Foreword (Selected Papers of ESOP '90). [Citation Graph (0, 0)][DBLP ] Sci. Comput. Program., 1991, v:17, n:1-3, pp:1-2 [Journal ] Neil D. Jones , Sven Skyum A Note on the Complexity of General D0L Membership. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1981, v:10, n:1, pp:114-117 [Journal ] Neil D. Jones EAPLS: the European Association for Programming Languages and Systems. [Citation Graph (0, 0)][DBLP ] SIGPLAN Notices, 1999, v:34, n:2, pp:19-20 [Journal ] Carsten K. Gomard , Neil D. Jones Compiler Generation by Partial Evaluation: A Case Study. [Citation Graph (0, 0)][DBLP ] Structured Programming, 1991, v:12, n:3, pp:123-144 [Journal ] Neil D. Jones Static Semantics, Types, and Binding Time Analysis. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1991, v:90, n:1, pp:95-118 [Journal ] Neil D. Jones LOGSPACE and PTIME Characterized by Programming Languages. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1999, v:228, n:1-2, pp:151-174 [Journal ] Neil D. Jones , Nils Andersen Flow analysis of lazy higher-order functional programs. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:375, n:1-3, pp:120-136 [Journal ] Arne J. Glenstrup , Neil D. Jones Termination analysis and specialization-point insertion in offline partial evaluation. [Citation Graph (0, 0)][DBLP ] ACM Trans. Program. Lang. Syst., 2005, v:27, n:6, pp:1147-1215 [Journal ] The Semantics of "Semantic Patches" in Coccinelle: Program Transformation for the Working Programmer. [Citation Graph (, )][DBLP ] Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time. [Citation Graph (, )][DBLP ] Size-Change Termination and Transition Invariants. [Citation Graph (, )][DBLP ] CTL as an Intermediate Language. [Citation Graph (, )][DBLP ] Call-by-value Termination in the Untyped Lambda-calculus [Citation Graph (, )][DBLP ] Search in 0.007secs, Finished in 0.422secs