88 search results - page 10 / 18 » A Comparison of Modular Verification Techniques |
142
Voted
FMCAD
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Probabilistic techniques for verification of finite-state transition systems offer huge memory savings over deterministic techniques. The two leading probabilistic scheme...
127
Voted
EDBT
2008
ACM
16 years 3 months ago
2008
ACM
Schema mapping algorithms rely on value correspondences ? i.e., correspondences among semantically related attributes ? to produce complex transformations among data sources. Thes...
151
Voted
CIIA
2009
15 years 4 months ago
2009
Abstract. Formal verification of digital systems is achieved, today, using one of two main approaches: states exploration (mainly model checking and equivalence checking) or deduct...
138
Voted
ICASSP
2010
IEEE
15 years 4 months ago
2010
IEEE
The standard approach to speaker verification is to extract cepstral features from the speech spectrum and model them by generative or discriminative techniques. We propose a nov...
120
Voted
ESOP
2010
Springer
16 years 1 months ago
2010
Springer
The combination of message passing and locking to protect shared state is a useful concurrency pattern. However, programs that employ this pattern are susceptible to deadlock. That...