151
click to vote
CCE
2011
14 years 8 months ago
2011
During the last 15 years, many mathematical models have been developed in order to solve process operation scheduling problems, using discrete or continuous time representations. ...
267
click to vote
CC
2011
Springer
14 years 8 months ago
2011
Springer
For decades, the design and implementation of arrays in programming languages has reflected a natural tension between productivity and performance. Recently introduced HPCS langua...
262
click to vote
CC
2011
Springer
14 years 8 months ago
2011
Springer
Abstract. Heterogeneous multi-core platforms are increasingly prevalent due to their perceived superior performance over homogeneous systems. The best performance, however, can onl...
171
click to vote
CC
2011
Springer
14 years 8 months ago
2011
Springer
Abstract. We present a disjoint reachability analysis for Java. Our analysis computes extended points-to graphs annotated with reachability states. Each heap annotated with a set o...
161
click to vote
CAV
2011
Springer
14 years 8 months ago
2011
Springer
Abstract. We present a novel static analysis technique that substantially improves the quality of invariants inferred by standard loop invariant generation techniques. Our techniqu...
153
click to vote
CAV
2011
Springer
14 years 8 months ago
2011
Springer
We updated our Peggy tool, previously presented in [6], to perform translation validation for the LLVM compiler using a technique called Equality Saturation. We present the tool, a...
151
click to vote
CAV
2011
Springer
14 years 8 months ago
2011
Springer
Abstract. A fundamental question in the treatment of cardiac disorders, such as tachycardia and fibrillation, is under what circumstances does such a disorder arise? To answer to ...
150
click to vote
CAV
2011
Springer
14 years 8 months ago
2011
Springer
Abstract. Many automatic testing, analysis, and verification techniques for programs can effectively be reduced to a constraint-generation phase followed by a constraint-solving ...
153
click to vote
CAV
2011
Springer
14 years 8 months ago
2011
Springer
Abstract. Quantified Boolean formulae (QBF) allow compact encoding of many decision problems. Their importance motivated the development of fast QBF solvers. Certifying the result...