International audienceThis paper presents an extension of a library for the Coq interactive theorem prover that enables the development of correct functional parallel programs based on sequential program transformation and automatic parallelization using an algorithmic skeleton named accumulate. Such an algorithmic skeleton is a pattern of a parallel algorithm that is provided as a high-order function implemented in parallel. The use of this framework is illustrated with the bracket matching problem, including experiments on a parallel machine
International audienceThis article describes the formal verification of a compilation algorithm that...
Concevoir et implanter des programmes parallèles est une tâche complexe, sujette aux erreurs. La vér...
[[abstract]]The design of a parallel theorem prover for first-order logic is described. The parallel...
International audienceSyDPaCC is a set of libraries for the Coq interactive theorem prover. It allow...
International audienceSyDPaCC is a set of libraries for the Coq proof assistant. It allows to write ...
Interactive theorem proving is a technology of fundamental importance for math-ematics and computer-...
To make parallel programming as widespread as parallel architectures, more structured parallel progr...
International audienceThe integration of the generate-and-test paradigm and semi-rings for the aggre...
. Algorithmic skeletons are polymorphic higher-order functions representing common parallelization p...
Parallel program design and implementation is a complex, error prone task. Verifying parallel progra...
Automated Theorem Proving can be interpreted as the solution of search problems which comprise huge ...
Abstract — With the current generalisation of parallel archi-tectures arises the concern of applying...
International audienceSkeletal parallelism offers a good trade-off between programming productivity ...
this paper, we propose a powerful and general parallel skeleton called accumulate and describe its e...
Research Report RR-2010-01With the current generalization of parallel architectures arises the conce...
International audienceThis article describes the formal verification of a compilation algorithm that...
Concevoir et implanter des programmes parallèles est une tâche complexe, sujette aux erreurs. La vér...
[[abstract]]The design of a parallel theorem prover for first-order logic is described. The parallel...
International audienceSyDPaCC is a set of libraries for the Coq interactive theorem prover. It allow...
International audienceSyDPaCC is a set of libraries for the Coq proof assistant. It allows to write ...
Interactive theorem proving is a technology of fundamental importance for math-ematics and computer-...
To make parallel programming as widespread as parallel architectures, more structured parallel progr...
International audienceThe integration of the generate-and-test paradigm and semi-rings for the aggre...
. Algorithmic skeletons are polymorphic higher-order functions representing common parallelization p...
Parallel program design and implementation is a complex, error prone task. Verifying parallel progra...
Automated Theorem Proving can be interpreted as the solution of search problems which comprise huge ...
Abstract — With the current generalisation of parallel archi-tectures arises the concern of applying...
International audienceSkeletal parallelism offers a good trade-off between programming productivity ...
this paper, we propose a powerful and general parallel skeleton called accumulate and describe its e...
Research Report RR-2010-01With the current generalization of parallel architectures arises the conce...
International audienceThis article describes the formal verification of a compilation algorithm that...
Concevoir et implanter des programmes parallèles est une tâche complexe, sujette aux erreurs. La vér...
[[abstract]]The design of a parallel theorem prover for first-order logic is described. The parallel...