6059 search results - page 290 / 1212 » A Technique for Verifying Measurements |
146
click to vote
CICLING
2009
Springer
16 years 7 months ago
2009
Springer
A desirable property for any system dealing with unrestricted natural language text is robustness, the ability to analyze any input regardless of its grammaticality. In this paper ...
292
click to vote
POPL
2007
ACM
16 years 7 months ago
2007
ACM
This paper contributes to the development of techniques for the modular proof of programs that include concurrent algorithms. We present a proof of a non-blocking concurrent algor...
284
click to vote
POPL
2005
ACM
16 years 7 months ago
2005
ACM
We present a new approach to partial-order reduction for model checking software. This approach is based on initially exploring an arbitrary interleaving of the various concurrent...
164
click to vote
ICSE
2007
IEEE-ACM
16 years 6 months ago
2007
IEEE-ACM
The paper presents a novel approach based on Bogor for the accurate verification of applications based on PublishSubscribe infrastructures. Previous efforts adopted standard model...
160
click to vote
ESOP
2010
Springer
16 years 4 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...