493 search results - page 87 / 99 » Bounded LTL Model Checking with Stable Models |
106
click to vote
CAV
2003
Springer
15 years 8 months ago
2003
Springer
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 ...
103
click to vote
DLT
2008
15 years 4 months ago
2008
We consider multi-pushdown automata, a multi-stack extension of pushdown automata that comes with a constraint on stack operations: a pop can only be performed on the first non-emp...
102
click to vote
MFCS
2009
Springer
15 years 9 months ago
2009
Springer
We consider finite graphs whose edges are labeled with elements, called colors, taken from a fixed finite alphabet. We study the problem of determining whether there is an infi...
107
click to vote
CSFW
2006
IEEE
15 years 9 months ago
2006
IEEE
Robustness links confidentiality and integrity properties of a computing system and has been identified as a useful property for characterizing and enforcing security. Previous ...
160
click to vote
CORR
2012
Springer
13 years 10 months ago
2012
Springer
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...