1452 search results - page 45 / 291 » Algorithmic Analysis of Array-Accessing Programs |
TACAS
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. We propose a symbolic algorithm to accurately predict atomicity violations by analyzing a concrete execution trace of a concurrent program. We use both the execution trac...
PPOPP
1999
ACM
14 years 2 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
ICFP
1997
ACM
14 years 2 months ago
1997
ACM
We observe that the principal typing property of a type system is the enabling technology for modularity and separate compilation [10]. We use this technology to formulate a modul...
ADVAI
2010
13 years 4 months ago
2010
The focus of warfare has shifted from the Industrial Age to the Information Age, as encapsulated by the term Network Enabled Capability. This emphasises information sharing, comma...
STOC
2007
ACM
14 years 10 months ago
2007
ACM
Semidefinite programs (SDP) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-know...