Universal regular path queries (2003)

by Oege De Moor , David Lacey , Eric Van Wyk
Venue:Higher-Order and Symbolic Computation
Citations:12 - 1 self

Documents Related by Co-Citation

35 Imperative program transformation by rewriting – David Lacey, Oege De Moor - 2001
22 Parametric regular path queries – Yanhong A. Liu, Tom Rothamel, Fuxiang Yu, Scott D. Stoller, Nanjun Hu - 2004
30 From Datalog rules to efficient programs with time and space guarantees – Yanhong A. Liu, Scott D. Stoller - 2003
18 Transforming the .NET Intermediate Language Using Path Logic Programming – Stephen Drape, Oege De Moor, Ganesh Sittampalam, Ox Qd - 2002
54 Proving correctness of compiler optimizations by temporal logic – David Lacey, Neil D. Jones - 2002
56 Graph Theoretic Methods in Database Theory – M Yannakakis - 1990
167 GraphLog: a Visual Formalism for Real Life Recursion – Mariano Consens, Alberto O. Mendelzon - 1990
5 Solving Regular Path Queries – Yanhong A. Liu, Fuxiang Yu - 2002
491 Querying Semi-Structured Data – Serge Abiteboul - 1997
50 Data flow analysis as model checking – Bernhard Steffen
373 Interprocedural Dataflow Analysis via Graph Reachability – Thomas Reps, Mooly Sagiv, Susan Horwitz - 1994
195 A System and Language for Building System-Specific, Static Analyses – Seth Hallem, Benjamin Chelf, Yichen Xie, Dawson Engler - 2002
250 ESP: Path-Sensitive Program Verification in Polynomial Time – Manuvir Das, Sorin Lerner, Mark Seigle - 2002
12 Strategies for source-to-source constant propagation – K Olmos, E Visser - 2002
56 Meta-Programming with Concrete Object Syntax – Eelco Visser - 2002
309 Constant propagation with conditional branches – Mark N. Wegman, F. Kenneth Zadeck - 1991
1526 V.: Foundations of Databases – S Abiteboul, R Hull, Vianu - 1995
958 Advanced Compiler Design and Implementation – Steven S Muchnick - 1997
72 Synthesizing Fast Intrusion Prevention/Detection Systems from High-Level Specifications – R. Sekar, P. Uppuluri - 1999