Learn More
The verification of an execution against memory consistency is known to be NP-hard. This paper proposes a novel fast memory consistency verification method by identifying a new natural partial order: time order. In multiprocessor systems with store atomicity, a time order restriction exists between two operations whose pending periods are disjoint: the(More)
Approximate inference for Bayesian models is dominated by two approaches, variational Bayesian inference and Markov Chain Monte Carlo. Both approaches have their own advantages and disadvantages, and they can complement each other. Recently researchers have proposed collapsed variational Bayesian inference to combine the advantages of both. Such inference(More)
As the complexity of processors grows, the bottleneck of verification remains in generating suitable test programs that meet coverage metrics automatically. Coverage directed test generation is a technique to automate the feedback from coverage analysis to test generation. It is very important to solve the constraint satisfaction problem for a flexible(More)
  • 1