Sciweavers

97 search results - page 16 / 20
» Making Nondeterminism Unambiguous
Sort
View
ASPLOS
2010
ACM
14 years 3 months ago
Analyzing multicore dumps to facilitate concurrency bug reproduction
Debugging concurrent programs is difficult. This is primarily because the inherent non-determinism that arises because of scheduler interleavings makes it hard to easily reproduc...
Dasarath Weeratunge, Xiangyu Zhang, Suresh Jaganna...
EMSOFT
2007
Springer
14 years 3 months ago
Design and implementation of a comprehensive real-time java virtual machine
The emergence of standards for programming real-time systems in Java has encouraged many developers to consider its use for systems previously only built using C, Ada, or assembly...
Joshua S. Auerbach, David F. Bacon, Bob Blainey, P...
VSTTE
2005
Springer
14 years 2 months ago
Verifying Design with Proof Scores
: Verifying design instead of code can be an effective and practical approach to obtaining verified software. This paper argues that proof scores are an attractive method for ver...
Kokichi Futatsugi, Joseph A. Goguen, Kazuhiro Ogat...
ICSE
2010
IEEE-ACM
13 years 11 months ago
DETERMIN: inferring likely deterministic specifications of multithreaded programs
The trend towards multicore processors and graphic processing units is increasing the need for software that can take advantage of parallelism. Writing correct parallel programs u...
Jacob Burnim, Koushik Sen
ANCS
2009
ACM
13 years 6 months ago
Divide and discriminate: algorithm for deterministic and fast hash lookups
Exact and approximate membership lookups are among the most widely used primitives in a number of network applications. Hash tables are commonly used to implement these primitive ...
Domenico Ficara, Stefano Giordano, Sailesh Kumar, ...