Difference between revisions of "VerifGroup"

From STATOR
Jump to navigation Jump to search
(wg)
 
m
Line 6: Line 6:
 
<li> Each week, on Tuesday, at 2pm, a student explains a paper (or a bench of
 
<li> Each week, on Tuesday, at 2pm, a student explains a paper (or a bench of
 
   papers) in less that 30 min. This should not last more than an hour,
 
   papers) in less that 30 min. This should not last more than an hour,
   including visioconferences problem</li>
+
   including visioconferences problems</li>
 
<li> Tuesday, Jan 31 2017 : Julien Braine, SAS13 on horn clauses and
 
<li> Tuesday, Jan 31 2017 : Julien Braine, SAS13 on horn clauses and
 
   array abstractions
 
   array abstractions
  : <a href="https://www7.informatik.tu-muenchen.de/~rybal/papers/2013-sas-solving-universally-quantified-horn-clauses.pdf">paper</a>, <a href="julien_2017_01.pdf">slides</a></li>
+
[paper|https://www7.informatik.tu-muenchen.de/~rybal/papers/2013-sas-solving-universally-quantified-horn-clauses.pdf] [slides|julien_2017_01.pdf]</li>
   <li> Tuesday, Feb 7, 2017 : Rémy xx, on interprocedural polyhedral
+
   <li> Tuesday, Feb 7, 2017 : Rémy Boutonnet, on interprocedural polyhedral
   invariant generation : cite papers ? <a href="remi_2017_02.pdf">slides</a></li>
+
   invariant generation : cite papers ? [slides|remi_2017_02.pdf]</li>
<li> Tuesday, Feb 7, 2017 : Laure Gonnord, on termination of
+
<li> Tuesday, Feb 14, 2017 : Laure Gonnord, on termination of
   sequential
+
   sequential programs [paper|https://hal.archives-ouvertes.fr/hal-01144622]] (PLDI15) [slides|laure_2017_03.pdf] Lyon : Salle du Conseil. Verimag : TBD. </li>
  programs <a href="https://hal.archives-ouvertes.fr/hal-01144622">paper (PLDI15)</a>, <a href="laure_2017_03.pdf">slides</a>. Lyon
 
  : Salle du Conseil. Verimag : TBD. </li>
 

Revision as of 15:24, 10 February 2017

Verification WG -Grenoble/Lyon

  • The reading group is open to anyone interested in program verification in Lip and Verimag.
  • Each week, on Tuesday, at 2pm, a student explains a paper (or a bench of papers) in less that 30 min. This should not last more than an hour, including visioconferences problems
  • Tuesday, Jan 31 2017 : Julien Braine, SAS13 on horn clauses and array abstractions [paper|https://www7.informatik.tu-muenchen.de/~rybal/papers/2013-sas-solving-universally-quantified-horn-clauses.pdf] [slides|julien_2017_01.pdf]
  • Tuesday, Feb 7, 2017 : Rémy Boutonnet, on interprocedural polyhedral invariant generation : cite papers ? [slides|remi_2017_02.pdf]
  • Tuesday, Feb 14, 2017 : Laure Gonnord, on termination of sequential programs [paper|https://hal.archives-ouvertes.fr/hal-01144622]] (PLDI15) [slides|laure_2017_03.pdf] Lyon : Salle du Conseil. Verimag : TBD.