198 search results - page 40 / 40 » Lightweight reasoning about program correctness |
CACM
2010
13 years 5 months ago
2010
Exploiting the multiprocessors that have recently become ubiquitous requires high-performance and reliable concurrent systems code, for concurrent data structures, operating syste...
JACM
2002
13 years 5 months ago
2002
We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: ...
SDB
1995
13 years 8 months ago
1995
Most of work on partial information in databases asks which operations of standard languages, like relational algebra, can still be performed correctly in the presence of nulls. In...