the MSR-INRIA Joint Centre Jean-Jacques Lévy June 2, 2008

Similar documents
MSR-INRIA Joint Centre. Jean-Jacques Lévy June 3, 2009

Le Centre de Recherche Commun INRIA-Microsoft Research

Moscova. Jean-Jacques Lévy. March 23, INRIA Paris Rocquencourt

Moscova 07. Jean-Jacques Lévy. April 24, INRIA Rocquencourt

Formal proofs and certified computation in Coq

Formal Verification of a Geometry Algorithm: A Quest for Abstract Views and Symmetry in Coq Proofs

Make Computer Arithmetic Great Again?

Cybersecurity academic activities in France and Europe A few items. Claude Kirchner Inria

Proofs and Proof Certification in the TLA + Proof System

Introduction to the Calculus of Inductive Definitions

Coq, a formal proof development environment combining logic and programming. Hugo Herbelin

Geometry, Combinatorics, and Algorithms (GeCoaL)

Cryptographically Sound Implementations for Typed Information-Flow Security

Introduction to Coq Proof Assistant

From Crypto to Code. Greg Morrisett

Simple proofs of simple programs in Why3

A Coq Framework For Verified Property-Based Testing (part of QuickChick)

Coq Summer School. Yves Bertot

arxiv: v1 [cs.lo] 11 Nov 2010

The automatic security protocol verifier ProVerif

The Fox Project: Advanced Development of Systems Software

Bruno Pinaud University of Bordeaux

Faculty of King Abdullah II School for Information Technology Department of Computer Science Study Plan Master's In Computer Science (Thesis Track)

The GEMOC Initiative On the Globalization of Modeling Languages

Rings with Explicit Divisibility Formalized in Coq

Canonical Structures for the working Coq user

A NEW PROOF-ASSISTANT THAT REVISITS HOMOTOPY TYPE THEORY THE THEORETICAL FOUNDATIONS OF COQ USING NICOLAS TABAREAU

15 Depth and Excluded Courses

KerData: Scalable Data Management on Clouds and Beyond

HPC and Inria

Program Proposal for a Direct Converted Program. BS in COMPUTER SCIENCE

FIT IoT-LAB: The Largest IoT Open Experimental Testbed

Table of Contents. Chapter 1. Modeling and Identification of Serial Robots... 1 Wisama KHALIL and Etienne DOMBRE

Formal study of plane Delaunay triangulation

JOINT DEGREE IN COMPUTER ENGINEERING AND MATHEMATICS

French & American Educational System. Collaboration between Rutgers & Paris 6. M.S. : Distributed Systems & Applications

( It will be applied from Fall)

Bandit-based Search for Constraint Programming

DEPARTMENT OF COMPUTER SCIENCE & ENGG

Verifying a Lustre Compiler Part 2

Grid Grid A nation wide Experimental Grid. Franck Cappello INRIA With all participants

Post Digitization: Challenges in Managing a Dynamic Dataset. Jasper Faase, 12 April 2012

Automated verification of termination certificates

When double rounding is odd

Japanese - French Laboratory for Informatics (JFLI) 日仏情報学連携研究拠点. Philippe Codognet (CNRS / UPMC / University of Tokyo)

ASAP.V2 and ASAP.V3: Sequential optimization of an Algorithm Selector and a Scheduler

CS3110 Spring 2016 Lecture 5 Modules for Rational Numbers

STEPHEN WOLFRAM MATHEMATICADO. Fourth Edition WOLFRAM MEDIA CAMBRIDGE UNIVERSITY PRESS

Information management - Topic Maps visualization

Parallel Implementation of Interval Analysis for Equations Solving

Proving Tight Bounds on Univariate Expressions with Elementary Functions in Coq

JES. 4 year BTech New Approved Curricula for Computer Science Engineering wef batch. BTech I semester (B1)

The Role of Generalisation in the Discovery, Proof and Visualisation of a Theorem about Cubics with the Help of CAS and DGS (TI-Nspire and Cabri)

Generating formally certified bounds on values and round-off errors

A Certified Reduction Strategy for Homological Image Processing

Syllabus for Ph.D Entrance Test, RGPV. Common for CSE/IT/CA

Introduction to Functional Programming in OCaml

, , & CATALOG TECHNICAL CORES AND ELECTIVES

Sparta Systems TrackWise Digital Solution

When double rounding is odd

Toward realistic and efficient virtual crowds. Julien Pettré - June 25, 2015 Habilitation à Diriger des Recherches

CS : Language-based Security

Modeling and Simulation in Scilab/Scicos with ScicosLab 4.4

Some issues related to double roundings

ENGINEERING PROGRAMME

Implementation of a compiler from Pluscal to TLA+ with Tom

A NEW PROOF-ASSISTANT THAT REVISITS HOMOTOPY TYPE THEORY THE THEORETICAL FOUNDATIONS OF COQ USING NICOLAS TABAREAU

On the Reliability of Correct Programs

, , & CATALOG TECHNICAL CORES & ELECTIVES ELECTRICAL ENGINEERING TECHNICAL CORES

Turning proof assistants into programming assistants

ABriefOverviewofAgda A Functional Language with Dependent Types

Algebraic-Differential Cryptanalysis of DES

Shaping Imaginary Content

Token-Passing Nets: Call-by-Need for Free

Analysis Techniques. Protocol Verification by the Inductive Method. Analysis using theorem proving. Recall: protocol state space.

Formal Verification of Floating-Point programs

Modeling and Simulation of the physical world (SIM) S. Labbé (UJF - LJK) B. Penz (Grenoble INP - G-SCOP)

Scheme of Studies. BS Computer Science

Proofs-Programs correspondance and Security

Bachelor of Science in Software Engineering (BSSE) Scheme of Studies ( )

Proof-by-Instance for Embedded Network Design From Prototype to Tool Roadmap. Marc Boyer, Loïc Fejoz. 1, Stephan Merz 3

Malware models for network and service management

From Digital Images to Simplicial Complexes: A Report

DEPARTMENT OF COMPUTER SCIENCE

SILECS Super Infrastructure for Large-scale Experimental Computer Science

Secure Distributed Computa2ons (and their Proofs)

Formal methods for software security

Implementing Trusted Digital Repositories

Symbol Detection Using Region Adjacency Graphs and Integer Linear Programming

The Coq Proof Assistant Reference Manual

SINGLES. Week of City, Country Grade/Age Category Referee

Proving the Correctness of Distributed Algorithms using TLA

Kick Off meeting teleconference

INTEGRATING SYSTEM AND SOFTWARE ENGINEERING FOR CERTIFIABLE AVIONICS APPLICATIONS

EUDAT & SeaDataCloud

HPC at INRIA. Michel Cosnard INRIA President and CEO

Leslie Lamport: The Specification Language TLA +

French Research in Comp. Virology and Operational Cryptology

Module 4. Computer-Aided Design (CAD) systems

CS Faculty Research Interests

Transcription:

the MSR-INRIA Joint Centre Jean-Jacques Lévy June 2, 2008

Plan 1. Context 2. Track A Math. Components Security TLA+ 3. Track B DDMF ReActivity Adaptative search Image & video mining

Context

Politics INRIA MSR Cambridge Eric Boustouller Stephen Emmott Gérard Giraudon Gérard Huet Jean Vuillemin Joint Centre J.-J. Lévy Michel Bidoit Bruno Sportisse Marc Jalabert Bernard Ourghanlian

Long cooperation among researchers

Organization a rather complex system 7 research projects (in two tracks) 12 resident researchers non permanent researchers funded by the Joint Centre permanent researchers paid by INRIA or MSR operational support by INRIA Saclay 1 system manager (Guillaume Rousse, INRIA Saclay) 1 administrative assistant (Martine Thirion, Joint Centre) 1 deputy director (Pierre-Louis Xech, MS France) active support from MS France

People PhD Students Post Docs Interns Alexandro ARBALAEZ Alvaro FIALHO Francois GARILLOT Sidi OULD BIHA Iona PASCA Arnaud SPIVAK Nicolas MASSON Nathalie HENRY Nataliya GUTS Santiago ZANELLA Stéphane LEROUX Guillaume MELQUIOND Roland ZUMKELLER Assia MAHBOUBI (*) Aurélien TABARD Catherine LEDONTAL Niklas ELMQVIST Gurvan LE GUERNIC Eugen ZALINESCU Ricardo CORIN (*) Tamara REZK (*) Jorge Martin PEREZ-ZERPA Sébastien MIGNOT Fabien TEYTAUD Alexandre BENOIT Pratik PODDAR Sean McLAUGHLIN Etienne MIRET Enrico TASSI Fei LI Yoann COLDFLY Jérémy PLANUL (*) Now on permanent INRIA position

Track A Software Security Trustworthy Computing

Mathematical components Georges Gonthier, MSRC Assia Mahboubi, INRIA Saclay/LIX Andrea Asperti, Bologna Y. Bertot, L. Rideau, L. Théry, Sidi Ould Biha, Iona Pasca, INRIA Sophia François Garillot, MSR-INRIA (PhD) Guillaume Melquiond, MSR-INRIA (postdoc) Stéphane le Roux, MSR-INRIA (postdoc) Benjamin Werner, INRIA Saclay/LIX, Roland Zumkeller, LIX (PhD) Computational proofs computer assistance for long formal proofs. reflection of computations into Coq-logic: ssreflect.

l i n e a r a l g e b r a

l i n e a r a l g e b r a

l i n e a r a l g e b r a

l i n e a r a l g e b r a

l i n e a r a l g e b r a

l i n e a r a l g e b r a

l i n e a r a l g e b r a

Secure Distributed Computations and their Proofs Cédric Fournet, MSRC Karthik Bhargavan, MSRC Ricardo Corin, INRIA Rocq. Pierre-Malo Deniélou, INRIA Rocq. G. Barthe, B. Grégoire, S. Zanella, INRIA Sophia Distributed computations + Security programming with secured communications certified compiler from high-level primitives to low-level cryptoprotocols formal proofs of probabilistic protocols James Leifer, INRIA Rocq. Jean-Jacques Lévy, INRIA Rocq. Tamara Rezk, INRIA Sophia Francesco Zappa Nardelli, INRIA Rocq. Nataliya Guts, MSR-INRIA (PhD) Jérémy Planul, MSR-INRIA (intern)

Secure Distributed Computations and their Proofs Secure Implementations for Typed Session Abstractions (v1 and v2) Cryptographic Enforcement of Information-Flow Security Secure Audit Logs Automated Verifications of Protocol Implementations CertiCrypt: Formal Proofs for Computational Cryptography C Query Checks C s sig O Contract Checks C & O sigs then only C s sig S Accept New Offer Condition C C Confirm Reject O S Abort O Checks only C s sig

Tools for formal proofs Damien Doligez, INRIA Rocq. Kaustuv Chaudhury, MSR-INRIA (postdoc) Leslie Lamport, MSRSV Stephan Merz, INRIA Lorraine Natural proofs first-order set theory + temporal logic specification/verification of concurrent programs. tools for automatic theorem proving

Logics in track A Math. components Coq higher-order + reflection Security PV/CV applied pi-calculus + stochastic Spec. / Verif. TLA+ 1st order + ZF + temporal

Track B Computational Sciences Scientific Information Interaction

Dynamic dictionary of math functions Bruno Salvy, INRIA Rocq., Alin Bostan, INRIA Rocq., Frédéric Chyzak, INRIA Rocq. Henry Cohn, [Theory Group] MSRR Alexandre Benoit, MSR-INRIA (intern) Marc Mezzarobba, MSR-INRIA (intern) Computer Algebra and Web for useful functions, dynamic tables of their properties. generation of programs to compute them.

Dynamic dictionary of math functions Computer algebra: classic: polynomial to represent their roots + following tools: euclidian division, Euclid algorithm, Gröbner bases. modern: linear differential equation as data structures to represent their solutions [SaZi94, ChSa98, Chyzak00, MeSa03, Salvy05] with same tools as classical case but non-commutative. prototype ESF at http://algo.inria.fr/esf (65% of Abramowitz-Stegun) todo: interactivity, integral transforms, parametric integrals.

ReActivity Wendy Mackay, INRIA Saclay, J.-D. Fekete, INRIA Saclay, Mary Czerwinski, MSRR, George Robertson, MSRR Michel Beaudouin-Lafon, Paris 11, Olivier Chapuis, CNRS, Pierre Dragicevic, INRIA Saclay, Emmanuel Pietriga, INRIA Saclay, Aurélien Tabard, Paris 11 (PhD) Logs of experiments for biologists, historians, other scientists mixed inputs from lab notebooks and computers, interactive visualization of scientific activity, support for managing scientific workflow.

ReActivity Programme: Log platform and infrastructure for data collection and aggregation common format & share experiences, apply our own visualisation tools to the logged data Visualisation and instrumentation of scientific data logs, Visualisation of scaled to month-long or longer logs, strategies of interaction and navigation for meaningful sampling of data Mining of desktop data and interactions with visualised activities Design highly interactive tools for scientists to understand and interact with their past activies Create high-level interactive reflexive views that can be manipulated and reused) Update: interactive wall and collaborative workflow

Adaptive Combinatorial Search for E-science Youssef Hamadi, MSRC Marc Schoenauer, INRIA-Saclay Anne Auger, INRIA-Saclay Lucas Bordeaux, MSRC Michèle Sebag, CNRS Parallel constraint programming and optimization for very large scientific data improve the usability of Combinatorial Search algorithms. automate the fine tuning of solver parameters. parallel solver: disolver MoGo

Adaptive Combinatorial Search for E-science constraint programming: learn instance-dependent variable ordering evolutionary algorithms: use multi-armed bandit algorithms and extreme values statistics continuous search spaces: use local curvature

Image and video mining for science and humanities Jean Ponce, ENS Andrew Blake, MSRC Computer vision and Machine learning for: Patrick Pérez, INRIA Rennes Cordelia Schmid, INRIA Grenoble sociology: human activity modeling and recognition in video archives archaeology and cultural heritage preservation: 3D object modeling and recognition from historical paintings and photographs environmental sciences: change detection in dynamic satellite imagery

Image and video mining for science and humanities

Sciences in track B DDMF computer algebra hard sciences Adapt. search constraints, machine learning hard sciences, biology Reactivity chi + visualisation soft sciences, biology I.V. mining computer vision humanities, environment

Future

Future 2nd anniversary: 28 January 2009 at Ecole Polytechnique

Future 30 resident researchers tight links with French academia (phd, post-doc) develop useful research for scientific community provide public tools (BSD-like license) become a new and attractive pole in CS research and source of spin off companies