Neil D. Jones - RankMe

124 papers A* 16A 5B 9C 8Journal 48Unranked 31

Year	Rank	Type	Title / Venue / Authors
2020	—	`conf`	Cons-free Programs and Complexity Classes between LOGSPACE and PTIME. VPT/HCVS@ETAPS Neil D. Jones, Siddharth Bhaskar, Cynthia Kop, Jakob Grue Simonsen
2018	—	`conf`	On Modeling and Programming. ISoLA (1) Neil D. Jones
2017	C	`conf`	Compiling untyped lambda calculus to lower-level code by game semantics and partial evaluation (invited paper). PEPM Daniil Berezun, Neil D. Jones
2014	—	`conf`	Asymptotic Speedups, Bisimulation and Distillation (Work in Progress). Ershov Memorial Conference Neil D. Jones, Geoff W. Hamilton
2013	—	`conf`	A Swiss Pocket Knife for Computability. Festschrift for Dave Schmidt Neil D. Jones
2012	C	`conf`	Distillation with labelled transition systems. PEPM Geoffrey William Hamilton, Neil D. Jones
2012	J	`jnl`	Fifty years of the spectrum problem: survey and new results. Bull. Symb. Log. Arnaud Durand, Neil D. Jones, Johann A. Makowsky, Malika More
2012	C	`conf`	Obfuscation by partial evaluation of distorted interpreters. PEPM Roberto Giacobazzi, Neil D. Jones, Isabella Mastroeni
2011	—	`conf`	Computational Biology: A Programming Perspective. Formal Modeling: Actors, Open Systems, Biological Systems Lars Hartmann, Neil D. Jones, Jakob Grue Simonsen, Søren Bjerregaard Vrist
2011	J	`jnl`	Preface to a special section on verification, model checking, and abstract interpretation. Int. J. Softw. Tools Technol. Transf. Neil D. Jones, Markus Müller-Olm
2011	J	`jnl`	Programming in Biomolecular Computation: Programs, Self-Interpretation and Visualisation. Sci. Ann. Comput. Sci. Lars Hartmann, Neil D. Jones, Jakob Grue Simonsen, Søren Bjerregaard Vrist
2011	—	`conf`	Proving the Correctness of Unfold/Fold Program Transformations Using Bisimulation. Ershov Memorial Conference Geoff W. Hamilton, Neil D. Jones
2010	—	`conf`	Programming in Biomolecular Computation. CS2Bio Lars Hartmann, Neil D. Jones, Jakob Grue Simonsen
2010	B	`conf`	Size-Change Termination and Transition Invariants. SAS Matthias Heizmann, Neil D. Jones, Andreas Podelski
2009	J	`jnl`	A flow calculus of ACM Trans. Comput. Log. Neil D. Jones, Lars Kristiansen
2009	B	`ed.`	Verification, Model Checking, and Abstract Interpretation, 10th International Conference, VMCAI 2009, Savannah, GA, USA, January 18-20, 2009. Proceedings VMCAI Neil D. Jones, Markus Müller-Olm
2008	B	`conf`	CTL as an Intermediate Language. VMCAI Neil D. Jones, René Rydhof Hansen
2008	J	`jnl`	Call-by-Value Termination in the Untyped lambda-Calculus. Log. Methods Comput. Sci. Neil D. Jones, Nina Bohr
2008	J	`jnl`	Call-by-value Termination in the Untyped Lambda-calculus CoRR Neil D. Jones, Nina Bohr
2008	C	`conf`	Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time. CiE Amir M. Ben-Amram, Neil D. Jones, Lars Kristiansen
2007	J	`jnl`	Flow analysis of lazy higher-order functional programs. Theor. Comput. Sci. Neil D. Jones, Nils Andersen
2007	B	`conf`	The Semantics of "Semantic Patches" in Coccinelle: Program Transformation for the Working Programmer. APLAS Neil D. Jones, René Rydhof Hansen
2006	J	`jnl`	Guest Editor's Foreword. Nord. J. Comput. Neil D. Jones
2006	J	`jnl`	Redundant Call Elimination via Tupling. Fundam. Informaticae Wei-Ngan Chin, Siau-Cheng Khoo, Neil D. Jones
2005	B	`conf`	Termination Analysis of Higher-Order Functional Programs. APLAS Damien Sereni, Neil D. Jones
2005	J	`jnl`	Termination analysis and specialization-point insertion in offline partial evaluation. ACM Trans. Program. Lang. Syst. Arne J. Glenstrup, Neil D. Jones
2005	C	`conf`	The Flow of Data and the Complexity of Algorithms. CiE Lars Kristiansen, Neil D. Jones
2004	J	`jnl`	Compiler Optimization Correctness by Temporal Logic. High. Order Symb. Comput. David Lacey, Neil D. Jones, Eric Van Wyk, Carl Christian Frederiksen
2004	A*	`ed.`	Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2004, Venice, Italy, January 14-16, 2004 POPL Neil D. Jones, Xavier Leroy
2004	—	`conf`	Termination Analysis of the Untyped lamba-Calculus. RTA Neil D. Jones, Nina Bohr
2004	J	`jnl`	Transformation by interpreter specialisation. Sci. Comput. Program. Neil D. Jones
2002	C	`conf`	Abstract and conclusions of PLI invited paper: program generation, termination, and binding-time analysis. PPDP Neil D. Jones, Arne J. Glenstrup
2002	B	`conf`	Program Generation, Termination, and Binding-Time Analysis. GPCE Neil D. Jones, Arne J. Glenstrup
2002	A	`conf`	Program generation, termination, and binding-time analysis. ICFP Neil D. Jones, Arne J. Glenstrup
2002	A*	`conf`	Proving correctness of compiler optimizations by temporal logic. POPL David Lacey, Neil D. Jones, Eric Van Wyk, Carl Christian Frederiksen
2001	—	`conf`	Program Analysis for Implicit Computational Complexity. PADO Neil D. Jones
2001	A	`conf`	Program Termination Analysis by Size-Change Graphs (Abstract). IJCAR Neil D. Jones
2001	J	`jnl`	The expressive power of higher-order types or, life without CONS. J. Funct. Program. Neil D. Jones
2001	A*	`conf`	The size-change principle for program termination. POPL Chin Soon Lee, Neil D. Jones, Amir M. Ben-Amram
2000	J	`jnl`	Computational complexity via programming languages: constant factors do matter. Acta Informatica Amir M. Ben-Amram, Neil D. Jones
1999	J	`jnl`	A Precise Version of a Time Hierarchy Theorem. Fundam. Informaticae Amir M. Ben-Amram, Neil D. Jones
1999	J	`jnl`	EAPLS: the European Association for Programming Languages and Systems. ACM SIGPLAN Notices Neil D. Jones
1999	J	`jnl`	LOGSPACE and PTIME Characterized by Programming Languages. Theor. Comput. Sci. Neil D. Jones
1999	—	`conf`	The Essence of Program Transformation by Partial Evaluation and Driving. Ershov Memorial Conference Neil D. Jones
1998	—	`conf`	Partial Evaluation for the Lambda Calculus. Partial Evaluation Neil D. Jones, Carsten K. Gomard, Peter Sestoft
1997	B	`conf`	Combining Abstract Interpretation and Partial Evaluation (Brief Overview). SAS Neil D. Jones
1997	—	`book`	Computability and complexity - from a programming perspective. Neil D. Jones
1997	A*	`ed.`	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 POPL Peter Lee, Fritz Henglein, Neil D. Jones
1997	J	`jnl`	Higher-Order Minimal Function Graphs. J. Funct. Log. Program. Neil D. Jones, Mads Rosendahl
1996	J	`jnl`	A Positive Supercompiler. J. Funct. Program. Morten Heine Sørensen, Robert Glück, Neil D. Jones
1996	J	`jnl`	An Introduction to Partial Evaluation. ACM Comput. Surv. Neil D. Jones
1996	—	`conf`	BTA Algorithms to Ensure Termination of Off-Line Partial Evaluation. Ershov Memorial Conference Arne J. Glenstrup, Neil D. Jones
1996	—	`conf`	What Not to Do When Writing an Interpreter for Specialisation. Dagstuhl Seminar on Partial Evaluation Neil D. Jones
1995	B	`conf`	Complexity and computability from a programming language perspective. MFPS Neil D. Jones
1995	C	`ed.`	Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, La Jolla, California, USA, June 21-23, 1995 PEPM Neil D. Jones
1995	C	`conf`	Special Address: MIX ten years after. PEPM Neil D. Jones
1994	—	`conf`	Abstract Interpretation and Partial Evaluation in Functional and Logic Programming. ILPS Neil D. Jones
1994	J	`jnl`	Denotational Abstract Interpretation of Logic Programs. ACM Trans. Program. Lang. Syst. Kim Marriott, Harald Søndergaard, Neil D. Jones
1994	—	`conf`	Generalizing Cook's Transformation to Imperative Stack Programs. Results and Trends in Theoretical Computer Science Nils Andersen, Neil D. Jones
1994	—	`conf`	Higher-Order Minimal Functional Graphs. ALP Neil D. Jones, Mads Rosendahl
1994	—	`ed.`	Logic, Language and Computation, Festschrift in Honor of Satoru Takasu Logic, Language and Computation Neil D. Jones, Masami Hagiya, Masahiko Sato
1994	—	`conf`	Program Speedups in Theory and Practice. IFIP Congress (1) Neil D. Jones
1994	—	`conf`	The Essence of Program Transformation by Partial Evaluation and Driving. Logic, Language and Computation Neil D. Jones
1994	A	`conf`	Towards Unifying Partial Evaluation, Deforestation, Supercompilation, and GPC. ESOP Morten Heine Sørensen, Robert Glück, Neil D. Jones
1993	A*	`conf`	Constant time factors do matter. STOC Neil D. Jones
1993	—	`book`	Partial evaluation and automatic program generation. Neil D. Jones, Carsten K. Gomard, Peter Sestoft
1991	J	`jnl`	A Partial Evaluator for the Untyped lambda-Calculus. J. Funct. Program. Carsten K. Gomard, Neil D. Jones
1991	J	`jnl`	Compiler Generation by Partial Evaluation: A Case Study. Struct. Program. Carsten K. Gomard, Neil D. Jones
1991	—	`conf`	Efficient Algebraic Operations on Programs. AMAST Neil D. Jones
1991	J	`jnl`	Foreword (Selected Papers of ESOP '90). Sci. Comput. Program. Neil D. Jones
1991	J	`jnl`	Static Semantics, Types, and Binding Time Analysis. Theor. Comput. Sci. Neil D. Jones
1990	—	`conf`	A Self-Applicable Partial Evaluator for the Lambda Calculus. ICCL Neil D. Jones, Carsten K. Gomard, Anders Bondorf, Olivier Danvy, Torben Æ. Mogensen
1990	A	`ed.`	ESOP'90, 3rd European Symposium on Programming, Copenhagen, Denmark, May 15-18, 1990, Proceedings ESOP Neil D. Jones
1990	A*	`conf`	Partial Evaluation, Self-Application and Types. ICALP Neil D. Jones
1989	—	`conf`	Compiler Generation by Partial Evaluation: A Case Study. IFIP Congress Carsten K. Gomard, Neil D. Jones
1989	—	`conf`	Experiments with Implementations of Two Theoretical Constructions. Logic at Botik Torben Amtoft Hansen, Thomas Nikolajsen, Jesper Larsson Träff, Neil D. Jones
1989	J	`jnl`	Mix: A Self-Applicable Partial Evaluator for Experiments in Compiler Generation. LISP Symb. Comput. Neil D. Jones, Peter Sestoft, Harald Søndergaard
1988	J	`jnl`	Challenging Problems in Partial Evaluation and Mixed Computation. New Gener. Comput. Neil D. Jones
1988	J	`jnl`	Scientific Foreword. New Gener. Comput. Neil D. Jones
1987	B	`conf`	MIX: A Self-Applicable Partial Evaluator for Experiments in Compiler Generation (Extended Abstract). MFPS Neil D. Jones, Peter Sestoft, Harald Søndergaard
1986	A*	`conf`	Data Flow Analysis of Applicative Programs Using Minimal Function Graphs. POPL Neil D. Jones, Alan Mycroft
1986	—	`ed.`	Programs as Data Objects, Proceedings of a Workshop, Copenhagen, Denmark, October 17-19, 1985 Programs as Data Objects Harald Ganzinger, Neil D. Jones
1985	—	`conf`	A relational framework for abstract interpretation. Programs as Data Objects Alan Mycroft, Neil D. Jones
1985	—	`conf`	An Experiment in Partial Evaluation: The Generation of a Compiler Generator. RTA Neil D. Jones, Peter Sestoft, Harald Søndergaard
1985	J	`jnl`	An experiment in partial evaluation: the generation of a compiler generator. ACM SIGPLAN Notices Neil D. Jones, Peter Sestoft, Harald Søndergaard
1984	J	`jnl`	A method for detecting structure in polyhedra. Pattern Recognit. Lett. Peter Johansen, Neil D. Jones, Jens Clausen
1984	—	`conf`	Stepwise Development of Operational and Denotational Semantics for Prolog. SLP Neil D. Jones, Alan Mycroft
1982	—	`conf`	A Fixed-Program Machine for Combinator Expression Evaluation. Symposium on LISP and Functional Programming Steven S. Muchnick, Neil D. Jones
1982	A*	`conf`	A Flexible Approach to Interprocedural Data Flow Analysis and Programs with Recursive Data Structures. POPL Neil D. Jones, Steven S. Muchnick
1982	—	`conf`	Control Flow Treatment in a Simple Semantics-Directed Compiler Generator. Formal Description of Programming Concepts Henning Christiansen, Neil D. Jones
1981	J	`jnl`	A Note on the Complexity of General D0L Membership. SIAM J. Comput. Neil D. Jones, Sven Skyum
1981	A*	`conf`	Flow Analysis of Lambda Expressions (Preliminary Version). ICALP Neil D. Jones
1981	—	`book`	Program flow analysis - theory and applications. Steven S. Muchnick, Neil D. Jones
1980	—	`conf`	Attribute-influenced LR parsing. Semantics-Directed Compiler Generation Neil D. Jones, C. Michael Madsen
1980	—	`conf`	Compiler generation from denotational semantics. Semantics-Directed Compiler Generation Neil D. Jones, David A. Schmidt
1980	A*	`conf`	Complexity of Flow Analysis, Inductive Assertion Synthesis and a Language Due to Dijkstra FOCS Neil D. Jones, Steven S. Muchnick
1980	—	`ed.`	Semantics-Directed Compiler Generation, Proceedings of a Workshop, Aarhus, Denmark, January 14-18, 1980 Semantics-Directed Compiler Generation Neil D. Jones
1979	J	`jnl`	Complexity of Some Problems Concerning L Systems. Math. Syst. Theory Neil D. Jones, Sven Skyum
1979	A*	`conf`	Flow Analysis and Optimization of Lisp-Like Structures. POPL Neil D. Jones, Steven S. Muchnick
1978	J	`jnl`	Corrigendum: Context Free Languages and Rudimentary Attributes. Math. Syst. Theory Neil D. Jones
1978	J	`jnl`	Parsers for indexed grammars. Int. J. Parallel Program. Robert W. Sebesta, Neil D. Jones
1978	—	`book`	TEMPO: A Unified Treatment of Binding Time and Parameter Passing Concepts in Programming Languages Neil D. Jones, Steven S. Muchnick
1978	J	`jnl`	The Complexity of Finite Memory Programs with Recursion. J. ACM Neil D. Jones, Steven S. Muchnick
1977	J	`jnl`	A Note on Linear Time Simulation of Deterministic Two-Way Pushdown Automata. Inf. Process. Lett. Neil D. Jones
1977	A*	`conf`	Complexity of Some Problems Concerning L Systems. ICALP Neil D. Jones, Sven Skyum
1977	J	`jnl`	Complexity of Some Problems in Petri Nets. Theor. Comput. Sci. Neil D. Jones, Lawrence H. Landweber, Y. Edmund Lien
1977	J	`jnl`	Corrigendum: Space-Bounded Reducibility among Combinatorial Problems. J. Comput. Syst. Sci. Neil D. Jones
1977	J	`jnl`	Even Simple Programs Are Hard To Analyze. J. ACM Neil D. Jones, Steven S. Muchnick
1977	J	`jnl`	Recognition of Deterministic ETOL Languages in Logarathimic Space Inf. Control. Neil D. Jones, Sven Skyum
1976	A*	`conf`	Binding Time Optimization in Programming Languages: Some Thoughts Toward the Design of an Ideal Language. POPL Neil D. Jones, Steven S. Muchnick
1976	J	`jnl`	Complete Problems for Deterministic Polynomial Time. Theor. Comput. Sci. Neil D. Jones, William T. Laaser
1976	J	`jnl`	New Problems Complete for Nondeterministic Loc Space. Math. Syst. Theory Neil D. Jones, Y. Edmund Lien, William T. Laaser
1975	A*	`conf`	Even Simple Programs are Hard to Analyze. POPL Neil D. Jones, Steven S. Muchnick
1975	J	`jnl`	Space-Bounded Reducibility among Combinatorial Problems. J. Comput. Syst. Sci. Neil D. Jones
1974	A*	`conf`	Complete Problems for Deterministic Polynomial Time STOC Neil D. Jones, William T. Laaser
1974	J	`jnl`	Turing Machines and the Spectra of First-Order Formulas. J. Symb. Log. Neil D. Jones, Alan L. Selman
1973	A	`conf`	Discrete structures in the undergraduate computer science curriculum. SIGCSE Gerald L. Engel, Neil D. Jones
1972	A*	`conf`	Turing Machines and the Spectra of First-Order Formulas with Equality STOC Neil D. Jones, Alan L. Selman
1971	J	`jnl`	Automata: a teaching aid for mathematical machines. ACM SIGCSE Bull. Lawrence L. Rose, Neil D. Jones, Bruce H. Barnes
1971	—	`conf`	Priority Paging Algorithms and the Extension Problem SWAT Edward G. Coffman Jr., Neil D. Jones
1970	J	`jnl`	A Note on the Index of a Context-Free Language Inf. Control. Neil D. Jones
1969	J	`jnl`	Context-Free Languages and Rudimentary Attributes. Math. Syst. Theory Neil D. Jones
1968	J	`jnl`	Classes of Automata and Transitive Closure Inf. Control. Neil D. Jones
1967	—	`conf`	Classes of Automata and Transitive Closure SWAT Neil D. Jones