15-122 Principles of Imperative Computation
Lecture 20: ROBDDs

  • Reading: 19-bdds.pdf
  • Code: none
  • Concepts:
    • Irredudancy and uniqueness of ROBDDs
    • Applying binary operations to ROBDDs
    • The C language
    • Undefined and implementation-defined expressions
    • Arithmetic overflow
    • Null pointer dereference
    • Out of bounds array access
  • Previous lecture: Binary Decision Diagrams
  • Next lecture: Polymorphism

[ Home | Schedule | Assignments | Resources ]
[ Blackboard | academic.cs.15-122 ]

fp@cs
Frank Pfenning