Control flow refinement and symbolic computation of average case bound

DOI10.1007/978-3-319-02444-8_24MaRDI QIDQ5166698zbMATH OpenOpenAlexFDO

Authors Supratik Mukhopadhyay, Zheng Lu, Hongyi Chen

Publication date 8 July 2014

Published in Automated Technology for Verification and Analysis (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Recommendations

• Automating program analysis
• SPEED: precise and efficient static estimation of program computational complexity
• Control-flow refinement by partial evaluation, and its application to termination and cost analysis
• Symbolic Loop Bound Computation for WCET Analysis
• Formal semantics for program paths

Cited in

(1)

• Symbolic Loop Bound Computation for WCET Analysis

This page was built for publication: Control flow refinement and symbolic computation of average case bound

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