Efficient computation of arbitrary control dependencies
From MaRDI portal
Recommendations
- Fast computation of strong control dependencies
- scientific article; zbMATH DE number 841576
- A unifying theory of control dependence and its application to arbitrary program structures
- Control structures in programs and computational complexity
- scientific article; zbMATH DE number 1424029
- Fast and incremental computation of weak control closure
- scientific article; zbMATH DE number 219232
- Computational complexity of controllability/observability problems for combinational circuits
Cites work
- A fast algorithm for finding dominators in a flowgraph
- A theory of slicing for probabilistic control flow graphs
- A unifying theory of control dependence and its application to arbitrary program structures
- Certification of programs for secure information flow
- Cut branches before looking for bugs: sound verification on relaxed slices
- Dominator tree certification and divergent spanning trees
- Finding Dominators in Practice
- Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.
- Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems
- Slicing for modern program structures: a theory for eliminating irrelevant loops
- The program dependence graph and its use in optimization
- Validating dominator trees for a fast, verified dominance test
- Why3 -- where programs meet provers
This page was built for publication: Efficient computation of arbitrary control dependencies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6165552)
