Sciweavers

3224 search results - page 450 / 645
» On Checking Model Checkers
Sort
View
ISW
2005
Springer
16 years 22 hour ago
Universally Composable Time-Stamping Schemes with Audit
Abstract. We present a universally composable time-stamping scheme based on universal one-way hash functions. The model we use contains an ideal auditing functionality (implementab...
Ahto Buldas, Peeter Laud, Märt Saarepera, Jan...
IPPS
2003
IEEE
15 years 11 months ago
Task Graph Scheduling Using Timed Automata
In this paper we develop a methodology for treating the problem of scheduling partially-ordered tasks on parallel machines. Our framework is based on the timed automaton model, or...
Yasmina Abdeddaïm, Abdelkarim Kerbaa, Oded Ma...
IPPS
2003
IEEE
15 years 11 months ago
So Many States, So Little Time: Verifying Memory Coherence in the Cray X1
This paper investigates a complexity-effective technique for verifying a highly distributed directory-based cache coherence protocol. We develop a novel approach called “witnes...
Dennis Abts, Steve Scott, David J. Lilja
FORMATS
2003
Springer
15 years 11 months ago
Causal Time Calculus
We present a process algebra suitable to the modelling of timed concurrent systems and to their efficient verification through model checking. The algebra is provided with two con...
Franck Pommereau
ISSS
2000
IEEE
109views Hardware» more  ISSS 2000»
15 years 11 months ago
Verification of Embedded Systems using a Petri Net based Representation
The ever increasing complexity of embedded systems consisting of hardware and software components poses a challenge in verifying their correctness, New verification methods that o...
Luis Alejandro Cortés, Petru Eles, Zebo Pen...