601 search results - page 54 / 121 » Model Checking CTL Properties of Pushdown Systems |
110
click to vote
CAV
2005
Springer
15 years 7 months ago
2005
Springer
Bounded model checking is an efficient method for finding bugs in system designs. The major drawback of the basic method is that it cannot prove properties, only disprove them. R...
141
click to vote
ATVA
2006
Springer
15 years 5 months ago
2006
Springer
Generic representatives have been proposed for the effective combination of symmetry reduction and symbolic representation with BDDs in non-probabilistic model checking. This appro...
129
click to vote
DC
2010
15 years 1 months ago
2010
Model checking software transactional memories (STMs) is difficult because of the unbounded number, length, and delay of concurrent transactions and the unbounded size of the memo...
125
Voted
GVD
2003
15 years 2 months ago
2003
Several mapping schemes have recently been proposed to store XML data in relational tables. Relational database systems are readily available and can handle vast amounts of data v...
130
click to vote
ASE
2005
15 years 1 months ago
2005
Feature-oriented programming organizes programs around features rather than objects, thus better supporting extensible, product-line architectures. Programming languages increasin...