219 search results - page 39 / 44 » Formal Verification of the Ricart-Agrawala Algorithm |
AMW
2010
14 years 11 months ago
2010
We study query authentication schemes, algorithmic and cryptographic constructions that provide efficient and secure protocols for verifying the results of queries over structured...
RTSS
1998
IEEE
15 years 1 months ago
1998
IEEE
Timed and hybrid automata are extensions of finite-state machines for formal modeling of embedded systems with both discrete and continuous components. Reachability problems for t...
CAV
2006
Springer
15 years 1 months ago
2006
Springer
Many multithreaded programs employ concurrent data types to safely share data among threads. However, highly-concurrent algorithms for even seemingly simple data types are difficul...
164
click to vote
POPL
2005
ACM
15 years 9 months ago
2005
ACM
While a typical software component has a clearly specified (static) interface in terms of the methods and the input/output types they support, information about the correct sequen...
POPL
2010
ACM
14 years 12 months ago
2010
ACM
Angelic nondeterminism can play an important role in program development. It simplifies specifications, for example in deriving programs with a refinement calculus; it is the form...