---
title: Program dependence graph
slug: program-dependence-graph
qid: 
snapshot: enwiki-001266250885
content_hash: 
license: CC BY-SA 4.0
source: https://en.wikipedia.org/w/index.php?oldid=1266250885
tags: [20346051, 22947099, 22952141, 22956888, 23118434, 23468805, 23603337, 24043274, 24745121, 25114486, 26748027, 29176164, 31347309, 7692542]
---

# Program dependence graph

> [!note] Provenance
> Snapshot `enwiki-001266250885` · content root `…`
> Derived from <https://en.wikipedia.org/w/index.php?oldid=1266250885> · Licensed CC BY-SA 4.0

to a remote URL A Program Dependence Graph (PDG) is a directed graph of a program's control and data dependencies. Nodes represent program statements and edges represent dependencies between these statements. PDGs are used in optimization, debugging, and understanding program behavior. One example of this is their utilization by compilers during dependence analysis, enabling the optimizing compiler to make transformations to allow for parallelism.

to a remote URL A Program Dependence Graph (PDG) is a directed graph of a program's control and data dependencies. Nodes represent program statements and edges represent dependencies between these statements. PDGs are used in optimization, debugging, and understanding program behavior. One example of this is their utilization by compilers during dependence analysis, enabling the optimizing compiler to make transformations to allow for parallelism. ==See also== Dependency graph Control-flow graph Data-flow analysis Static program analysis ==References==
