Accelerating program analyses in Datalog by merging library facts

DOI10.1007/978-3-030-88806-0_4zbMath1497.68085OpenAlexW3205951184MaRDI QIDQ2145320

Xiaoyin Wang, Hao Tang, Yingfei Xiong, Lu Zhang, Chenyang Yang, Xin Zhang, Yi-Fan Chen

Publication date: 17 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-88806-0_4

zbMATH Keywords

static analysisDatalogdata-driven analysisdomain-wise merging

Mathematics Subject Classification ID

Database theory (68P15) Theory of programming languages (68N15) Logic programming (68N17)

Uses Software

• DaCapo

Cites Work

• Unnamed Item
• Summary-Based Context-Sensitive Data-Dependence Analysis in Presence of Callbacks
• Conditional Dyck-CFL Reachability Analysis for Complete and Efficient Library Summarization
• Static Analysis, Abstract Interpretation and Verification in (Constraint Logic) Programming
• Abstract interpretation and application to logic programs
• Learning minimal abstractions

This page was built for publication: Accelerating program analyses in Datalog by merging library facts