Sciweavers

121 search results - page 2 / 25
» Efficient algorithms for verifying memory consistency
Sort
View
CAV
2009
Springer
177views Hardware» more  CAV 2009»
14 years 6 months ago
Software Transactional Memory on Relaxed Memory Models
Abstract. Pseudo-code descriptions of STMs assume sequentially consistent program execution and atomicity of high-level STM operations like read, write, and commit. These assumptio...
Rachid Guerraoui, Thomas A. Henzinger, Vasu Singh
IPPS
1996
IEEE
13 years 9 months ago
Dag-Consistent Distributed Shared Memory
We introduce dag consistency, a relaxed consistency model for distributed shared memory which is suitable for multithreaded programming. We have implemented dag consistency in sof...
Robert D. Blumofe, Matteo Frigo, Christopher F. Jo...
FORTE
1990
13 years 6 months ago
Verifying Bisimulations "On the Fly"
This paper describes a decision procedure for bisimulation-based equivalence relations between labeled transition systems. The algorithm usually performed in order to verify bisim...
Jean-Claude Fernandez, Laurent Mounier
TACAS
1998
Springer
98views Algorithms» more  TACAS 1998»
13 years 9 months ago
Efficient Modeling of Memory Arrays in Symbolic Ternary Simulation
This paper enables symbolic ternary simulation of systems with large embedded memories. Each memory array is replaced with a behavioral model, where the number of symbolic variable...
Miroslav N. Velev, Randal E. Bryant
SP
2008
IEEE
187views Security Privacy» more  SP 2008»
13 years 5 months ago
Efficient and Robust TCP Stream Normalization
Network intrusion detection and prevention systems are vulnerable to evasion by attackers who craft ambiguous traffic to breach the defense of such systems. A normalizer is an inl...
Mythili Vutukuru, Hari Balakrishnan, Vern Paxson