Journal Article10.1023/A:1023063919574
Universal Regular Path Queries
Oege de Moor,David Lacey,Eric Van Wyk +2 more
- 01 Mar 2003
- Vol. 16, Iss: 1, pp 15-35
TL;DR: An algorithm is derived using relational algebra to compute all substitutions Φ (of symbols for variables), together with all nodes n such that all paths n0 → n are in Φ(P).
read more
Abstract: Given are a directed edge-labelled graph G with a distinguished node n0, and a regular expression P which may contain variables. We wish to compute all substitutions φ (of symbols for variables), together with all nodes n such that all paths n0 → n are in φ(P). We derive an algorithm for this problem using relational algebra, and show how it may be implemented in Prolog. The motivation for the problem derives from a declarative framework for specifying compiler optimisations.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Parametric regular path queries
Yanhong A. Liu,Tom Rothamel,Fuxiang Yu,Scott D. Stoller,Nanjun Hu +4 more
- 09 Jun 2004
TL;DR: The paper describes the specification, design, analysis, and implementation of algorithms and data structures for efficiently solving existential and universal parametric regular path queries, and investigates the efficiency tradeoffs between different formulations of queries.
From datalog rules to efficient programs with time and space guarantees
Yanhong A. Liu,Scott D. Stoller +1 more
- 27 Aug 2003
TL;DR: This paper describes a method for transforming any given set of Datalog rules into an efficient specialized implementation with guaranteed worst-case time and space complexities, and for computing the complexities from the rules.
Incremental execution of transformation specifications
Ganesh Sittampalam,Oege de Moor,Ken Friis Larsen +2 more
- 01 Jan 2004
TL;DR: This work aims to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications by drawing on Bernhard Steffen's proposal to use model checking for certain analysis problems, and John Conway's theory of language factors.
40
Prevalence and Maintenance of Automated Functional Tests for Web Applications
Laurent Christophe,Reinout Stevens,Coen De Roover,Wolfgang De Meuter +3 more
- 29 Sep 2014
TL;DR: This work presents a cross-sectional quantitative study of the prevalence of SELENIUM-based tests among open-source Web applications, and of the extent to which such tests are used within individual applications.
Transforming the .NET intermediate language using path logic programming
Stephen Drape,Oege de Moor,Ganesh Sittampalam +2 more
- 06 Oct 2002
TL;DR: This work gives an informal introduction to path logic programming, and shows how it can be used in coding standard compiler optimisations, and also a number of obfuscating transformations.
33
References
•Book
Introduction to Automata Theory, Languages, and Computation
John E. Hopcroft,Rajeev Motwani,Rotwani,Jeffrey D. Ullman +3 more
- 01 Jan 1979
TL;DR: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
14.5K
•Book
Compilers: Principles, Techniques, and Tools
Alfred V. Aho,Ravi Sethi,Jeffrey D. Ullman +2 more
- 01 Jan 1986
TL;DR: This book discusses the design of a Code Generator, the role of the Lexical Analyzer, and other topics related to code generation and optimization.
9.7K
•Book
Advanced Compiler Design and Implementation
Steven S. Muchnick
- 01 Jan 1997
TL;DR: Advanced Compiler Design and Implementation by Steven Muchnick Preface to Advanced Topics
2.6K
•Book
Modern Compiler Implementation in Java
Andrew W. Appel,Jens Palsberg +1 more
- 01 Jan 1997
TL;DR: The new, expanded version of this textbook describes all phases of a modern compiler: lexical analysis, parsing, abstract syntax, semantic actions, intermediate representations, instruction selection via tree matching, dataflow analysis, graph-coloring register allocation, and runtime systems.
557
UnQL: a query language and algebra for semistructured data based on structural recursion
Peter Buneman,Mary Fernández,Dan Suciu +2 more
- 01 Mar 2000
TL;DR: This paper describes a simple and powerful query language based on pattern matching and shows that it can be expressed using structural recursion, which is introduced as a top-down, recursive function, similar to the way XSL is defined on XML trees.
Related Papers (5)
Yanhong A. Liu,Tom Rothamel,Fuxiang Yu,Scott D. Stoller,Nanjun Hu +4 more
- 09 Jun 2004
Elnar Hajiyev,Mathieu Verbaere,Oege de Moor +2 more
- 03 Jul 2006
David Lacey,Oege de Moor +1 more
- 02 Apr 2001