## Universal regular path queries (2003)

### Cached

### Download Links

- [www.dcs.warwick.ac.uk]
- [web.comlab.ox.ac.uk]
- [web.comlab.ox.ac.uk]
- [web.comlab.ox.ac.uk]
- DBLP

### Other Repositories/Bibliography

Venue: | Higher-Order and Symbolic Computation |

Citations: | 12 - 1 self |

### BibTeX

@INPROCEEDINGS{Moor03universalregular,

author = {Oege De Moor and David Lacey and Eric Van Wyk},

title = {Universal regular path queries},

booktitle = {Higher-Order and Symbolic Computation},

year = {2003},

pages = {16--1}

}

### Years of Citing Articles

### OpenURL

### 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. 1 Bob Paige and IFIP WG 2.1 Bob Paige was a long-standing member of IFIP Working Group 2.1 on Algorithmic Languages and Calculi. In recent years, the main aim of this group has been to investigate the derivation of algorithms from specifications by program transformation. Already in the mid-eighties, Bob was way ahead of the pack: instead of applying transformational techniques to well-worn examples, he was applying his theories of program transformation to new problems, and discovering new algorithms [16, 48, 52]. The secret of his success lay partly in his insistence on the study of general algorithm design strategies (in particular