Fast computation of strong control dependencies

DOI10.1007/978-3-030-81688-9_41zbMath1493.68102arXiv2011.01564OpenAlexW3096908876MaRDI QIDQ832318

David Klaška, Lukáš Tomovič, Jan Strejček, Marek Chalupa

Publication date: 25 March 2022

Full work available at URL: https://arxiv.org/abs/2011.01564

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Uses Software

• LLVM

Cites Work

• A unifying theory of control dependence and its application to arbitrary program structures
• Cut branches before looking for bugs: certifiably sound verification on relaxed slices
• Slicing for modern program structures: a theory for eliminating irrelevant loops
• Slicing communicating automata specifications: Polynomial algorithms for model reduction
• Program Slicing
• Parametric and Termination-Sensitive Control Dependence
• The program dependence graph and its use in optimization
• Characterizations of Reducible Flow Graphs
• Certification of programs for secure information flow
• Programming Languages and Systems

This page was built for publication: Fast computation of strong control dependencies