Changes between Version 16 and Version 17 of FraDeCoPP2012
- Timestamp:
- May 29, 2012, 4:59:01 AM (6 years ago)
Legend:
- Unmodified
- Added
- Removed
- Modified
-
FraDeCoPP2012
v16 v17 17 17 10:00-10:30 Accueil [[BR]] 18 18 [[BR]] 19 10:30-11h15 Kiminori Matsuzaki : Constructive Algorithmic ([[ t.pdf|slides]])[[BR]]19 10:30-11h15 Kiminori Matsuzaki : Constructive Algorithmic ([[http://tesson.julien.free.fr/research/FraDeCoPP/FraDeCoPP_Matsuzaki_Constructive_algorithmics.pdf|slides]])[[BR]] 20 20 [[BR]] 21 11:15-12:00 Julien Tesson : Mechanisation of constructive algorithmic with Coq ([[ t.pdf |slides]])[[BR]]21 11:15-12:00 Julien Tesson : Mechanisation of constructive algorithmic with Coq ([[http://tesson.julien.free.fr/research/FraDeCoPP/FraDeCoPP_Tesson_constructive_algorithmics_in_coq.pdf |slides]])[[BR]] 22 22 [[BR]] 23 23 12:00-13:30 Lunch[[BR]] 24 24 [[BR]] 25 13:30-14:15 Matthieu Giorgino : Proofs of pointer algorithms by inductive representation of graphs ([#absgio abstract] | [[ FraDeCoPP_Giorgino_proof_of_pointer_algorithm.pdf| slides]])[[BR]]25 13:30-14:15 Matthieu Giorgino : Proofs of pointer algorithms by inductive representation of graphs ([#absgio abstract] | [[http://tesson.julien.free.fr/research/FraDeCoPP/FraDeCoPP_Giorgino_proof_of_pointer_algorithm.pdf| slides]])[[BR]] 26 26 [[BR]] 27 14:15-15:30 Vladimir Komendantsky : Cost analysis for patterns of parallelism ([#abskome abstract] | [[ FraDeCoPP_Komendantsky.pdf|slides]] )[[BR]]27 14:15-15:30 Vladimir Komendantsky : Cost analysis for patterns of parallelism ([#abskome abstract] | [[http://tesson.julien.free.fr/research/FraDeCoPP/FraDeCoPP_Komendantsky.pdf|slides]] )[[BR]] 28 28 [[BR]] 29 29 15:30-16:00 Coffee break[[BR]] 30 30 [[BR]] 31 16:00-16:45 Frédéric Gava : Verification of imperative BSP programs [[FraDeCoPP_Fortin_Gava_verif_imperative_bsp.pdf| slides]])[[BR]]31 16:00-16:45 Frédéric Gava : Verification of imperative BSP programs ([[http://tesson.julien.free.fr/research/FraDeCoPP/FraDeCoPP_Fortin_Gava_verif_imperative_bsp.pdf| slides]])[[BR]] 32 32 [[BR]] 33 33 16:45-18:00 Discussion / Démos [[BR]]