1 / 11

Catuscia Palamidessi

Catuscia Palamidessi. INRIA Futurs @ Saclay. 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)

cheri
Download Presentation

Catuscia Palamidessi

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Catuscia Palamidessi INRIA Futurs @ Saclay CdP INRIA Futurs

  2. Short employment history • 1988 PhD in Comp. ScienceUniversity 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 CdP INRIA Futurs

  3. 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, … CdP INRIA Futurs

  4. Evolution of scientific interests 84-92 PisaLogic Programming group • Semantics of Logic Programming • Integration of Functional and Logic Programming • Negation 88-96 CWIConcurrency group • Concurrent Logic Programming • Concurrent Constraint Programming • Concurrency w/ Asynchronous Communication • Expressiveness of concurrent languages CdP INRIA Futurs

  5. Evolution of scientific interests 96- Concurrency w/ link mobility (p-calculus) • Expressiveness of synchronous p • Probabilistic Asynchronous p ( ppa ) • Randomized implementation of p into ppa • Testing semantics for ppa 2001- Distributed resource allocation • Generalized dining philosophers • Drinking Philosophers 2000- Timed Concurrent Constr Prog • with M. Nielsen and F. Valencia (BRICS) CdP INRIA Futurs

  6. 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 CdP INRIA Futurs

  7. 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 p. However, several of the laws that have been recently established in the latter contexts were analogous. CdP INRIA Futurs

  8. 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) CdP INRIA Futurs

  9. Main achievements • 97 Separation between p and • Asynchonous p[Boudol – Honda/Tokoro] • CCS • p with internal mobility [Sangiorgi] • The symmetric leader election problem can be solved in p 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 p, we can use name mobility to fully connect the graph, and then mixed choice to break the symmetry. CdP INRIA Futurs

  10. Main achievements • 00-02 (with M. Herescu)Probabilistic Asynchronous p (ppa) • Aim:add the power of randomization to obtain a language that • is as expressive as p • can be implemented in a fully distributed way (p cannot, for the leader election problem cannot be solved in a distributed system with a “deterministic” algorithm) • Allows encodingp • 2001 Solution to the generalized dining philosophers • 2002 Encodingof p into ppacompleted and proved correct wrt a notion of testing semantics CdP INRIA Futurs

  11. Current interests Distributed applications • Use of p and ppa 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 ppa for • Studying correctness under more powerful intruders • Modeling certain protocols that require randomization CdP INRIA Futurs

More Related