Changes between Version 15 and Version 16 of FraDeCoPP2012

Timestamp:

May 29, 2012, 3:01:01 AM (6 years ago)

Author:

julien.tesson@…

Comment:

--

FraDeCoPP2012

@@ -14 +14 @@
 
 == Program ==
-temporary Program subject to modification
 
 10:00-10:30  Accueil [[BR]]
 [[BR]]
-10:30-11h15  Kiminori Matsuzaki : Constructive Algorithmic[[BR]]
+10:30-11h15  Kiminori Matsuzaki : Constructive Algorithmic ([[t.pdf |slides]])[[BR]]
 [[BR]]
-11:15-12:00  Julien Tesson : Mechanisation of constructive algorithmic with Coq[[BR]]
+11:15-12:00  Julien Tesson : Mechanisation of constructive algorithmic with Coq ([[t.pdf |slides]])[[BR]]
 [[BR]]
 12:00-13:30  Lunch[[BR]]
 [[BR]]
-13:30-14:15  Matthieu Giorgino : Proofs of pointer algorithms by inductive representation of graphs ([#absgio abstract])[[BR]]
+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]]
 [[BR]]
-14:15-15:30  Vladimir Komendantsky : Cost analysis for patterns of parallelism ([#abskome abstract])[[BR]]
+14:15-15:30  Vladimir Komendantsky : Cost analysis for patterns of parallelism ([#abskome abstract] | [[FraDeCoPP_Komendantsky.pdf|slides]] )[[BR]]
 [[BR]]
 15:30-16:00 Coffee break[[BR]]
 [[BR]]
-16:00-16:45 Frédéric Gava : Verification of imperative BSP programs [[BR]]
+16:00-16:45 Frédéric Gava : Verification of imperative BSP programs [[FraDeCoPP_Fortin_Gava_verif_imperative_bsp.pdf| slides]])[[BR]]
 [[BR]]
 16:45-18:00 Discussion / Démos [[BR]]
@@ -41 +40 @@
 [[BR]]
 
+[=#abskom]
 Vladimir Komendantsky : Cost analysis for patterns of parallelism [[BR]]
  Several notions of cost analysis have been introduced in the literature for functional programs that produce structured (a.k.a. shapely) data. Departing from pure data, I propose a higher-order cost analysis for pattern matching programs (skeletons) that produce functional programs. The proposal employs the pattern matching calculus due to Barry Jay. I will illustrate the idea on a divide-and-conquer pattern implementation in that calculus.[[BR]]
@@ -72 +72 @@
 
 
-
-
 == Talk Proposal ==