Yanhong A. Liu, Fuxiang Yu  Home/Search
Context Related
| sunysb.edu/pub/liu...gPathQMPC02.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: sunysb.edu/~liu/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Regular path queries are a way of declaratively specifying program analyses as a kind of regular expressions that are matched against paths in graph representations of programs. These and similar queries are useful for other path analysis problems as well. This paper describes the precise specification, derivation, and analysis of a complete algorithm and data structures for solving regular path queries. We rst show two ways of specifying the problem and deriving a high-level algorithmic... (Update)
Context of citations to this paper: More
.... of the same solving algorithm, with more emphasis on the necessary data structures, but restricted to ground queries, can be found in [28]) Due to space limitations, we shall not address the range of transformations expressible in this framework. However, the reader is...
...starting from elements of W . However, often a non constant number of sets must be strongly based for constant time associative access [18, 23], and this is particularly the case here for compiling general forms of rules here. Speci cally, for the cleaned up version of (13)...
Cited by: More
Parametric Regular Path Queries - Tom (Correct)
From Datalog Rules to Efficient Programs with Time and Space.. - Liu, Stoller (2003) (Correct)
From Datalog Rules to Optimal Algorithms with Time and Space.. - Liu, Stoller (2003) (Correct)
Similar documents (at the sentence level):
58.7%: Solving Regular Path Queries - Liu, Yu (2002) (Correct)
7.7%: Solving Regular Tree Grammar Based Constraints - Liu, Li, Stoller (2000) (Correct)
Active bibliography (related documents): More All
0.2: Iterate, incrementalize, and implement: A systematic approach to.. - Liu (Correct)
0.2: SETL for Internet Data Processing - Bacon (2000) (Correct)
0.2: Optimizing Aggregate Array Computations in Loops - Liu, Stoller, Li, Rothamel (Correct)
Similar documents based on text: More All
0.3: Regular Path Queries with Constraints - Abiteboul, Vianu (1998) (Correct)
0.3: View-based Query Processing for Regular Path Queries.. - Calvanese, De Giacomo, .. (2000) (Correct)
0.3: Containment of Conjunctive Regular Path Queries with.. - Calvanese, De Giacomo, .. (2000) (Correct)
Related documents from co-citation: More All
3: Introduction to set constraint-based program analysis (context) - Aiken - 1999
3: Set constraints and set-based analysis - Heintze, Jaffar - 1994
3: Higher-Order and Symbolic Computation (context) - de Moor, Lacey et al. - 2003
BibTeX entry: (Update)
Y. A. Liu and F. Yu. Solving regular path queries. In Proceedings of the 6th International Conference on Mathematics of Program Construction (MPC), volume 2386 of Lecture Notes in Computer Science, pages 195{ 208. Springer Verlag, 2002. http://citeseer.ist.psu.edu/liu02solving.html More
@misc{ liu02solving,
author = "Y. Liu and F. Yu",
title = "Solving regular path queries",
text = "Y. A. Liu and F. Yu. Solving regular path queries. In Proceedings of the
6th International Conference on Mathematics of Program Construction (MPC),
volume 2386 of Lecture Notes in Computer Science, pages 195{ 208. Springer
Verlag, 2002.",
year = "2002",
url = "citeseer.ist.psu.edu/liu02solving.html" }
Citations (may not include all citations):452 Data Structures and Algorithms (context) - Aho, Hopcroft et al. - 1983
101 Programming with Sets: An Introduction to SETL (context) - Schwartz, Dewar et al. - 1986
51 Fast algorithms for solving path problems (context) - Tarjan - 1981
34 Programming with invariants (context) - Paige - 1986
33 Real-time simulation of a set machine on a RAM - Paige - 1989
27 The Deductive Foundations of Computer Programming (context) - Manna, Waldinger - 1993
20 Theory of Computational Complexity (context) - Du, Ko - 2000
18 erencing of computable expressions (context) - Paige, Koenig - 1982
16 Viewing a program transformation system at work - Paige - 1994
15 Type analysis and data structure selection - Cai, Facon et al. - 1991
14 Eciency by incrementalization: An introduction (context) - Liu - 2000
12 From regular expressions to DFA's using compressed NFA's - Chang, Paige - 1997
12 Program derivation by xed point computation (context) - Cai, Paige - 1988
10 Model-checking: A tutorial introduction (context) - uller-Olm, Schmidt et al. - 1999
10 Courant Institute of Mathematical Sciences (context) - Snyder, Programming et al. - 1990
9 A uni ed approach to path problems (context) - Tarjan - 1981
5 volume 6 of Computer Science and Arti cial Intelligence (context) - Paige, erentiation et al. - 1979
2 Revised and being reviewed for Special Issue of Higher-Order.. (context) - de Moor, Lacey et al. - 2001
Documents on the same site (http://www.cs.sunysb.edu/~liu/): More
Dynamic Programming via Static Incrementalization - Liu, Stoller (2000) (Correct)
Optimizing Ackermann's function by incrementalization - Liu, Stoller (2000) (Correct)
Strengthening Invariants for Efficient Computation - Liu, Stoller, Teitelbaum (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC