PLDI
2011
ACM
13 years 2 months ago
2011
ACM
Fixing software bugs has always been an important and timeconsuming process in software development. Fixing concurrency bugs has become especially critical in the multicore era. H...
PLDI
2011
ACM
13 years 2 months ago
2011
ACM
We present a strictly bottom-up, summary-based, and precise heap analysis targeted for program verification that performs strong updates to heap locations at call sites. We firs...
PLDI
2011
ACM
13 years 2 months ago
2011
ACM
The performance benefits of GPU parallelism can be enormous, but unlocking this performance potential is challenging. The applicability and performance of GPU parallelizations is...
PLDI
2011
ACM
13 years 2 months ago
2011
ACM
Energy is increasingly a first-order concern in computer systems. Exploiting energy-accuracy trade-offs is an attractive choice in applications that can tolerate inaccuracies. Re...
PLDI
2011
ACM
13 years 2 months ago
2011
ACM
When dealing with dynamic, untrusted content, such as on the Web, software behavior must be sandboxed, typically through use of a language like JavaScript. However, even for such ...
PADL
2011
Springer
13 years 2 months ago
2011
Springer
Modern challenges led to a design of a wide range of programming models for reactive, parallel and concurrent programming, but these are often t to encode in general purpose langua...
PADL
2011
Springer
13 years 2 months ago
2011
Springer
Abstract. Modern web forms interact with the user in real-time by detecting errors and filling-in implied values, which in terms of automated reasoning amounts to SAT solving and ...
LR
2011
13 years 2 months ago
2011
Abstract We present methods and tools for modeling autonomously controlled production networks and investigation of their stability properties. Production networks are described as...
LR
2011
13 years 2 months ago
2011
Abstract Communities of autonomous units are devices for the visual modeling of interactive logistic processes. The framework is founded on rule-based graph transformation and allo...
LOGCOM
2011
13 years 2 months ago
2011
Planning as Satisfiability is one of the most well-known and effective techniques for classical planning: satplan has been the winning system in the deterministic track for optim...