象征性的布尔操作的有序二元决策_1.pptVIP

Verifying Programs with BDDsSept. 21, 2004 Topics Representing Boolean functions with Binary Decision Diagrams Application to program verification Decision Structures Vertex represents decision Follow green (dashed) line for value 0 Follow red (solid) line for value 1 Function value determined by leaf value. Variable Ordering Assign arbitrary total ordering to variables e.g., x1 x2 x3 Variables must appear in ascending order along all paths Reduction Rule #1 Reduction Rule #2 Reduction Rule #3 Example OBDD Canonical representation of Boolean function For given variable ordering Two functions equivalent if and only if graphs isomorphic Can be tested in linear time Desirable property: simplest form is canonical. Example Functions More Complex Functions Functions Add 4-bit words a and b Get 4-bit sum s Carry output bit Cout Shared Representation Graph with multiple roots 31 nodes for 4-bit adder 571 nodes for 64-bit adder Linear growth! Apply Operation Concept Basic technique for building OBDD from Boolean formula. Apply Execution Example Optimizations Dynamic programming Early termination rules Apply Result Generation Recursive calling structure implicitly defines unreduced BDD Apply reduction rules bottom-up as return from recursive calls Program Verification Do these functions produce identical results? Symbolic Execution Symbolic Execution (cont.) Counterexample Generation Find values of x y for which these programs produce different results Symbolic Execution Performance: Good Performance: Bad What if Multiplication were Easy? Evaluation Strengths Provides 100% guarantee of correctness Performance very good for Datalab functions Weaknesses Important integer functions have exponential blowup Not practical for programs that build and operate on large data structures Some History Origins Lee 1959, Akers 1976 Idea of representing Boolean function as BDD Hopcroft, Fortune, Schmidt 1978 Recognized that ordered BDDs were like finite state machines Polynomial