How to Extend Partial Deduction to Derive the KMP String-Matching Algorithm from a Naive Specification (Poster Abstract)

NTA +nextState() AbstractDFRTA +nextState() AbstractSPA

[1]  Christoph M. Hoffmann,et al.  Pattern Matching in Trees , 1982, JACM.

[2]  Stephen Warshall,et al.  A Theorem on Boolean Matrices , 1962, JACM.

[3]  Denis Lugiez,et al.  Tree Automata Help One To Solve Equational Formulae In AC-Theories , 1994, J. Symb. Comput..

[4]  Hubert Comon,et al.  Tree automata techniques and applications , 1997 .

[5]  Reinhard Wilhelm,et al.  Table compression for tree automata , 1991, TOPL.

[6]  Bruce W. Watson,et al.  A Boyer-Moore (or Watson-Watson) Type Algorithm for Regular Tree Pattern Matching , 1997, Stringology.

[7]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

[8]  Dhananjay M. Dhamdhere,et al.  Efficient Retargetable Code Generation Using Bottom-up Tree Pattern Matching , 1990, Comput. Lang..

[9]  Richard Cole,et al.  Tree pattern matching and subset matching in randomized O(nlog3m) time , 1997, STOC '97.

[10]  K. Vijay-Shanker,et al.  Deterministic Left to Right Parsing of Tree Adjoining Languages , 1990, ACL.

[11]  William C. Rounds,et al.  Context-free grammars on trees , 1969, STOC.

[12]  Donald E. Knuth,et al.  Fast Pattern Matching in Strings , 1977, SIAM J. Comput..

[13]  Anoop Sarkar,et al.  Incremental Parser Generation for Tree Adjoining Grammars , 1996, ACL.

[14]  Peter Linz,et al.  An Introduction to Formal Languages and Automata , 1997 .

[15]  William C. Rounds,et al.  Tree-oriented proofs of some theorems on context-free and indexed languages , 1970, STOC.

[16]  J.P.H.W. van den Eijnde,et al.  Program derivation in acyclic graphs and related problems , 1992 .

[17]  Y. M. van Dinther,et al.  De systematische afleiding van acceptoren en ontleders voor boom-grammatica's , 1987 .

[18]  Alfred V. Aho,et al.  Efficient Tree Pattern Matching: An Aid to Code Generation. , 1985 .

[19]  Reinhard Wilhelm,et al.  Tree automata for code selection , 1994, Acta Informatica.

[20]  Zvi Galil,et al.  Faster tree pattern matching , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[21]  Joost-Pieter Katoen,et al.  Bottum-up tree acceptors , 1988 .

[22]  Robert E. Tarjan,et al.  More Efficient Bottom-Up Tree Pattern Matching , 1990, CAAP.

[23]  P K Turner,et al.  Up-down parsing with prefix grammars , 1986, SIGP.

[24]  Hans H. Kron,et al.  Tree templates and subtree transformational grammars. , 1975 .

[25]  Walter S. Brainerd,et al.  Tree Generating Regular Systems , 1969, Inf. Control..

[26]  S. Rao Kosaraju,et al.  Efficient tree pattern matching , 1989, 30th Annual Symposium on Foundations of Computer Science.

[27]  Walter S. Brainerd,et al.  The Minimalization of Tree Automata , 1968, Inf. Control..

[28]  John Doner,et al.  Tree Acceptors and Some of Their Applications , 1970, J. Comput. Syst. Sci..

[29]  Thomas W. Christopher,et al.  High-quality code generation via bottom-up tree pattern matching , 1986, POPL '86.

[30]  Alfred V. Aho,et al.  Code generation using tree matching and dynamic programming , 1989, ACM Trans. Program. Lang. Syst..

[31]  Gerard Zwaan,et al.  A Taxonomy of Sublinear Multiple Keyword Pattern Matching Algorithms , 1996, Sci. Comput. Program..

[32]  Helmut Emmelmann,et al.  BEG: a generator for efficient back ends , 1989, PLDI '89.

[33]  Michael J. O'Donnell,et al.  Equational Logic as a Programming Language. , 1987 .

[34]  I. V. Ramakrishnan,et al.  Nonlinear Pattern Matching in Trees , 1988, ICALP.

[35]  Manfred Broy,et al.  Program Construction by Transformations: A Family Tree of Sorting Programs , 1983 .

[36]  Robert Giegerich,et al.  A Declarative Approach to the Development of Dynamic Programming Algorithms, Applied to RNA Folding , 1998 .

[37]  Walter Scott Brainerd,et al.  TREE GENERATING SYSTEMS AND TREE AUTOMATA , 1967 .

[38]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[39]  Kaizhong Zhang,et al.  Comparing multiple RNA secondary structures using tree comparisons , 1990, Comput. Appl. Biosci..

[40]  Arie van Deursen,et al.  Little languages: little maintenance , 1998 .

[41]  Ralph Johnson,et al.  design patterns elements of reusable object oriented software , 2019 .

[42]  Robert S. Boyer,et al.  A fast string searching algorithm , 1977, CACM.

[43]  Reinhard Wilhelm,et al.  Two Tree Pattern Matchers for Code Selection , 1988, CC.

[44]  J. Virágh,et al.  Deterministic ascending tree automata I , 1980, Acta Cybern..

[45]  Christopher W. Fraser,et al.  BURG: fast optimal instruction selection and tree parsing , 1992, SIGP.

[46]  Irène Guessarian,et al.  On Pushdown Tree Automata , 1981, CAAP.

[47]  James O. Coplien,et al.  Multi-paradigm design for C++ , 1998 .

[48]  Feng Sheng Cheng,et al.  Idiom matching: an optimization technique for an APL compiler , 1981 .

[49]  Wolfgang Reisig,et al.  A Note on the Representation of Finite Tree Automata , 1979, Inf. Process. Lett..

[50]  H.B.M. Jonkers,et al.  Abstraction, specification and implementation techniques : with an application to garbage collection , 1983 .

[51]  Richard C. Waters,et al.  Lexicalized Context-Free Grammars , 1993, ACL.

[52]  Christopher W. Fraser,et al.  Engineering a simple, efficient code-generator generator , 1992, LOPL.

[53]  H. R. Walters.  On Equal Terms. Implementing Algebraic Specifications , 1991 .

[54]  David R. Chase,et al.  An improvement to bottom-up tree pattern matching , 1987, POPL '87.

[55]  A. J. J. M. Marcelis,et al.  On the Classification of Attribute Evaluation Algorithms , 1990, Sci. Comput. Program..

[56]  Todd A. Proebsting.  BURS automata generation , 1995, TOPL.

[57]  Beate Commentz-Walter,et al.  A String Matching Algorithm Fast on the Average , 1979, ICALP.

[58]  H.J.A. van de Meerakker.  Een parsing algoritme voor boomgrammatica's , 1988 .

[59]  Alfred V. Aho,et al.  Efficient string matching , 1975, Commun. ACM.

[60]  james w.thatcher,et al.  tree automata: an informal survey , 1974 .

[61]  Saul Corn,et al.  Explicit Definitions and Linguistic Dominoes , 1967 .

[62]  James W. Thatcher,et al.  Transformations and translations from the point of view of generalized finite automata theory , 1969, STOC.

[63]  Grzegorz Rozenberg,et al.  Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations , 1997 .

[64]  Christopher W. Fraser,et al.  Hard‐coding bottom‐up code generation tables to save time and space , 1990, Softw. Pract. Exp..

[65]  James W. Thatcher,et al.  Generalized Sequential Machine Maps , 1970, J. Comput. Syst. Sci..

[66]  Brenda S. Baker,et al.  Tree transductions and families of tree languages , 1973, STOC.

[67]  Christoph M. Hoffmann,et al.  Programming with Equations , 1982, TOPL.