1. 11 February 2003 1 CdP INRIA Futurs Catuscia Palamidessi INRIA Futurs @ Saclay

2. 11 February 2003CdP INRIA Futurs2 Short employment history 1988 PhD in Comp. Science University of Pisa (Italy) 88-92 Assistant Professor at the University of Pisa 88-91 Vis. sci. at CWI and Univ. of Utrecht (NL) 92-94 Assoc. Prof. at the Univ. of Genova (Italy) 94-97 Professor at Univ. of Genova 98–02 Professor at Penn State University (USA) 02- Research Director at INRIA Futurs

3. 11 February 2003CdP INRIA Futurs3 Short cv Scientific Interests:  Principles of Programming Languages, Concurrency, Mobility, Distributed Computing, Security Protocols Editorial activity  Journal TPLP, ENTCS, special issues in TCS and Info&Comp Keynote speaker  ACM PPDP, CONCUR, PLILP Conference chair  ICLP, CONCUR, PLILP/ALP PC member  POPL, CONCUR, ICLP, ICFP, PPDP, CSL, TACS, ICALP, ESOP, FOSSACS, …

4. 11 February 2003CdP INRIA Futurs4 Evolution of scientific interests 84-92 Pisa Logic Programming group  Semantics of Logic Programming  Integration of Functional and Logic Programming  Negation 88-96 CWI Concurrency group  Concurrent Logic Programming  Concurrent Constraint Programming  Concurrency w/ Asynchronous Communication  Expressiveness of concurrent languages

5. 11 February 2003CdP INRIA Futurs5 Evolution of scientific interests 96- Concurrency w/ link mobility (  -calculus) Expressiveness of synchronous  Probabilistic Asynchronous  pa  Randomized implementation of  into  pa Testing semantics for  pa 2001- Distributed resource allocation Generalized dining philosophers Drinking Philosophers 2000- Timed Concurrent Constr Prog with M. Nielsen and F. Valencia (BRICS)

6. 11 February 2003CdP INRIA Futurs6 Main achievements 86 Design of K-LEAF  Integration of functions within LP  Introduction of the concept of strict equality  Influenced the design of various subsequent LF + LP proposals, including BABEL 87 S-Semantics for Logic Programming Declarative characterization of the answer substitutions It has been the basis for several works on the Semantics and Static Analysis of LP

7. 11 February 2003CdP INRIA Futurs7 Main achievements 91-94 (with Frank de Boer) Semantics of CCP Asynchronous communication requires less information in the semantic domain / induces a coarser equality afterwards, Frank and I studied asynchronous communication in more general settings:  (with J.W. Klop) Asynchronous Process Algebra  (with J. Kok and J. Rutten) Abstract state-based comm Our approaches were different from the recent approaches to asynchonous communication like the asynchronous CCS and the asynchronous . However, several of the laws that have been recently established in the latter contexts were analogous.

8. 11 February 2003CdP INRIA Futurs8 Main achievements 92-97 (w/ F. de Boer) Expressiveness in Concurrency Aim: define a concept of expressiveness subtle enough to capture the differences among concurrent languages wrt their capabilities of achieving a common goal in a fully distributed way Notion of Embedding. Separation between various CSP dialects and between various CCP dialects Project Express (94-97) with INRIA S.-A. and several other European partners Workshop Express (94-) Special issue on MSCS dedicated to Express (by initiative of the editor in chief Peppe Longo)

9. 11 February 2003CdP INRIA Futurs9 Main achievements 97 Separation between  and  Asynchonous  [Boudol – Honda/Tokoro]  CCS   with internal mobility [Sangiorgi] The symmetric leader election problem can be solved in  for any ring of processes, while this is not possible for the other languages (an adversary scheduler can exploit the symmetry to induce a livelock). In , we can use name mobility to fully connect the graph, and then mixed choice to break the symmetry.

10. 11 February 2003CdP INRIA Futurs10 Main achievements 00-02 (with M. Herescu) Probabilistic Asynchronous  pa  Aim: add the power of randomization to obtain a language that  is as expressive as   can be implemented in a fully distributed way (  cannot, for the leader election problem cannot be solved in a distributed system with a “deterministic” algorithm)  Allows encoding   2001 Solution to the generalized dining philosophers  2002 Encoding of  into  pa completed and proved correct wrt a notion of testing semantics

11. 11 February 2003CdP INRIA Futurs11 Current interests Distributed applications Use of  and  pa for  Transactions (STREP ?)  Coordination (NoE CoordiNet) Possible PCRI project on these themes (with Veronique Benzakem and Nicole Bidoit, LRI, and Giuseppe Castagna, LIENS) Security protocols Application of Concurrency methods to the Specification and verification of properties of security protocols Use of  pa for  Studying correctness under more powerful intruders  Modeling certain protocols that require randomization