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

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

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

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

Introduction to the Calculus of Inductive Definitions

Proofs and Proof Certification in the TLA + Proof System

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

Geometry, Combinatorics, and Algorithms (GeCoaL)

Make Computer Arithmetic Great Again?

The Fox Project: Advanced Development of Systems Software

Bruno Pinaud University of Bordeaux

arxiv: v1 [cs.lo] 11 Nov 2010

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

Introduction to Coq Proof Assistant

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

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

The automatic security protocol verifier ProVerif

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

Simple proofs of simple programs in Why3

A Certified Reduction Strategy for Homological Image Processing

Verifying a Lustre Compiler Part 2

Bandit-based Search for Constraint Programming

On the Reliability of Correct Programs

Why3 where programs meet provers

The Coq Proof Assistant Reference Manual

Leslie Lamport: The Specification Language TLA +

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

Real-Time Problem-Solving with Contract Algorithms

From Crypto to Code. Greg Morrisett

Proving Tight Bounds on Univariate Expressions with Elementary Functions in Coq

OASIS: Architecture, Model and Management of Policy

Coq Summer School. Yves Bertot

Formal Verification of Floating-Point programs

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

CS3110 Spring 2016 Lecture 5 Modules for Rational Numbers

Improving Coq Propositional Reasoning Using a Lazy CNF Conversion

SMTCoq: A plug-in for integrating SMT solvers into Coq

JOINT DEGREE IN COMPUTER ENGINEERING AND MATHEMATICS

The GEMOC Initiative On the Globalization of Modeling Languages

When double rounding is odd

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

HPC at INRIA. Michel Cosnard INRIA President and CEO

Symbol Detection Using Region Adjacency Graphs and Integer Linear Programming

Cryptographically Sound Implementations for Typed Information-Flow Security

Machine-checked proofs of program correctness

HPC and Inria

FIT IoT-LAB: The Largest IoT Open Experimental Testbed

Generating formally certified bounds on values and round-off errors

-Combinat: sharing combinatorics since 2000

Turning proof assistants into programming assistants

COURSE OUTLINE. School of Engineering Technology and Applied Science

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

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

Automated Precision Tuning using Semidefinite Programming

arxiv: v1 [cs.lo] 29 Oct 2018

SJTU SUMMER 2014 SOFTWARE FOUNDATIONS. Dr. Michael Clarkson

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

French Research in Comp. Virology and Operational Cryptology

Towards certification of TLA + proof obligations with SMT solvers

Deductive Program Verification with Why3, Past and Future

KerData: Scalable Data Management on Clouds and Beyond

From Digital Images to Simplicial Complexes: A Report

Automated verification of termination certificates

Formal Verification of MIX Programs

Parallel Implementation of Interval Analysis for Equations Solving

Biometrics and Image processing

A Parameterized Floating-Point Formalizaton in HOL Light

Rings with Explicit Divisibility Formalized in Coq

Formal Verification of a Floating-Point Elementary Function

GUJARAT TECHNOLOGICAL UNIVERSITY Computer Sceince & Engineering (31) BE 1st To 8th Semester Exam Scheme & Subject Code

Canonical Structures for the working Coq user

Verdi: A Framework for Implementing and Formally Verifying Distributed Systems

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

Enclosures of Roundoff Errors using SDP

ADAM CHLIPALA. Research interests. Education. Refereed conference papers

Some issues related to double roundings

Registration Workshop. Nov. 1, 2017 CS/SE Freshman Seminar

Implementation of a compiler from Pluscal to TLA+ with Tom

Synchronous Specification

Master of Science in Industrial and Applied Mathematics (MSIAM) Opening Orientation Meeting September 21, 2015

Shaping Imaginary Content

DEPARTMENT OF COMPUTER SCIENCE & ENGG

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

2 after reception of a message from the sender, do one of two things: either the message is delivered to the receiver, or it is lost. The loss of a me

Introduction to Functional Programming in OCaml

Reactive Types. Jean-Pierre Talpin. Campus de Beaulieu, Rennes, France.

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

Deductive Verification in Frama-C and SPARK2014: Past, Present and Future

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

Combining Coq and Gappa for Certifying FP Programs

Pilot integration of an electronic lab notebook and an open source research data repository as part of a modular biomedical research data platform

The Green Computing Observatory

Search for Program Structure

Programming Proofs and Proving Programs. Nick Benton Microsoft Research, Cambridge

ALE Agile Language Engineering

When double rounding is odd

SILECS Super Infrastructure for Large-scale Experimental Computer Science

Transcription:

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

Plan 1. Context 2. Track A Math. Components (G.Gonthier) Security (C. Fournet) TLA+ (D. Doligez) 3. Track B DDMF (Bruno Salvy) ReActivity (J.-D. Fekete, Wendy Mackay) Adaptative search (Youssef Hamadi, Marc Schoenauer) Image & video mining (Jean Ponce)

Demos - Short Talks Track A (20mn each) Laurent Théry (INRIA Sophia) Pierre-Malo Deniélou (Imperial College) Cédric Fournet (MSRC) Eugen Zalinescu (Joint Centre) Kaustuv Chaudury (Joint Centre) Track B (20mn each) Frédéric Chyzak (INRIA Rocq) Wendy Mackay (INRIA Saclay) Nikolaus Hansen (Joint Centre) Jean Ponce (ENS, INRIA Rocq)

Context

Management INRIA Eric Boustouller Stephen Emmott Gérard Giraudon Gérard Huet Marc Jalabert Jean Vuillemin Ken Wood MSR Cambridge Joint Centre M. Thirion J.-J. Lévy P.-L.Xech Michel Bidoit Bruno Sportisse Andrew Blake Stephen Emmott Malik Ghallab Claude Puech Bernard Ourghanlian Thomas Serval

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

Localization the plateau de Saclay CEA Paris INRIA Supelec LRI-Orsay RER B Polytechnique IHÉS

Localization the plateau de Saclay = long term investment CEA Paris INRIA Supelec LRI-Orsay RER B Polytechnique IHÉS

Campus

Campus Canteen low quality hyper noisy long line often on strike closed during August

Campus Bus 269-02 super <= 10am chaotic after 06-07 less many Canteen low quality hyper noisy long line often on strike closed during August 6mn RER B Paris = 30mn

People PhD Students Post Docs Francois GARILLOT Sidi OULD BIHA Iona PASCA Roland ZUMKELLER Pierre-Malo DENIELOU Nataliya GUTS Jérémy PLANUL Santiago ZANELLA Alexandre BENOIT Marc MEZZAROBA Nathalie HENRY (+) Nicolas MASSON Arnaud SPIVAK Aurélien TABARD Alexandro ARBALAEZ Alvaro FIALHO Adrien GAIDON Stéphane LE ROUX Guillaume MELQUIOND (*) Assia MAHBOUBI (*) Ricardo CORIN (*) Gurvan LE GUERNIC Eugen ZALINESCU Tamara REZK (*) Kaustuv CHAUDURI (*?) Stefan GERHOLD Fanny CHEVALIER Niklas ELMQVIST Catherine LEDONTAL Tomer MOSCOVICH Theophanis TSANDILAS Nikolaus HANSEN (*?) Neva CHERNIAVSKY (*) Now on permanent INRIA position, (+) on permanent MSR 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.

Mathematical components Recent results: new tactics using Reflexion and Coq pattern matching advanced theorems of Linear Algebra Composition of Theories Coq development (ss-reflect more integrated inside Coq distrib) Objective: prove Feit-Thompson in 2011-12?!!

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 secure 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 Recent results: secure sessions v2 (proofs by typing) concurrent secure sessions v1 correctness proofs of TLS implementations information flow + cryptography secure logs secure modeling of e-cash

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

Tools for formal proofs Recent results: Proof Manager with incremental, non-linear proofs declarative meta-language proofs like done by Mathematicians proof of the atomic Bakery algorithm with PM

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 Recent results: arbitrary precision computations with certified bounds on numerical errors (used to determine lengths of Taylor expansions) approximations by Chebyshev series certificates (with proofs expressed in natural language) progress in GUI new releases of DDMF (last night)

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 Recent results: workshop on Interacting with Temporal Data at CHI 09 (35 participants) streamlining the computation of aggregated metrics on Wikipedia live and small focused Dashboard visualizations tools WILD: Wall-sized Interaction with Large Datasets (32 screens, 8 Vicon, 1 interactive table expansions) Augmented Paper/Electronic Notebooks

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 Recent results: multi-armed bandit techniques to select operators in evolutionary algorithms) adaptive search in continuous search spaces incremental learning for searching with constraint programming

Image and video mining for science and humanities Jean Ponce, ENS Andrew Blake, MSRC Francis Bach, INRIA Rocquencourt Hélène Dessales, ENS Néva Cherniavsky, MSR-INRIA Computer vision and Machine learning for: Patrick Pérez, INRIA Rennes Cordelia Schmid, INRIA Grenoble Bryan Russell, MSR-INRIA Ivan Laptev, INRIA Andrien Gaidon, MSR-INRIA 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

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

Conclusion

Objectives 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 vision and medical applications?