Context-sensitive data-dependence analysis via linear conjunctive language reachability

DOI10.1145/3009837.3009848zbMath1380.68262OpenAlexW2561266941MaRDI QIDQ5370873

Qirun Zhang, Zhendong Su

Publication date: 20 October 2017

Published in: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3009837.3009848

zbMATH Keywords

program analysistrellis automatalinear conjunctive grammarcontext-free language reachability

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

Path querying with conjunctive grammars by matrix multiplication ⋮ Conditional Dyck-CFL Reachability Analysis for Complete and Efficient Library Summarization ⋮ Path querying on acyclic graphs using Boolean grammars

This page was built for publication: Context-sensitive data-dependence analysis via linear conjunctive language reachability