Efficient computation of arbitrary control dependencies
From MaRDI portal
Publication:6165552
DOI10.1016/j.tcs.2023.114029MaRDI QIDQ6165552
Nikolai Kosmatov, Jean-Christophe Léchenet, Pascale Le Gall
Publication date: 1 August 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- A unifying theory of control dependence and its application to arbitrary program structures
- Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.
- Slicing for modern program structures: a theory for eliminating irrelevant loops
- Cut Branches Before Looking for Bugs: Sound Verification on Relaxed Slices
- A Theory of Slicing for Probabilistic Control Flow Graphs
- Validating Dominator Trees for a Fast, Verified Dominance Test
- Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems
- The program dependence graph and its use in optimization
- A fast algorithm for finding dominators in a flowgraph
- Certification of programs for secure information flow
- Dominator Tree Certification and Divergent Spanning Trees
- Finding Dominators in Practice
- Why3 — Where Programs Meet Provers
This page was built for publication: Efficient computation of arbitrary control dependencies
