Sciweavers

63 search results - page 4 / 13
» Proving Atomicity: An Assertional Approach
Sort
View
NCA
2007
IEEE
14 years 1 months ago
Implementing Atomic Data through Indirect Learning in Dynamic Networks
Developing middleware services for dynamic distributed systems, e.g., ad-hoc networks, is a challenging task given that such services deal with dynamically changing membership and...
Kishori M. Konwar, Peter M. Musial, Nicolas C. Nic...
TPHOL
2008
IEEE
14 years 1 months ago
Lightweight Separation
Abstract. Lightweight separation is a novel approach to automatic reasoning about memory updates in pointer programs. It replaces the spatial formulae of separation logic, which co...
Holger Gast
JUCS
2008
166views more  JUCS 2008»
13 years 7 months ago
ASM Refinement Preserving Invariants
: This paper gives a definition of ASM refinement suitable for the verification that a protocol implements atomic transactions. We used this definition as the basis of the formal v...
Gerhard Schellhorn
ISSTA
2009
ACM
14 years 1 months ago
An annotation assistant for interactive debugging of programs with common synchronization idioms
This paper explores an approach to improving the practical usability of static verification tools for debugging synchronization idioms. Synchronization idioms such as mutual excl...
Tayfun Elmas, Ali Sezgin, Serdar Tasiran, Shaz Qad...
ENTCS
2007
129views more  ENTCS 2007»
13 years 7 months ago
Protocol Composition Logic (PCL)
Protocol Composition Logic (PCL) is a logic for proving security properties of network protocols that use public and symmetric key cryptography. The logic is designed around a pro...
Anupam Datta, Ante Derek, John C. Mitchell, Arnab ...