Constraint satisfaction for test program generation
Daniel Lewin, Laurent Fournier, et al.
Phoenix IPCCC 1995
A case study on the practical application of formal verification technique of symbolic model checking to the verification of PCI bus bridges is presented. The paper covers the practical aspects of formal verification and shows its efficiency in the verification of real designs. The process of modelling the environment is discussed and typical rules of a PCI bus bridge and the reusability of those rules from design to design is examined. Results of the process, including the number of bugs discovered and the effort required to discover bugs/prove a property are investigated.
Daniel Lewin, Laurent Fournier, et al.
Phoenix IPCCC 1995
Erich P. Stuntebeck, John S. Davis II, et al.
HotMobile 2008
Raymond Wu, Jie Lu
ITA Conference 2007
Pradip Bose
VTS 1998