Universal regular path queries (2003)

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

Documents Related by Co-Citation

502 Querying Semi-Structured Data – Serge Abiteboul - 1997
1549 Foundations of Databases – S ABITEBOUL, R HULL, V VIANU - 1995
973 Advanced Compiler Design and Implementation – S S Muchnick - 1997
535 Program Analysis and Specialization for the C Programming Language – Lars Ole Andersen - 1994
2976 Graph-based algorithms for Boolean function manipulation – Randal E. Bryant - 1986
375 Interprocedural dataflow analysis via graph reachability – Thomas Reps, Susan Horwitz, Mooly Sagiv - 1994
457 Semantics of Context-Free Languages – Donald E. Knuth - 1968
543 Perspectives on Program Analysis – Flemming Nielson - 1996
855 Efficiently computing static single assignment form and the control dependence graph – Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, F. Kenneth Zadeck - 1991