02 November 2011, 09h00 - 02 November 2011, 18h30 Salle/Bat : 465/PCRI-N
Contact : Burkhart Wolff
Activités de recherche :
Résumé :
Interactive theorem proving is a technology of fundamental importance for mathematics and computer science.
Interactive development of larger and larger proofs increases the demand for computing power, which means explicit
parallelism on current multicore hardware.
The project intends to overcome the sequential model both for Coq and Isabelle, to make the
resources of multi-core hardware available for even larger proof developments. Beyond traditional processing
of proof scripts as sequence of proof commands, and batchloading of theory modules, there is a large space of
possibilities and challenges for pervasive parallelism. This a ffects many layers of each prover system: basic
computational structures, inference kernel, tactical programming, proof command language, and interactive
front-ends.
Sur le nombre des (d,k)-polytopes
Combinatoire
Friday 24 May 2019 - 14h30
Salle : 455 - PCRI-N
Rado Rakotonarivo
.............................................
Simulation of the M13 infection in E.coli
Algorithmique distribuée
Friday 10 May 2019 - 14h00
Salle : 465 - PCRI-N
Da-Jung Cho
.............................................
