4066 search results - page 545 / 814 » Almost Complete Sets |
190
click to vote
COORDINATION
2009
Springer
16 years 7 months ago
2009
Springer
Process algebras are a set of mathematically rigourous languages with well defined semantics that permit modelling behaviour of concurrent and communicating systems. Verification o...
176
click to vote
CAV
2009
Springer
16 years 7 months ago
2009
Springer
Window Abstraction for Infinite Markov Chains Thomas A. Henzinger1 , Maria Mateescu1 , and Verena Wolf1,2 1 EPFL, Switzerland 2 Saarland University, Germany Abstract. We present an...
251
click to vote
CAV
2009
Springer
16 years 7 months ago
2009
Springer
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...
198
click to vote
TCC
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. Protocols for deniable authentication achieve seemingly paradoxical guarantees: upon completion of the protocol the receiver is convinced that the sender authenticated th...
189
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Frequent coherent subgraphscan provide valuable knowledgeabout the underlying internal structure of a graph database, and mining frequently occurring coherent subgraphs from large...