Sciweavers

80 search results - page 11 / 16
» PVS
Sort
View
ACTA
2011
13 years 4 months ago
Nonatomic dual bakery algorithm with bounded tokens
A simple mutual exclusion algorithm is presented that only uses nonatomic shared variables of bounded size, and that satisfies bounded overtaking. When the shared variables behave...
Alex A. Aravind, Wim H. Hesselink
CADE
2006
Springer
14 years 10 months ago
On the Strength of Proof-Irrelevant Type Theories
We present a type theory with some proof-irrelevance built into the conversion rule. We argue that this feature is useful when type theory is used as the logical formalism underlyi...
Benjamin Werner
SSS
2009
Springer
138views Control Systems» more  SSS 2009»
14 years 4 months ago
Analysis of Wireless Sensor Network Protocols in Dynamic Scenarios
We describe an approach to the analysis of protocols for wireless sensor networks in scenarios with mobile nodes and dynamic link quality. The approach is based on the theorem prov...
Cinzia Bernardeschi, Paolo Masci, Holger Pfeifer
CCS
1997
ACM
14 years 2 months ago
The Security of Static Typing with Dynamic Linking
Dynamic linking is a requirement for portable executable content. Executable content cannot know, ahead of time, where it is going to be executed, nor know the proper operating sy...
Drew Dean
CHARME
2001
Springer
162views Hardware» more  CHARME 2001»
14 years 1 months ago
Parameterized Verification of the FLASH Cache Coherence Protocol by Compositional Model Checking
We consider the formal verification of the cache coherence protocol of the Stanford FLASH multiprocessor for N processors. The proof uses the SMV proof assistant, a proof system ba...
Kenneth L. McMillan