Summary-based context-sensitive data-dependence analysis in presence of callbacks

DOI10.1145/2676726.2676997MaRDI QIDQ2819792zbMATH OpenOpenAlexFDO

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

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

context-sensitive analysissummary-based analysisCFL reachabilitytree-adjoining languagesTAL reachability

Mathematics Subject Classification ID

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

Recommendations

• Context-sensitive data-dependence analysis via linear conjunctive language reachability
• Summary-based inter-procedural analysis via modular trace refinement
• Static Analysis
• Incremental and modular context-sensitive analysis
• Coeffects: unified static analysis of context-dependence
• A fine-grained data-flow analysis framework

Cited in

(2)

• Conditional Dyck-CFL reachability analysis for complete and efficient library summarization
• Accelerating program analyses in Datalog by merging library facts

This page was built for publication: Summary-based context-sensitive data-dependence analysis in presence of callbacks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2819792)