219 search results - page 41 / 44 » Formal Verification of the Ricart-Agrawala Algorithm |
ICNP
1999
IEEE
14 years 20 days ago
1999
IEEE
In this paper we present a new approach for the automated mapping of formal descriptions into activity thread implementations. Our approach resolves semantic conflicts by reorderi...
AIML
2008
13 years 9 months ago
2008
In 1983, Valentini presented a syntactic proof of cut-elimination for a sequent calculus GLSV for the provability logic GL where we have added the subscript V for "Valentini&q...
ENTCS
2008
13 years 8 months ago
2008
We formalize higher-order separation logic for a first-order imperative language with procedures and local variables in Isabelle/HOLCF. The assertion language is modeled in such a...
DSN
2004
IEEE
14 years 3 days ago
2004
IEEE
The authors describe the use of bounded model checking (BMC) for verifying Web application code. Vulnerable sections of code are patched automatically with runtime guards, allowin...
SAS
2009
Springer
14 years 9 months ago
2009
Springer
The Java programming language requires that out-of-bounds array accesses produce runtime exceptions. In general, this requires a dynamic bounds check each time an array element is...