- Presentation
- HAL publications
- Activity reports
COMETE Research team
Concurrency, Mobility and Transactions
- Leader : Catuscia Palamidessi
- Type : Project team
- Research center(s) : Saclay
- Field : Algorithmics, Programming, Software and Architecture
- Theme : Programs, Verification and Proofs
- Ecole Polytechnique, CNRS, Laboratoire d'informatique de l'école polytechnique (LIX) (UMR7161)
Team presentation
The research of the COMETE project-team focus on the theoretical foundations of concurrent and distributed languages. The project-team follows two main directions: the study, implementation and applications of the probabilistic pi-calculus, a variant of the pi-calculus, and the use of higher-order functional programming languages for distributed applications, in particular in the context of peer-to-peer systems.Research themes
- The probabilistic asynchronous pi-calculus, a variant of the pi-calculus suitable for distributed implementation. Here, the objective is to explore the expressiveness of the calculus, and to use it for the specification and verification of distributed algorithms and systems.
- Security protocols. The aim of this theme is to verify protocols when the desired level of security and quality of encryption are probabilistic, i.e. not perfect.
- Distributed algorithms. We study the basic algorithms that appear in the implementation of distributed systems, their specification and their complexity.
- Peer-to-peer systems and functional programming. The goal of this theme is to study the language constructions and tools required to build distributed systems, in particular in the context of peer-to-peer (file-sharing) systems.
International and industrial relations
- Some members of the project are part of the Esprit PEPITO project with KTH, EPFL, SICS, UCL and the University of Cambridge.
- We are involved in the development in Objective-Caml of a multi-networks peer-to-peer file-sharing client, MLdonkey.
Keywords: Models and Languages for Concurrent and Distributed Computation Security Formal Methods Implementation
Research teams of the same theme :
- ABSTRACTION - Abstract Interpretation and Static Analysis
- ATEAMS - Analysis and Transformation based on rEliAble tool coMpositionS
- CARTE - Theoretical adverse computations, and safety
- CASSIS - Combination of approaches to the security of infinite states systems
- CELTIQUE - Software certification with semantic analysis
- CONTRAINTES - Constraint programming
- DEDUCTEAM - Deduction modulo, interopérabilité et démonstration automatique
- FORMES - Formal Methods for Embedded Systems
- GALLIUM - Programming languages, types, compilation and proofs
- MARELLE - Mathematical, Reasoning and Software
- MEXICO - Modeling and Exploitation of Interaction and Concurrency
- MOSCOVA - Mobililty, security, concurrence, verification and analysis
- PAREO - Formal islands: foundations and applications
- PARSIFAL - Proof search and reasoning with logic specifications
- PI.R2 - Design, study and implementation of languages for proofs and programs
- PROSECCO - Programming securely with cryptography
- SECSI - Security of information systems
- TASC - Theory, Algorithms and Systems for Constraints
- TOCCATA - Certified Programs, Certified Tools, Certified Floating-Point Computations
- TYPICAL - Types, Logic and computing
- VERIDIS - Modeling and Verification of Distributed Algorithms and Systems
Contact
Team leader
Catuscia Palamidessi
Tel.: +33 1 69 33 41 17
Secretariat
Tel.: +33 1 69 33 40 32
Inria
Inria.fr
Inria Channel

Find out more
See also