Le Centre de Recherche Commun INRIA-Microsoft Research

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

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

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

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

Proofs and Proof Certification in the TLA + Proof System

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

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

Introduction to the Calculus of Inductive Definitions

Formal proofs and certified computation in Coq

HPC at INRIA. Michel Cosnard INRIA President and CEO

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

arxiv: v1 [cs.lo] 11 Nov 2010

CS3110 Spring 2016 Lecture 5 Modules for Rational Numbers

Cryptographically Sound Implementations for Typed Information-Flow Security

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

Coq Summer School. Yves Bertot

Modeling and Simulation in Scilab/Scicos with ScicosLab 4.4

Conclusions and further reading

A Certified Reduction Strategy for Homological Image Processing

The Fox Project: Advanced Development of Systems Software

From Crypto to Code. Greg Morrisett

Introduction to Functional Programming in OCaml

Readable semi-automatic formal proofs of Depth-First Search in graphs using Why3

Verifying a Lustre Compiler Part 2

Introduction to Coq Proof Assistant

Synchronous Formal Design of Cyber-Physical Systems

HPC and Inria

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

ELIESER : USER MANUAL

KerData: Scalable Data Management on Clouds and Beyond

Geometry, Combinatorics, and Algorithms (GeCoaL)

Machine-checked proofs of program correctness

On the definition of ulp(x)

TLA + Proofs. 1 Introduction. Denis Cousineau 1, Damien Doligez 2, Leslie Lamport 3, Stephan Merz 4, Daniel Ricketts 5, and Hernán Vanzetto 4

Turning proof assistants into programming assistants

Synchronous Specification

Simple proofs of simple programs in Why3

A digital resources warehouse as a playground for the future Internet

Towards certification of TLA + proof obligations with SMT solvers

The Embedded and Mobile Systems Master s degree at the CNAM of Paris

Numerical Computations and Formal Methods

When double rounding is odd

IP Simulator User Guide

FIT IoT-LAB: The Largest IoT Open Experimental Testbed

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

From Digital Images to Simplicial Complexes: A Report

*the Everest VERified End-to-end Secure Transport. Verified Secure Implementations for the HTTPS Ecosystem mitls & Everest*

An OCaml-based automated theorem-proving textbook

Analyses, Hardware/Software Compilation, Code Optimization for Complex Dataflow HPC Applications

Towards Phase Change Memory as a Secure Main Memory

HACL* in Mozilla Firefox Formal methods and high assurance applications for the web

Addendum About Groups

Real-Parameter Black-Box Optimization Benchmarking 2009 Software: User Documentation

Isabelle/HOL:Selected Features and Recent Improvements

An introduction to Topological Data Analysis through persistent homology: Intro and geometric inference

Leslie Lamport: The Specification Language TLA +

NeuroBase: An Information System for Managing Distributed Knowledge and Data Bases in Neuroimaging. Christian BARILLOT DR CNRS

Hamilton Cycle Decomposition of the Butterfly Network

Camcal v1.0 Manual A Complete Software Solution for Camera Calibration

CS 2336 Discrete Mathematics

Chapter 2 Synchronous Programming: Overview

Formal Methods in Software Development

Modalis. A First Step to the Evaluation of SimGrid in the Context of a Real Application. Abdou Guermouche and Hélène Renard, May 5, 2010

SOFTWARE VERIFICATION AND COMPUTER PROOF (lesson 1) Enrico Tassi Inria Sophia-Antipolis

Proving the Correctness of Distributed Algorithms using TLA

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

Formal study of plane Delaunay triangulation

A Formalization of Convex Polyhedra based on the Simplex Method

Structure of spaces of rhombus tilings in the lexicograhic case

A Multicover Nerve for Geometric Inference. Don Sheehy INRIA Saclay, France

CMSC 330: Organization of Programming Languages. Functional Programming with OCaml

ADAM CHLIPALA. Research interests. Education. Refereed conference papers

Héméra Inria Large Scale Initiative

Canonical Structures for the working Coq user

Search for Program Structure

Strongly Connected Components in graphs, formal proof of Tarjan1972 algorithm

Accord UDL-CSC École Doctorale Info-Maths

Simulink 모델과 C/C++ 코드에대한매스웍스의정형검증툴소개 The MathWorks, Inc. 1

Simple simpl. Pierre Boutillier. To cite this version: HAL Id: hal

SecSIP User Documentation

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

Truth A verification platform for concurrent systems

Lecture 1 Course Introduction

SILECS Super Infrastructure for Large-scale Experimental Computer Science

A concrete memory model for CompCert

Outline. Proof Carrying Code. Hardware Trojan Threat. Why Compromise HDL Code?

P. Amestoy, F. Camillo, M. Daydé, R. Guivarch, A. Hurault, JY. L'Excellent (*), C. Puglisi. IRIT INPT(ENSEEIHT) (Toulouse) (*)LIP ENS (Lyon)

Problèmes de robustesse en géométrie algorithmique

Sharing in the weak lambda-calculus

Weak Memory Models: an Operational Theory

Automated verification of termination certificates

Routing Reconfiguration/Process Number: Networks with Shared Bandwidth.

Formal proofs of code generation and verification tools

SJTU SUMMER 2014 SOFTWARE FOUNDATIONS. Dr. Michael Clarkson

Learning, teaching, playing with compiler construction - A web based host platform for target virtual machines

Crafting a Proof Assistant

Accelerating Floating-Point Division When the Divisor is Known in Advance

Integrating verification in programming languages

Array-OL Revisited, Multidimensional Intensive Signal Processing Specification

Meshing the hyperbolic octagon

Transcription:

Le Centre de Recherche Commun INRIA-Microsoft Research Jean-Jacques Lévy INRIA Rocquencourt & MSR-INRIA Joint Centre ENST Mercredi 4 avril 2007

Plan 1 Context 2 Track A 3 Track B 4 Future

Context

INRIA Rocquencourt, Sophia-Antipolis, Rennes, Grenoble, Nancy, Futurs (Bordeaux, Lille, Saclay) 500 chercheurs. premier institut de recherche européen en informatique. 40 ans en 2007. Automatique et Informatique. Jacques-Louis Lions

Microsoft Research Redmond, Cambridge, Pékin, Silicon Valley, Bangalore 700 chercheurs. recherche ouverte (publications, logiciels) et principalement fondamentale, 15 ans en 2007. ouverture vers les universités/instituts de recherche (Trente, Aix-la-Chapelle, INRIA, Carnegie-Mellon) même directeur depuis 15 ans. Rick Rashid

Politics INRIA MSR Cambridge Gilles Kahn Michel Cosnard Joint Centre Gérard Huet J.-J. Lévy Stephen Emmott Gérard Giraudon Jean Vuillemin Ken Wood Roger Needham Andrew Herbert

Strong points in french CS research mathematics and theoretical CS formal methods programming langages computer algebra computer human interfaces computational geometry vision INRIA basic software (prototypes and real tools) b, coq, trusted logic ada, caml, lelisp, lustre, esterel maple libraries, scilab nextstep, Mac OS X interface CGAL realviz ilog, altavista exalead polyspace, astree, unison.

Strong points in french CS research mathematics and theoretical CS formal methods programming langages computer algebra computer human interfaces computational geometry vision INRIA basic software (prototypes and real tools) b, coq, trusted logic ada, caml, lelisp, lustre, esterel maple libraries, scilab nextstep, Mac OS X interface CGAL realviz ilog, altavista exalead polyspace, astree, unison.

Strong points in french CS research formal thinking = theory + hacking formal methods programming langages computer algebra computer human interfaces computational geometry vision INRIA basic software (prototypes and real tools) b, coq, trusted logic ada, caml, lelisp, lustre, esterel maple libraries, scilab nextstep, Mac OS X interface CGAL realviz ilog, altavista exalead polyspace, astree, unison..

Long cooperation between researchers Edinburgh MSR Cambridge INRIA Paris7 DEC Bell labs Orsay X ENS Stanford Trento Pisa ENS-Cachan Bologna ENS-Lyon

Track A Software Security Trustworthy Computing

Mathematical components Georges Gonthier, MSR Assia Mahboubi, INRIA-MSR Enrico Tassi, Bologna Y. Bertot, L. Rideau, INRIA Sophia Sean McLaughlin, Carnegie Mellon Benjamin Werner, INRIA Futurs Roland Zumkeller, LIX Computational proofs computer assistance for long formal proofs. Georges Gonthier proved 4-color theorem in 2001-2004 (60000 lines of Coq). 4-color finite groups Kepler Appel-Haken Feit-Thompson Hales

Tools for formal proofs Natural proofs Damien Doligez, INRIA Rocq. Leslie Lamport, MSR Stephan Merz, INRIA Lorraine first-order set theory + temporal logic specifications/verification of concurrent programs. tools for automatic theorem proving TLA+ tools for proofs Zenon

Secure Distributed Computations and their Proofs Cédric Fournet, MSR James Leifer, INRIA Rocq. Karthik Bhargavan, MSR Jean-Jacques Lévy, INRIA Rocq. Ricardo Corin, INRIA-MSR Tamara Rezk, INRIA-MSR Pierre-Malo Deniélou, INRIA Rocq. Francesco Zappa Nardelli, 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 crypto-protocols formal proofs of probabilistic protocols

Secure Distributed Computations and their Proofs Cédric Fournet, MSR James Leifer, INRIA Rocq. Karthik Bhargavan, MSR Jean-Jacques Lévy, INRIA Rocq. Ricardo Corin, INRIA-MSR Tamara Rezk, INRIA-MSR Pierre-Malo Deniélou, INRIA Rocq. Francesco Zappa Nardelli, 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 crypto-protocols formal proofs of probabilistic protocols

Track B Computational Sciences

CS research in use for other Sciences/Scientists Current proposals Information interaction dynamic encyclopedia of mathematics (Bruno Salvy, Alin Bostan, Frédéric Chyzak) management of scientific workflows (Wendy Mackay, J.-D. Fekete, Mary Czerwinski, George Robertson) Scientific data visualisation image and video analysis for environmental sciences (Patrick Perez, Andrew Blake) geometric methods for data analysis (J.-D. Boissonnat, F. Chazal, F. Cazals, D. Cohen-Steiner)

Future

Future install Track B in 2007 30 researchers tight links with french academia (phd, post-doc) develop useful research for scientific community provide public tools (BSD licence) become a new and attractive pole in CS research