Modular analysis of executables using on-demand Heyting completion

DOI10.1007/978-3-319-73721-8_14zbMATH Open1446.68033OpenAlexW2780175158MaRDI QIDQ3296335FDOQ3296335

Authors: Julian Kranz, Axel Simon 

Publication date: 7 July 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-73721-8_14

Recommendations

• Summary-based inter-procedural analysis via modular trace refinement
• scientific article; zbMATH DE number 2087567
• Generating precise and concise procedure summaries
• Precise interprocedural analysis in the presence of pointers to the stack
• scientific article; zbMATH DE number 1693486

zbMATH Keywords

domain refinementexecutable analysismodular analysis

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cited In (1)

• Pushing Efficient Evaluation of HEX Programs by Modular Decomposition

This page was built for publication: Modular analysis of executables using on-demand Heyting completion

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