Sciweavers

6740 search results - page 767 / 1348
» Using Classification as a Programming Language
Sort
View
PLDI
2009
ACM
16 years 2 months ago
LiteRace: effective sampling for lightweight data-race detection
Data races are one of the most common and subtle causes of pernicious concurrency bugs. Static techniques for preventing data races are overly conservative and do not scale well t...
Daniel Marino, Madanlal Musuvathi, Satish Narayana...
ASPLOS
1994
ACM
15 years 11 months ago
Compiler Optimizations for Improving Data Locality
In the past decade, processor speed has become significantly faster than memory speed. Small, fast cache memories are designed to overcome this discrepancy, but they are only effe...
Steve Carr, Kathryn S. McKinley, Chau-Wen Tseng
179
Voted
TACAS
2007
Springer
103views Algorithms» more  TACAS 2007»
16 years 1 months ago
A Reachability Predicate for Analyzing Low-Level Software
Reasoning about heap-allocated data structures such as linked lists and arrays is challenging. The reachability predicate has proved to be useful for reasoning about the heap in ty...
Shaunak Chatterjee, Shuvendu K. Lahiri, Shaz Qadee...
167
Voted
CLUSTER
2006
IEEE
16 years 1 months ago
FAIL-MPI: How Fault-Tolerant Is Fault-Tolerant MPI?
One of the topics of paramount importance in the development of Cluster and Grid middleware is the impact of faults since their occurrence in Grid infrastructures and in large-sca...
William Hoarau, Pierre Lemarinier, Thomas Hé...
187
Voted
FASE
2001
Springer
15 years 12 months ago
A Hoare Calculus for Verifying Java Realizations of OCL-Constrained Design Models
Abstract. The Object Constraint Language OCL offers a formal notation for constraining the modelling elements occurring in UML diagrams. In this paper we apply OCL for developing ...
Bernhard Reus, Martin Wirsing, Rolf Hennicker