10 search results - page 1 / 2 » Fast complete memory consistency verification |
88
Voted
HPCA
2009
IEEE
16 years 28 days ago
2009
IEEE
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...
140
Voted
SOSP
2009
ACM
15 years 9 months ago
2009
ACM
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...
103
Voted
ISCA
2007
IEEE
15 years 6 months ago
2007
IEEE
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...
106
click to vote
CORR
2010
Springer
15 years 14 days ago
2010
Springer
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...
111
Voted
GECCO
1999
Springer
15 years 4 months ago
1999
Springer
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...