This thesis takes part in the formal verification of parallel programs. The aim of formal verification is to ensure that a program will run as it should, without making mistakes, blocking, or terminating abnormally. This is even more important in the parallel computation field, where the cost of calculations can be very high. The BSP model (Bulk Synchronous Parallelism) is a model of parallelism well suited for the use of formal methods. It guarantees a structure in the parallel program, by organising it into super-steps, each of them consisting of a phase of computations, then communications between the processes. In this thesis, we chose to extend an existing tool to adapt it for the proof of BSP programs. We based ourselves on Why, a VCG...
A simple but general parallel programming language is considered. The semantics of programs is defin...
This work proposes and demonstrates a novel method for software development that applies formal veri...
International audienceThis paper presents a Bulk-Synchronous Parallel (BSP) algorithm to compute the...
This thesis takes part in the formal verification of parallel programs. The aim of formal verificati...
We present BSP-Why, a tool for verifying BSP programs. It is in-tended to be used as an intermediate...
AbstractPaderborn’s and Oxford’s BSPLib are C libraries supporting the development of Bulk-Synchrono...
Parallel program design and implementation is a complex, error prone task. Verifying parallel progra...
Research Report RR-2010-01With the current generalization of parallel architectures arises the conce...
Abstract. PUB (Paderborn University BSPLib) is a C library support-ing the development of Bulk-Synch...
Abstract — With the current generalisation of parallel archi-tectures arises the concern of applying...
It has long been a challenge to determine conclusively whether a given protocol is secure or not. Th...
Concurrency is often an optimisation, rather than intrinsic to the functional behaviour of a program...
Concevoir et implanter des programmes parallèles est une tâche complexe, sujette aux erreurs. La vér...
This thesis is set in the domain of deductive verification of programs, which consists of transformi...
The BSP model is an established practical general-purpose parallel programming model. This paper pre...
A simple but general parallel programming language is considered. The semantics of programs is defin...
This work proposes and demonstrates a novel method for software development that applies formal veri...
International audienceThis paper presents a Bulk-Synchronous Parallel (BSP) algorithm to compute the...
This thesis takes part in the formal verification of parallel programs. The aim of formal verificati...
We present BSP-Why, a tool for verifying BSP programs. It is in-tended to be used as an intermediate...
AbstractPaderborn’s and Oxford’s BSPLib are C libraries supporting the development of Bulk-Synchrono...
Parallel program design and implementation is a complex, error prone task. Verifying parallel progra...
Research Report RR-2010-01With the current generalization of parallel architectures arises the conce...
Abstract. PUB (Paderborn University BSPLib) is a C library support-ing the development of Bulk-Synch...
Abstract — With the current generalisation of parallel archi-tectures arises the concern of applying...
It has long been a challenge to determine conclusively whether a given protocol is secure or not. Th...
Concurrency is often an optimisation, rather than intrinsic to the functional behaviour of a program...
Concevoir et implanter des programmes parallèles est une tâche complexe, sujette aux erreurs. La vér...
This thesis is set in the domain of deductive verification of programs, which consists of transformi...
The BSP model is an established practical general-purpose parallel programming model. This paper pre...
A simple but general parallel programming language is considered. The semantics of programs is defin...
This work proposes and demonstrates a novel method for software development that applies formal veri...
International audienceThis paper presents a Bulk-Synchronous Parallel (BSP) algorithm to compute the...