Fast and incremental computation of weak control closure

DOI10.1007/978-3-031-22308-2_15MaRDI QIDQ6164434zbMATH OpenFDO

Authors Abu Naser Masud

Publication date 28 July 2023

Published in Static Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-22308-2_15

zbMATH Keywords

program slicingcontrol dependencenontermination insensitivenontermination sensitivestrong control closureweak control closure

Mathematics Subject Classification ID

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

Recommendations

• Simple and efficient computation of minimal weak control closure
• Fast computation of strong control dependencies
• A unifying theory of control dependence and its application to arbitrary program structures
• Programming Languages and Systems
• An alternative characterization of weak order dependence

Cites work

• A unifying theory of control dependence and its application to arbitrary program structures
• Certification of programs for secure information flow
• Programming Languages and Systems
• Simple and efficient computation of minimal weak control closure
• The program dependence graph and its use in optimization

Cited in

(1)

• Efficient computation of arbitrary control dependencies

This page was built for publication: Fast and incremental computation of weak control closure

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