91 search results - page 10 / 19 » Mechanized metatheory model-checking |
114
click to vote
GI
2001
Springer
15 years 6 months ago
2001
Springer
We present the verification of a protocol designed to ensure self-stabilization in a ring of processors. The proof is organized as a series of refinements; it is mechanized base...
108
click to vote
FMOODS
2006
15 years 3 months ago
2006
Long-Running transactions consist of tasks which may be executed sequentially and in parallel, may contain sub-tasks, and may require to be completed before a deadline. These trans...
KBSE
2007
IEEE
15 years 8 months ago
2007
IEEE
A number of researchers have proposed the use of Boolean satisfiability solvers for verifying C programs. They encode correctness checks as Boolean formulas using finitization: ...
126
Voted
ATVA
2010
Springer
15 years 3 months ago
2010
Springer
Probabilistic B (pB) [2, 8] extends classical B [7] to incorporate probabilistic updates together with the specification of quantitative safety properties. As for classical B, prob...
125
click to vote
SIGSOFT
2010
ACM
14 years 11 months ago
2010
ACM
Robust distributed systems commonly employ high-level recovery mechanisms enabling the system to recover from a wide variety of problematic environmental conditions such as node f...