Parametric Regular Path Queries
主 题: Parametric Regular Path Queries
报告人: Prof. Annie Liu(刘燕红) ((State Univ. of New York at Stony Brook))
时 间: 0000-00-00
地 点: 理科一号楼1560
Regular path queries provide a framework for declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in graphs. Parametric regular path queries extend the patterns with parameters to allow additional information along single or multiple paths to be captured and related, significantly increasing the expressiveness of the query language. In this talk, we introduce parametric regular path queries and show how a variety of program analysis and model-checking problems as well as queries of semi-structured data can be expressed easily and succinctly using this framework. We then give efficient algorithms and data structures for solving parametric regular path queries. Finally, we describe our implementation and experiments for analyzing C and Python programs and for model checking transition systems and show how the algorithms perform when answering queries for these analyses.
