Difference between revisions of "Infinite Systems Verification Day"

Revision as of 12:02, 19 July 2016

When: September 29th, 2016

Where: Auditorium, Ground Floor, IMAG Building

Registration: the event is free and open to the public

Travel and hotels: Grenoble local information

9:00 Welcome

9:30-10:30 Andreas Podelski (University of Freiburg)

Thread Modularity on the Next Level

A thread-modular proof for the correctness of a concurrent program is based on an inductive and interference-free annotation of each thread. It is well-known that the corresponding proof system is not complete (unless one adds auxiliary variables). We introduce a hierarchy of proof systems where each level k corresponds to a new notion of thread modular- ity (level 1 corresponds to the original notion). Each level is strictly more expressive than the previous. The hierarchy can be used to prove interesting programs. We give the to our knowledge first proof of the MACH shootdown algorithm for TLB consistency. The algorithm is correct for an arbitrary number of CPUs. This is joint work with Jochen Hoenicke and Rupak Majumdar.

10:30-11:30 Joel Ouaknine (Max Planck Institute for Software Systems and Oxford University)

TBA

11:30-12:30 Parosh Aziz Abdulla (Uppsala University)

TBA

14:00 Habilitation a Diriger des Recherches

Radu Iosif (Verimag) Automata and Logics for Program Verification

Jury:

• Alain Finkel (LSV, ENS de Cachan) rapporteur
• Parosh Aziz Abdulla (Uppsala University) rapporteur
• Joel Ouaknine (Max Planck Institute for Software Systems and Oxford University) rapporteur
• Ahmed Bouajjani (Universite Paris Diderot) examinateur
• Andreas Podelski (University of Freiburg) examinateur
• Nicolas Halbwachs (Verimag, CNRS, Universite de Grenoble Alpes) examinateur

Abstract In this thesis, we present several theoretical and practical results on program verification, the main purpose being that of providing cost-efficient solutions to problems that almost always belong to undecidable classes. We appeal to logic and automata theory as they provide essentially the mechanisms to problem solving that are needed for program verification. In this respect, we investigate:

• logics for reasoning about infinite sets of program configurations, involving infinite data domains (array logics) and complex recursive data structures (separation logic), and
• automata extended with integer variables (counter machines), possibly with unbounded stacks (recursive integer programs).

We devoted special attention to the connection between logic and automata theory, by using counter machines and tree automata as effective decision procedures for array logics and separation logic, respectively. In this respect, we identified new decidable logical fragments and classes of automata and studied the complexity of their decision problems, such as, e.g. validity, reachability and termination, respectively. Most of these theoretical results have been implemented within prototype tools used to carry out experimental evaluations of their practical efficiency.

17:00 Cocktail