Sciweavers

507 search results - page 50 / 102
» Testing implementations of transactional memory
Sort
View
BIBM
2007
IEEE
132views Bioinformatics» more  BIBM 2007»
14 years 4 months ago
A Divide-and-Conquer Implementation of Three Sequence Alignment and Ancestor Inference
In this paper, we present an algorithm to simultaneously align three biological sequences with affine gap model and infer their common ancestral sequence. Our algorithm can be fu...
Feng Yue, Jijun Tang
ESOP
2012
Springer
12 years 6 months ago
Concurrent Library Correctness on the TSO Memory Model
Abstract. Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms. Unfortunately, it is only appropriate for sequentially consistent mem...
Sebastian Burckhardt, Alexey Gotsman, Madanlal Mus...
PLDI
2010
ACM
14 years 3 months ago
Adversarial memory for detecting destructive races
Multithreaded programs are notoriously prone to race conditions, a problem exacerbated by the widespread adoption of multi-core processors with complex memory models and cache coh...
Cormac Flanagan, Stephen N. Freund
VLDB
2002
ACM
112views Database» more  VLDB 2002»
13 years 10 months ago
Fast and Accurate Text Classification via Multiple Linear Discriminant Projections
Abstract. Support vector machines (SVMs) have shown superb performance for text classification tasks. They are accurate, robust, and quick to apply to test instances. Their only po...
Soumen Chakrabarti, Shourya Roy, Mahesh V. Soundal...
ISSRE
2002
IEEE
14 years 3 months ago
Saturation Effects in Testing of Formal Models
Formal analysis of software is a powerful analysis tool, but can be too costly. Random search of formal models can reduce that cost, but is theoretically incomplete. However, rand...
Tim Menzies, David Owen, Bojan Cukic