Sciweavers

244 search results - page 33 / 49
» Counterexamples in Probabilistic Model Checking
Sort
View
ENTCS
2006
134views more  ENTCS 2006»
13 years 7 months ago
Partial Order Reduction for Probabilistic Branching Time
In the past, partial order reduction has been used successfully to combat the state explosion problem in the context of model checking for non-probabilistic systems. For both line...
Christel Baier, Pedro R. D'Argenio, Marcus Grö...
KBSE
2009
IEEE
14 years 2 months ago
Loopfrog: A Static Analyzer for ANSI-C Programs
—Practical software verification is dominated by two major classes of techniques. The first is model checking, which provides total precision, but suffers from the state space ...
Daniel Kroening, Natasha Sharygina, Stefano Tonett...
CAV
2003
Springer
156views Hardware» more  CAV 2003»
14 years 24 days ago
Abstraction and BDDs Complement SAT-Based BMC in DiVer
ion and BDDs Complement SAT-based BMC in DiVer Aarti Gupta1, Malay Ganai1 , Chao Wang2, Zijiang Yang1, Pranav Ashar1 1 NEC Laboratories America, Princeton, NJ, U.S.A. 2 University ...
Aarti Gupta, Malay K. Ganai, Chao Wang, Zijiang Ya...
ACL
1998
13 years 9 months ago
Conditions on Consistency of Probabilistic Tree Adjoining Grammars
Much of the power of probabilistic methods in modelling language comes from their ability to compare several derivations for the same string in the language. An important starting...
Anoop Sarkar
UAI
2008
13 years 9 months ago
Bounds on the Bethe Free Energy for Gaussian Networks
We address the problem of computing approximate marginals in Gaussian probabilistic models by using mean field and fractional Bethe approximations. As an extension of Welling and ...
Botond Cseke, Tom Heskes