2661 search results - page 196 / 533 » Model Checking Performability Properties |
120
Voted
JUCS
2010
14 years 10 months ago
2010
: We consider the uniform BSS model of computation where the machines can perform additions, multiplications, and tests of the form x 0. The oracle machines can also check whether...
98
Voted
FMSD
2006
15 years 3 months ago
2006
We propose a refinement approach to language emptiness, which is based on the enumeration and the successive refinements of SCCs on over-approximations of the exact system. Our alg...
120
Voted
SIGSOFT
2009
ACM
16 years 4 months ago
2009
ACM
We propose a new algorithm for verifying concurrent programs, which uses concrete executions to partition the program into a set of lean partitions called concurrent trace program...
137
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
127
click to vote
DAWAK
1999
Springer
15 years 7 months ago
1999
Springer
One of the most challenging problems in data manipulation in the future is to be able to e ciently handle very large databases but also multiple induced properties or generalizatio...