Summary-Based Context-Sensitive Data-Dependence Analysis in Presence of Callbacks

DOI10.1145/2676726.2676997zbMath1346.68066OpenAlexW2035260626MaRDI QIDQ2819792

Lingming Zhang, Hao Tang, Bing Xie, Hong Mei, Lu Zhang, Xiaoyin Wang

Publication date: 29 September 2016

Published in: Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)

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

zbMATH Keywords

tree-adjoining languagescontext-sensitive analysissummary-based analysisCFL reachabilityTAL reachability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

Accelerating program analyses in Datalog by merging library facts ⋮ Conditional Dyck-CFL Reachability Analysis for Complete and Efficient Library Summarization

This page was built for publication: Summary-Based Context-Sensitive Data-Dependence Analysis in Presence of Callbacks