Simple and efficient computation of minimal weak control closure

DOI10.1007/978-3-030-65474-0_10MaRDI QIDQ2233536zbMATH OpenOpenAlexFDO

Authors Abu Naser Masud

Publication date 18 October 2021

Full work available at URL https://doi.org/10.1007/978-3-030-65474-0_10

zbMATH Keywords

program slicingcontrol dependencynontermination insensitivenontermination sensitivestrong control closureweak control closure

Mathematics Subject Classification ID

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

Recommendations

• Fast computation of strong control dependencies
• A unifying theory of control dependence and its application to arbitrary program structures
• Programming Languages and Systems
• scientific article; zbMATH DE number 841576
• 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
• The program dependence graph and its use in optimization

Cited in

(6)

• Fast and incremental computation of weak control closure
• Fast computation of strong control dependencies
• Parametric and Termination-Sensitive Control Dependence
• An alternative characterization of weak order dependence
• scientific article; zbMATH DE number 841576 (Why is no real title available?)
• A unifying theory of control dependence and its application to arbitrary program structures

This page was built for publication: Simple and efficient computation of minimal weak control closure

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