1. ► VPI programs written on one simulator cannot be ported directly to another simulator.

2. ► A Verilog design is internally represented in the form of a graph where edges represent the connectivity.

3. ► It is possible to easily retrieve the simulation time using VPI routines.

4. ► There is significant overhead of moving data between simulation and C domains.

5. ► Incorrectly written VPI applications may leak memory.

6. ► Depth-first walk is more useful than a breadth-first walk.

7. ► Breadth-first walk on a graph creates a breadth-first tree.

8. ► Depth-first walk is only defined for a Tree.

9. ► In-order depth-first walk is defined for all kinds of trees.

10. ► VPI provides routines using which one can easily traverse over design graph.