Summary-based inter-procedural analysis via modular trace refinement

DOI10.4230/LIPICS.FSTTCS.2014.545MaRDI QIDQ2978543zbMATH OpenOpenAlexFDO

Authors

Publication date 25 April 2017

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2014/4870/pdf/46.pdf

zbMATH Keywords

automataHoare logicprogram verificationrefinement

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Computing Procedure Summaries for Interprocedural Analysis
• Algebraic Methodology and Software Technology
• Unbounded procedure summaries from bounded environments
• Refinement of Trace Abstraction
• Static Analysis

Cited in

(5)

• Unbounded procedure summaries from bounded environments
• Summary-based context-sensitive data-dependence analysis in presence of callbacks
• Generating precise and concise procedure summaries
• Modular analysis of executables using on-demand Heyting completion
• Algebraic Methodology and Software Technology

This page was built for publication: Summary-based inter-procedural analysis via modular trace refinement

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