Sciweavers

10 search results - page 1 / 2
» Fast complete memory consistency verification
Sort
View
HPCA
2009
IEEE
14 years 5 months ago
Fast complete memory consistency verification
The verification of an execution against memory consistency is known to be NP-hard. This paper proposes a novel fast memory consistency verification method by identifying a new na...
Yunji Chen, Yi Lv, Weiwu Hu, Tianshi Chen, Haihua ...
SOSP
2009
ACM
14 years 1 months ago
Better I/O through byte-addressable, persistent memory
Modern computer systems have been built around the assumption that persistent storage is accessed via a slow, block-based interface. However, new byte-addressable, persistent memo...
Jeremy Condit, Edmund B. Nightingale, Christopher ...
ISCA
2007
IEEE
174views Hardware» more  ISCA 2007»
13 years 11 months ago
An integrated hardware-software approach to flexible transactional memory
There has been considerable recent interest in the support of transactional memory (TM) in both hardware and software. We present an intermediate approach, in which hardware is us...
Arrvindh Shriraman, Michael F. Spear, Hemayet Hoss...
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 5 months ago
Sawja: Static Analysis Workshop for Java
Abstract. Static analysis is a powerful technique for automatic verification of programs but raises major engineering challenges when developing a full-fledged analyzer for a reali...
Laurent Hubert, Nicolas Barré, Fréd&...
GECCO
1999
Springer
142views Optimization» more  GECCO 1999»
13 years 9 months ago
Towards Byte Code Genetic Programming
This paper uses the GP paradigm to evolve linear genotypes (individuals) that consist of Java byte code. Our prototype GP system is implemented in Java using a standard Java devel...
Brad Harvey, James A. Foster, Deborah A. Frincke