[TYPES/announce] Amir Pnueli Memorial Symposium, NYU, May 7-9, 2010

[Christopher L Conway]

=======================================================================

                      Amir Pnueli Memorial Symposium

                           New York University
                         New York, New York, USA

                              May 7-9, 2010

=======================================================================

Amir Pnueli was one of the most influential computer scientists of our
time. He published more than 250 papers, many of them groundbreaking,
including the 1977 paper, "The Temporal Logic of Programs," for which he
won the 1996 ACM Turing Award.  On November 2, 2009, Amir unexpectedly
passed away. His loss is felt deeply by friends and colleagues around the
world.

The Amir Pnueli Memorial Symposium is an opportunity for the computer
science community to remember Amir by revisiting the ideas and challenges
which inspired and defined his life's work.  It will feature talks by a
select group of internationally acclaimed researchers, including
colleagues and former students of Amir.

The symposium will take place at New York University on May 7-9, 2010.
It is open to all who wish to attend.  For more information and to
register, please visit http://www.cs.nyu.edu/acsys/pnueli.

==================
Schedule
==================

May 7

4:00 PM	  Remembering Amir Pnueli, with tributes from his family, friends,
          colleagues, and students.
6:00 PM	  Receptionm, 13th floor of Courant building.

May 8

08:15 AM	Welcome
08:30 AM	Moshe Vardi, From Löwenheim to Pnueli, from Pnueli to PSL and
                    SVA
09:00 AM	Krzysztof Apt, 	Juggling using Temporal Logic
09:30 AM	Willem-Paul De Roever, What is in a Step: New Perspectives on
                    a Classical Question
10:00 AM	Break
10:30 AM	Egon Börger, Ambient Abstract State Machines with Applications
11:00 AM	Manfred Broy, Realizability of System Interface Specifications
11:30 AM	Ofer Strichman, Proving Equivalence between Similar Programs:
                    A Progress Report
12:00 PM	Jayadev Misra, An Operational/Denotational Semantics of Orc
12:30 PM	Lunch
02:00 PM	Robert Kurshan, Verification-Guided Hierarchical Design
02:30 PM	Werner Damm, Towards Component Based Design of Hybrid Systems
03:00 PM	Ken McMillan, TBA
03:30 PM	Break
04:00 PM	E. Allen Emerson, Time for Time
04:30 PM	Leslie Lamport, Temporal Logic: The Lesser of Three Evils
05:00 PM	Stephan Merz, A Mechanized Proof System for TLA+
                    Specifications
05:30 PM	Giora Slutzki, Inverting Proof Systems for Secrecy under OWA

May 9

08:30 AM	David Harel, Can we Verify an Elephant?
09:00 AM	Tom Henzinger, Quantitative Modeling and Verification
09:30 AM	Patrick Cousot, A Scalable Segmented Decision Tree Abstract
                   Domain
10:00 AM	Break
10:30 AM	Oded Maler, Properties and Verification in the Continuous
                    Domain
11:00 AM	Roni Rosner, New Challenges for the Verification Community
11:30 AM	Javier Esparza, Newtonian Program Analysis: Solving Sharir and
                    Pnueli's Equations.
12:00 PM	Nir Piterman, p-Automata: New Foundations for Discrete-Time
                  Probabilistic Verification
12:30 PM	Lunch
02:00 PM        Catuscia Palamidessi, Information-Theoretic Approaches to
                    Information Flow and Model Checking Techniques to Measure
                    It
02:30 PM	Rajeev Alur, List Processing Programs as Regular Word
                    Transducers
03:00 PM	Doron Peled, TBA
03:30 PM	Break
04:00 PM	Muli Safra, TBA
04:30 PM	Krishna Palem, TBA
05:00 PM	Lenore Zuck, TBA