Titlebook: Computer Aided Verification; 8th International Co Rajeev Alur,Thomas A. Henzinger Conference proceedings 1996 Springer-Verlag Berlin Heidel

backdrop

A conjunctively decomposed boolean representation for symbolic model checking,ariable that is determined by the previous variables in the variable order appears in only one component of the decomposition. An example of verifying equivalence of sequential circuits is used to show the potential advantage of the decomposed representation over OBDD‘s.

Entropion

Deductive model checking, properties can be used to further constrain the search. Although the resulting method is not always automatic, it provides a flexible and general framework that can be used to integrate a diverse number of other verification tools.

有常识

DOSE

A conjunctively decomposed boolean representation for symbolic model checking,e order. The components can be represented in OBDD form. Algorithms for boolean operations and quantification are presented allowing the representation to be used for symbolic model checking. The decomposed form has a number of useful properties that OBDD‘s lack. For example, the size of conjunction