Simple and efficient computation of minimal weak control closure

DOI10.1007/978-3-030-65474-0_10zbMath1474.68057OpenAlexW3119864243MaRDI QIDQ2233536

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)

Related Items (1)

Fast and incremental computation of weak control closure

Cites Work

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

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