Revision as of 15:57, 11 February 2014 by David Monniaux (talk | contribs) (Radu, David)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Pool of available subjects

David Monniaux

  1. (or Julien Henry) Worst-case execution time analysis of programs using SMT and a clever encoding
  2. Single-cell abstraction of arrays

Radu Iosif

  1. Safety Problems are NP-complete for Flat Integer Programs with Octagonal Loops (a tutorial on rigorous acceleration techniques)
  2. Underapproximation of Procedure Summaries for Integer Programs + Polynomially Bounded Control Sets (higher-order acceleration or acceleration for recursive programs)
  3. The Tree Width of Separation Logic with Recursive Definitions + Deciding Entailments in Inductive Separation Logic with Tree Automata (a tutorial on Separation Logic for compositional program analysis with emphasis on decidability issues)