Sciweavers

7099 search results - page 350 / 1420
» Context for models of concurrency
Sort
View
DCC
2006
IEEE
16 years 7 months ago
Low-Complexity Compression of Short Messages
We describe a low-complexity scheme for lossless compression of short text messages. The method uses arithmetic coding and a specific statistical context model for prediction of s...
Stephan Rein, Clemens Gühmann, Frank H. P. Fi...
OSDI
2002
ACM
16 years 7 months ago
Using Model Checking to Debug Device Firmware
Device firmware is a piece of concurrent software that achieves high performance at the cost of software complexity. They contain subtle race conditions that make them difficult t...
Sanjeev Kumar, Kai Li
SOFSEM
2007
Springer
16 years 1 months ago
Games, Time, and Probability: Graph Models for System Design and Analysis
Digital technology is increasingly deployed in safety-critical situations. This calls for systematic design and verification methodologies that can cope with three major sources o...
Thomas A. Henzinger
POPL
2010
ACM
16 years 5 months ago
On the Verification Problem for Weak Memory Models
We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operation...
Ahmed Bouajjani, Madanlal Musuvathi, Mohamed Faouz...
TACAS
2004
Springer
122views Algorithms» more  TACAS 2004»
16 years 27 days ago
A Scalable Incomplete Test for the Boundedness of UML RT Models
Abstract. We describe a scalable incomplete boundedness test for the communication buffers in UML RT models. UML RT is a variant of the UML modeling language, tailored to describin...
Stefan Leue, Richard Mayr, Wei Wei