This paper proposes a technique to specify and verify whether a loop can be parallelised. Our approach can be used as an additional step in a parallelising compiler to verify user annotations about loop dependences. Essentially, our technique requires each loop iteration to be specified with the locations it will read and write. From the loop iteration specifications, the loop (in)dependences can be derived. Moreover, the loop iteration specifications also reveal where synchronisation is needed in the parallelised program. The loop iteration specifications can be verified using permission-based separation logic
A simple but general parallel programming language is considered. The semantics of programs is defin...
AVA (similar comments apply to C, C++, or C#). Hence, not only isthere a lack of heuristic technique...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 2012.Speculative parallelizatio...
This paper proposes a technique to specify and verify whether a loop can be parallelised. Our ap-pro...
Writing correct parallel programs becomes more and more difficult as the complexity and heterogeneit...
This thesis presents a set of verification techniques based on permission-based separation logic to ...
Abstract. Loops and other unbound control structures constitute a major bottleneck in formal softwar...
This thesis explores two kinds of program logics that have become important for modern program verif...
This paper presents the VerCors approach to verification of concurrent software. It first discusses ...
Abstract. This paper presents the VerCors approach to verification of concurrent software. It first ...
This work leverages an original dependency analysis to parallelize loops regardless of their form i...
Parallelization of programs relies on sound and precise analysis of data dependences in the code, sp...
Separation logic is a recent approach to the analysis of pointer programs in which resource separati...
AbstractThe current ubiquity of multi-core processors has brought renewed interest in program parall...
This paper presents a fully automatic approach to loop paralleliza-tion that integrates the use of s...
A simple but general parallel programming language is considered. The semantics of programs is defin...
AVA (similar comments apply to C, C++, or C#). Hence, not only isthere a lack of heuristic technique...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 2012.Speculative parallelizatio...
This paper proposes a technique to specify and verify whether a loop can be parallelised. Our ap-pro...
Writing correct parallel programs becomes more and more difficult as the complexity and heterogeneit...
This thesis presents a set of verification techniques based on permission-based separation logic to ...
Abstract. Loops and other unbound control structures constitute a major bottleneck in formal softwar...
This thesis explores two kinds of program logics that have become important for modern program verif...
This paper presents the VerCors approach to verification of concurrent software. It first discusses ...
Abstract. This paper presents the VerCors approach to verification of concurrent software. It first ...
This work leverages an original dependency analysis to parallelize loops regardless of their form i...
Parallelization of programs relies on sound and precise analysis of data dependences in the code, sp...
Separation logic is a recent approach to the analysis of pointer programs in which resource separati...
AbstractThe current ubiquity of multi-core processors has brought renewed interest in program parall...
This paper presents a fully automatic approach to loop paralleliza-tion that integrates the use of s...
A simple but general parallel programming language is considered. The semantics of programs is defin...
AVA (similar comments apply to C, C++, or C#). Hence, not only isthere a lack of heuristic technique...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 2012.Speculative parallelizatio...