Parametric regular path queries

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn 1, Issue , 2004, Pages 219-230

  Liu, Yanhong A ^a   Rothamel, Tom ^a   Yu, Fuxiang ^a   Stoller, Scott D ^a   Hu, Nanjun ^a  

^a Stony Brook University   (United States)

Author keywords

Algorithms; Data structures; Graph query languages; Memoization; Model checking; Optimization; Precomputation; Program analysis; Regular expressions; Regular path queries

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; DATABASE SYSTEMS; FORMAL LOGIC; GRAPH THEORY; LOGIC DESIGN; MATHEMATICAL MODELS; QUERY LANGUAGES; SOFTWARE ENGINEERING; XML;

GRAPH QUERY LANGUAGES; MEMORIZATION; PRECOMPUTATION; PROGRAM ANALYSIS; REGULAR EXPRESSIONS; REGULAR PATH QUERIES;

PROBLEM SOLVING;

EID: 8344244537     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/996841.996868     Document Type: Conference Paper

References (21)

1. S. Abiteboul. Querying semi-structured data. In Proceedings of the International Conference on Database Theory, pages 1-18, 1997.
2. A. Aiken. Introduction to set constraint-based program analysis. Science of Computer Programming, 35(2-3):79-111, 1999.
3. J. Cai and R. Paige. "Look Ma, no hashing, and no arrays either". In Conference Record of the 18th Annual ACM Symposium on Principles of Programming Languages, pages 143-154, 1991.
4. C. Colby and P. Lee. Trace-based program analysis. In Conference Record of the 23rd Annual ACM Symposium on Principles of Programming Languages, pages 195-207, 1996.
5. M. Das, S. Lerner, and M. Seigle. ESP: Path-sensitive program verification in polynomial time. In PLDI 2002 [13], pages 57-68.
6. O. de Moor, D. Lacey, and E. V. Wyk. Universal regular path queries. Higher-Order and Symbolic Computation, 16(1-2), 2003.
7. S. Drape, O. de Moor, and G. Sittampalam. Transforming the. NET intermediate language using path logic programming. In Proceedings of the 4th International Conference on Principles and Practice of Declarative Programming, Oct. 2002.
8. J. Field, D. Goyal, G. Ramalingam, and E. Yahav. Typestate verification: Abstraction techniques and complexity results. In Proceedings of the 10th International Static Analysis Symposium, volume 2694 of LNCS, pages 439-462. Springer-Verlag, Berlin, 2003.
9. J. S. Foster, T. Terauchi, and A. Aiken. Flow-sensitive type qualifiers. In PLDI 2002 [13].
10. S. Hallem, B. Chelf, Y. Xie, and D. Engler. A system and language for uilding system-specific, static analyses. In PLDI 2002 [13].
11. N. Heintze and J. Jaffar. Set constraints and set-based analysis. In Proceedings of the 2nd International Workshop on Principles and Practice of Constraint Programming, volume 874 of LNCS, pages 281-298. Springer-Verlag, Berlin, 1994.
12. Y. A. Liu and F. Yu. Solving regular path queries. In Proceedings of the 6th International Conference on Mathematics of Program Construction, volume 2386 of LNCS, pages 195-208. Springer-Verlag, Berlin, 2002.
13. Proceedings of the ACM SIGPLAN '02 Conference on Programming Language Design and Implementation, 2002.
14. T. Reps, S. Horwitz, and M. Sagiv. Precise interprocedural dataflow analysis via graph reachability. In Conference Record of the 22nd Annual ACM Symposium on Principles of Programming Languages, 1995.
15. E. Schonberg, J. Schwartz, and M. Sharir. An automatic technique for the selection of data representations in SETL programs. ACM Trans. Program. Lang. Syst., 3(2): 126-143, Apr. 1981.
16. R. Sekar and P. Uppuluri. Synthesizing fast intrusion prevention/detection systems from high-level specifications. In Proceedings of the USENIX Security Symposium, pages 63-78, 1999.
17. G. Sittampalam, O. de Moor, and K. F. Larsen. Incremental execution of transformation specifications. In Conference Record of the 31st Annual ACM Symposium on Principles of Programming Languages, pages 26-38, 2004.
18. B. Steffen. Data flow analysis as model checking. In A. M. T. Ito, editor, Theoretical Aspects of Computer Science (TAGS'91), volume 526 of LNCS, pages 346-364. Springer-Verlag, Berlin, 1991.
19. The World Wide Web Consortium. Extensible Markup Language (XML). http://www.w3.org/XML/.
20. The World Wide Web Consortium. XML Path Language (XPath). http://www.w3.org/TR/xpath.
21. M. Yannakakis. Graph-theoretic methods in database theory. In Proceedings of the ACM Symposium on Principles of Database Systems, pages 230-242, 1990.