Generating precise and concise procedure summaries

DOI10.1145/1328438.1328467MaRDI QIDQ3189841zbMATH OpenOpenAlexFDO

Authors Greta Yorsh, Eran Yahav, Satish Chandra

Publication date 12 September 2014

Published in Proceedings of the 35th 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/1328438.1328467

zbMATH Keywords

summarizationdataflow analysisrelational analysismicro-transformerssymbolic summarytype-state verification

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Computing Procedure Summaries for Interprocedural Analysis
• Summarizing procedures in concurrent programs
• Programming Languages and Systems
• Summary-based inter-procedural analysis via modular trace refinement
• Generating abstract graph-based procedure summaries for pointer programs

Cited in

(5)

• Underapproximation of procedure summaries for integer programs
• Summarizing procedures in concurrent programs
• Conditional Dyck-CFL reachability analysis for complete and efficient library summarization
• Modular analysis of executables using on-demand Heyting completion
• Computing Procedure Summaries for Interprocedural Analysis

This page was built for publication: Generating precise and concise procedure summaries

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