Sciweavers

50 search results - page 5 / 10
» State-Space Caching Revisited
Sort
View
KBSE
2009
IEEE
14 years 2 months ago
Cache-Based Model Checking of Networked Applications: From Linear to Branching Time
Abstract—Many applications are concurrent and communicate over a network. The non-determinism in the thread and communication schedules makes it desirable to model check such sys...
Cyrille Artho, Watcharin Leungwattanakit, Masami H...
IPPS
1998
IEEE
13 years 11 months ago
Deriving Efficient Cache Coherence Protocols through Refinement
Abstract. We address the problem of developing efficient cache coherence protocols implementing distributed shared memory (DSM) using message passing. A serious drawback of traditi...
Ratan Nalumasu, Ganesh Gopalakrishnan
ASE
2004
167views more  ASE 2004»
13 years 7 months ago
Cluster-Based Partial-Order Reduction
The verification of concurrent systems through an exhaustive traversal of the state space suffers from the infamous state-space-explosion problem, caused by the many interleavings ...
Twan Basten, Dragan Bosnacki, Marc Geilen
FOSSACS
2009
Springer
14 years 2 months ago
Facets of Synthesis: Revisiting Church's Problem
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
Wolfgang Thomas
CF
2007
ACM
13 years 11 months ago
Speculative supplier identification for reducing power of interconnects in snoopy cache coherence protocols
In this work we reduce interconnect power dissipation in Symmetric Multiprocessors or SMPs. We revisit snoopy cache coherence protocols and reduce unnecessary interconnect activit...
Ehsan Atoofian, Amirali Baniasadi, Kaveh Aasaraai