Sciweavers

3909 search results - page 468 / 782
» Extreme Model Checking
Sort
View
ISW
2005
Springer
15 years 10 months 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...
151
Voted
CAV
2004
Springer
96views Hardware» more  CAV 2004»
15 years 10 months ago
Widening Arithmetic Automata
Model checking of infinite state systems is undecidable, therefore, there are instances for which fixpoint computations used in infinite state model checkers do not converge. Gi...
Constantinos Bartzis, Tevfik Bultan
130
Voted
IPPS
2003
IEEE
15 years 10 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 10 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
IPPS
2003
IEEE
15 years 10 months ago
Founding FireWire Bridges through Promela Prototyping
The standardisation procedure of the IEEE P1394.1 Draft Standard for High Performance Serial Bus Bridges is supported through the use of the state-of-the-art model checker Spin, w...
Izak van Langevelde, Judi Romijn, Nicolae Goga