- Presentation
- HAL publications
- Activity reports
CARTE Research team
Theoretical adverse computations, and safety
- Leader : Jean-Yves Marion
- Type : Project team
- Research center(s) : Nancy
- Field : Algorithmics, Programming, Software and Architecture
- Theme : Programs, Verification and Proofs
- Université de Lorraine, CNRS, Laboratoire lorrain de recherche en informatique et ses applications (LORIA) (UMR7503)
Team presentation
The aim of the CARTE research team is to take into account adversity in computations, which is implied by actors whose behaviors are unknown or unclear. We call this notion adversary computation. The project combines two approaches, and we think that their combination will be fruitful. The first one is the analysis of the behavior of a wide-scale system, using tools coming from Continuous Computation Theory. The second approach is to build defenses with tools coming rather from logic, rewriting and, more generally, from Programming Theory. The activities of the CARTE team are organized around two research actions: Computer Virology. Computation over Continuous StructuresResearch themes
There are three main research directions : 1) Computer virology : We study model of viruses, self-modifying programs, and heuristic to detect malware 2) Model of computation over reals and dynamical systems 3) Implicit computational complexityInternational and industrial relations
We have relationships with Torino (EA Crystal), with Alexandria, with Lisboa (EA Computr) and Montréal (Ecole polytechnique).Keywords: Complexity Calculability Virus Malware Computational model Proff theory termination Reals implicit complexity
Research teams of the same theme :
- ABSTRACTION - Abstract Interpretation and Static Analysis
- ATEAMS - Analysis and Transformation based on rEliAble tool coMpositionS
- CASSIS - Combination of approaches to the security of infinite states systems
- CELTIQUE - Software certification with semantic analysis
- COMETE - Concurrency, Mobility and Transactions
- 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
Jean-Yves Marion
Tel.: +33 3 54 95 84 60
Secretariat
Tel.: +33 3 54 95 84 02
Inria
Inria.fr
Inria Channel

Find out more
See also