Sciweavers

246 search results - page 26 / 50
» A Proof System for Asynchronously Communicating Deterministi...
Sort
View
CSL
1999
Springer
15 years 7 months ago
A Truly Concurrent Semantics for a Simple Parallel Programming Language
Abstract. This paper represents the beginning of a study aimed at devising semantic models for true concurrency that provide clear distinctions between concurrency, parallelism and...
Paul Gastin, Michael W. Mislove
SPAA
2009
ACM
15 years 10 months ago
Locally scalable randomized consensus for synchronous crash failures
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
Bogdan S. Chlebus, Dariusz R. Kowalski
127
Voted
DFT
2008
IEEE
120views VLSI» more  DFT 2008»
15 years 9 months ago
Built-in-Self-Diagnostics for a NoC-Based Reconfigurable IC for Dependable Beamforming Applications
Integrated circuits (IC) targeting at the streaming applications for tomorrow are becoming a fast growing market. Applications such as beamforming require mass computing capabilit...
Oscar Kuiken, Xiao Zhang, Hans G. Kerkhoff
ISSTA
2009
ACM
15 years 9 months ago
Analyzing singularity channel contracts
This paper presents techniques for analyzing channel contract specifications in Microsoft Research’s Singularity operating system. A channel contract is a state machine that sp...
Zachary Stengel, Tevfik Bultan
COORDINATION
2009
Springer
16 years 3 months ago
Assume-Guarantee Verification of Concurrent Systems
Process algebras are a set of mathematically rigourous languages with well defined semantics that permit modelling behaviour of concurrent and communicating systems. Verification o...
Liliana D'Errico, Michele Loreti