Program
(View Abstracts and Bios)
10:30
Coffee and tagging
10:50
Methods for Liveness
Amir Pnueli, New York University and Weizmann Institute (Emeritus)
11:30
Discriminative Model Checking
Doron Peled, Bar-Ilan University
12:10
Shape Analysis of Concurrent Programs
Mooly Sagiv, Tel Aviv University
12:50
Lunch
13:35
Compositional Verification and 3-Valued Abstractions Join Forces
Orna Grumberg, Technion
14:15
Tarskian Structures and Languages in the Study of Concurrency
Uri Abraham, Ben-Gurion University
14:55
Synthesis from Component Programs
Yoad Lustig, Student at Hebrew University of Jerusalem
15:20
Coffee
15:35
Correctness and Interference-Freedom for Libraries
of Reusable Aspects
Shmuel Katz, Technion
16:15
Self-* Programming: Run-Time RSR-Box Control Synthesis
Olga Brukman, Student at Ben-Gurion University
16:40
On the Succinctness of Nondeterminism
Binyamin Aminoff, Student at Hebrew University of Jerusalem