Sciweavers

91 search results - page 10 / 19
» Mechanized metatheory model-checking
Sort
View
GI
2001
Springer
14 years 2 months ago
Formal Analysis of a Self-Stabilizing Algorithm Using Predicate Diagrams
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...
Dominique Cansell, Dominique Méry, Stephan ...
FMOODS
2006
13 years 11 months ago
Modeling Long-Running Transactions with Communicating Hierarchical Timed Automata
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...
Ruggero Lanotte, Andrea Maggiolo-Schettini, Paolo ...
KBSE
2007
IEEE
14 years 4 months ago
Sequential circuits for program analysis
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: ...
Fadi A. Zaraket, Adnan Aziz, Sarfraz Khurshid
ATVA
2010
Springer
284views Hardware» more  ATVA 2010»
13 years 11 months ago
YAGA: Automated Analysis of Quantitative Safety Specifications in Probabilistic B
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...
Ukachukwu Ndukwu, A. K. McIver
SIGSOFT
2010
ACM
13 years 8 months ago
Finding latent performance bugs in systems implementations
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...
Charles Edwin Killian, Karthik Nagaraj, Salman Per...