214 search results - page 8 / 43 » Automatic Correction of Loop Transformations |
119
Voted
TACAS
2010
Springer
14 years 10 months ago
2010
Springer
Systems and protocols combining concurrency and infinite state space occur quite often in practice, but are very difficult to verify automatically. At the same time, if the system ...
128
Voted
PPOPP
2009
ACM
16 years 29 days ago
2009
ACM
Recent advances in polyhedral compilation technology have made it feasible to automatically transform affine sequential loop nests for tiled parallel execution on multi-core proce...
107
click to vote
WDAG
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. This paper studies the impact of omission failures on asynchronous distributed systems with crash-stop failures. We provide two different transformations for algorithms,...
164
Voted
CONCUR
1993
Springer
15 years 4 months ago
1993
Springer
During the course of the last decade, a mathematical model for the parallelization of FOR-loops has become increasingly popular. In this model, a (perfect) nest of r FOR-loops is r...
106
Voted
CL
2000
Springer
15 years 4 months ago
2000
Springer
We use Kleene algebra with tests to verify a wide assortment of common compiler optimizations, including dead code elimination, common subexpression elimination, copy propagation,...