Sciweavers

8 search results - page 1 / 2
» A Compositional Proof of a Real-Time Mutual Exclusion Protoc...
Sort
View
TAPSOFT
1997
Springer
13 years 11 months ago
A Compositional Proof of a Real-Time Mutual Exclusion Protocol
Kåre J. Kristoffersen, François Larou...
RTSS
1999
IEEE
13 years 11 months ago
On the Use of Formal Techniques for Analyzing Dependable Real-Time Protocols
The e ective design of composite dependable and real-time protocols entails demonstrating their proof of correctness and, in practice, the e cient delivery of services. We focus o...
Purnendu Sinha, Neeraj Suri
SRDS
2006
IEEE
14 years 1 months ago
Recovering from Distributable Thread Failures with Assured Timeliness in Real-Time Distributed Systems
We consider the problem of recovering from failures of distributable threads with assured timeliness. When a node hosting a portion of a distributable thread fails, it causes orph...
Edward Curley, Jonathan Stephen Anderson, Binoy Ra...
CCS
2005
ACM
14 years 1 months ago
A modular correctness proof of IEEE 802.11i and TLS
The IEEE 802.11i wireless networking protocol provides mutual authentication between a network access point and user devices prior to user connectivity. The protocol consists of s...
Changhua He, Mukund Sundararajan, Anupam Datta, An...
CAV
2012
Springer
223views Hardware» more  CAV 2012»
11 years 10 months ago
Detecting Fair Non-termination in Multithreaded Programs
Abstract. We develop compositional analysis algorithms for detecting nontermination in multithreaded programs. Our analysis explores fair and ultimatelyperiodic executions—i.e., ...
Mohamed Faouzi Atig, Ahmed Bouajjani, Michael Emmi...