Reference 1
Directed Acyclic Graph (DAG) is a tool that depicts the structure of basic blocks, helps to see the flow of values flowing among the basic blocks, and offers optimizatino too. 1 A directed acyclic graph (DAG) for a basic block: Leaf nodes represent identifiers, names or constants. Interior nodes are labeled by an operator symbol. Nodes are also given a sequence of identifiers for labels to store the computed value.
Reference 1 A technique to resolve unique names for programming entities in many modern programming languages. Provides a way of encoding additional information in the name of a function, structure, class or another datatype in order to pass more semantic information from compilers to linkers. Linker: To link different object code together, linker needs a great deal of information on each program entity. For example, to correctly link a function, it needs the function name, the number of arguments and their types, and so on.
In Java GC From Reference 1: Dominator tree of object graph in Java heap analyzer. An object x dominates an object y if every path in the object graph from the start (or the root) node to y must go through x. The immediate dominator x of some object y is the dominator closest to the object y. A dominator tree is built out of the object graph. In the dominator tree, each object is the immediate dominator of its children, so dependencies between the objects are easily identified.
If you could revise
the fundmental principles of
computer system design
to improve security...
... what would you change?