<?xml version="1.0" encoding="utf-8"?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1 plus MathML 2.0 plus SVG 1.1//EN" "http://www.w3.org/2002/04/xhtml-math-svg/xhtml-math-svg.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
  <head>
    <meta http-equiv="Content-Type" content="application/xhtml+xml; charset=utf-8"/>
    <title>Project-Team:MARELLE</title>
    <link rel="stylesheet" href="../static/css/raweb.css" type="text/css"/>
    <meta name="description" content="Overall Objectives - Overall Objectives"/>
    <meta name="dc.title" content="Overall Objectives - Overall Objectives"/>
    <meta name="dc.subject" content=""/>
    <meta name="dc.publisher" content="INRIA"/>
    <meta name="dc.date" content="(SCHEME=ISO8601) 2016-01"/>
    <meta name="dc.type" content="Report"/>
    <meta name="dc.language" content="(SCHEME=ISO639-1) en"/>
    <meta name="projet" content="MARELLE"/>
    <script type="text/javascript" src="https://raweb.inria.fr/rapportsactivite/RA2016/static/MathJax/MathJax.js?config=TeX-MML-AM_CHTML">
      <!--MathJax-->
    </script>
  </head>
  <body>
    <div class="tdmdiv">
      <div class="logo">
        <a href="http://www.inria.fr">
          <img style="align:bottom; border:none" src="../static/img/icons/logo_INRIA-coul.jpg" alt="Inria"/>
        </a>
      </div>
      <div class="TdmEntry">
        <div class="tdmentete">
          <a href="uid0.html">Project-Team Marelle</a>
        </div>
        <span>
          <a href="uid1.html">Members</a>
        </span>
      </div>
      <div class="tdmActPage">
        <a href="./uid3.html">Overall Objectives</a>
      </div>
      <div class="TdmEntry">Research Program<ul><li><a href="uid5.html&#10;&#9;&#9;  ">Type theory and formalization
of mathematics</a></li><li><a href="uid6.html&#10;&#9;&#9;  ">Verification of scientific
algorithms</a></li><li><a href="uid7.html&#10;&#9;&#9;  ">Programming language semantics</a></li></ul></div>
      <div class="TdmEntry">New Software and Platforms<ul><li><a href="uid9.html&#10;&#9;&#9;  ">Coq</a></li><li><a href="uid14.html&#10;&#9;&#9;  ">Easycrypt</a></li><li><a href="uid18.html&#10;&#9;&#9;  ">Math-Components</a></li><li><a href="uid25.html&#10;&#9;&#9;  ">Ssreflect</a></li><li><a href="uid29.html&#10;&#9;&#9;  ">Zoocrypt</a></li></ul></div>
      <div class="TdmEntry">New Results<ul><li><a href="uid34.html&#10;&#9;&#9;  ">Implementing Theorem Proving in Higher Order Logic Programming</a></li><li><a href="uid35.html&#10;&#9;&#9;  ">Coqoon: An IDE for interactive proof development in Coq</a></li><li><a href="uid36.html&#10;&#9;&#9;  ">A book on mathematical components</a></li><li><a href="uid37.html&#10;&#9;&#9;  ">Proofs of transcendence</a></li><li><a href="uid38.html&#10;&#9;&#9;  ">Cubical type theory and univalent foundations</a></li><li><a href="uid39.html&#10;&#9;&#9;  ">Formal study of double-word arithmetic algorithms</a></li><li><a href="uid40.html&#10;&#9;&#9;  ">Formal foundations of 3D geometry for robot manipulators</a></li><li><a href="uid41.html&#10;&#9;&#9;  ">Finites sets, finite maps, multisets, order types</a></li><li><a href="uid42.html&#10;&#9;&#9;  ">CoqEAL and modular large scale reflection</a></li><li><a href="uid43.html&#10;&#9;&#9;  ">Formalization of semi-algebraic sets</a></li><li><a href="uid44.html&#10;&#9;&#9;  ">Formalizing the Spectral Theorem</a></li><li><a href="uid45.html&#10;&#9;&#9;  ">A formal proof of La Salle's invariance principle</a></li><li><a href="uid46.html&#10;&#9;&#9;  ">Formalizing Delaunay triangulations</a></li><li><a href="uid47.html&#10;&#9;&#9;  ">Formalizing Quantum Computing</a></li><li><a href="uid48.html&#10;&#9;&#9;  ">Formalizing De Bruijn Sequences</a></li><li><a href="uid49.html&#10;&#9;&#9;  ">Formalizing Hanoi towers</a></li><li><a href="uid50.html&#10;&#9;&#9;  ">Implementation of Bourbaki's Theory of Sets in Coq</a></li><li><a href="uid51.html&#10;&#9;&#9;  ">Factorization of ordinal numbers</a></li><li><a href="uid52.html&#10;&#9;&#9;  ">New logics for differential privacy</a></li><li><a href="uid53.html&#10;&#9;&#9;  ">Formalizing counter-measures for differential power analysis</a></li></ul></div>
      <div class="TdmEntry">Partnerships and Cooperations<ul><li><a href="uid55.html&#10;&#9;&#9;  ">National Initiatives</a></li><li><a href="uid59.html&#10;&#9;&#9;  ">International Initiatives</a></li><li><a href="uid62.html&#10;&#9;&#9;  ">International Research Visitors</a></li></ul></div>
      <div class="TdmEntry">Dissemination<ul><li><a href="uid66.html&#10;&#9;&#9;  ">Promoting Scientific Activities</a></li><li><a href="uid83.html&#10;&#9;&#9;  ">Teaching - Supervision - Juries</a></li><li><a href="uid93.html&#10;&#9;&#9;  ">Popularization</a></li></ul></div>
      <div class="TdmEntry">
        <div>Bibliography</div>
      </div>
      <div class="TdmEntry">
        <ul>
          <li>
            <a id="tdmbibentmajor" href="bibliography.html">Major publications</a>
          </li>
          <li>
            <a id="tdmbibentyear" href="bibliography.html#year">Publications of the year</a>
          </li>
          <li>
            <a id="tdmbibentfoot" href="bibliography.html#References">References in notes</a>
          </li>
        </ul>
      </div>
    </div>
    <div id="main">
      <div class="mainentete">
        <div id="head_agauche">
          <small><a href="http://www.inria.fr">
	    
	    Inria
	  </a> | <a href="../index.html">
	    
	    Raweb 
	    2016</a> | <a href="http://www.inria.fr/en/teams/marelle">Presentation of the Project-Team MARELLE</a> | <a href="http://team.inria.fr/marelle/en/">MARELLE Web Site
	  </a></small>
        </div>
        <div id="head_adroite">
          <table class="qrcode">
            <tr>
              <td>
                <a href="marelle.xml">
                  <img style="align:bottom; border:none" alt="XML" src="../static/img/icons/xml_motif.png"/>
                </a>
              </td>
              <td>
                <a href="marelle.pdf">
                  <img style="align:bottom; border:none" alt="PDF" src="IMG/qrcode-marelle-pdf.png"/>
                </a>
              </td>
              <td>
                <a href="../marelle/marelle.epub">
                  <img style="align:bottom; border:none" alt="e-pub" src="IMG/qrcode-marelle-epub.png"/>
                </a>
              </td>
            </tr>
            <tr>
              <td/>
              <td>PDF
</td>
              <td>e-Pub
</td>
            </tr>
          </table>
        </div>
      </div>
      <!--FIN du corps du module-->
      <br/>
      <div class="bottomNavigation">
        <div class="tail_aucentre">
          <a href="./uid1.html" accesskey="P"><img style="align:bottom; border:none" alt="previous" src="../static/img/icons/previous_motif.jpg"/> Previous | </a>
          <a href="./uid0.html" accesskey="U"><img style="align:bottom; border:none" alt="up" src="../static/img/icons/up_motif.jpg"/>  Home</a>
          <a href="./uid5.html" accesskey="N"> | Next <img style="align:bottom; border:none" alt="next" src="../static/img/icons/next_motif.jpg"/></a>
        </div>
        <br/>
      </div>
      <div id="textepage">
        <!--DEBUT2 du corps du module-->
        <h2>Section: 
      Overall Objectives</h2>
        <h3 class="titre3">Overall Objectives</h3>
        <p>We want to concentrate on the development of mathematical libraries
for theorem proving tools. This objective contributes to two main
areas of application: tools for mathematicians and
correctness verification tools for software dealing with numerical
computation.</p>
        <p>In the short term, we aim for mathematical libraries that concern
polynomials, algebra, group theory, floating point numbers, real
numbers, big integers, probabilities and geometrical objects. In the
long run, we think that this will involve any function that may be of
use in embedded software for control or robotics (in what is called
hybrid systems, systems that contain both software and physical
components) and in cryptographical systems. We want to integrate
these libraries in theorem proving tools because we believe they will
become important tools for mathematical practice and for engineers who
need to prove the correctness of their algorithms and software.</p>
        <p>We believe that theorem proving tools are good tools to produce
highly dependable software, because they provide a framework where
algorithms and specifications can be studied uniformly and often
provide means to mechanically derive programs that are
correct by construction.</p>
        <p>We also study the extensibility of interactive theorem proving tools
based on decision procedures that free designers from the burden of
verifying some of the required properties. We often rely on
“satisfiability modulo theory” procedures, which can be connected to
theorem proving tools in a way that preserves the trustability of the
final results.</p>
      </div>
      <!--FIN du corps du module-->
      <br/>
      <div class="bottomNavigation">
        <div class="tail_aucentre">
          <a href="./uid1.html" accesskey="P"><img style="align:bottom; border:none" alt="previous" src="../static/img/icons/previous_motif.jpg"/> Previous | </a>
          <a href="./uid0.html" accesskey="U"><img style="align:bottom; border:none" alt="up" src="../static/img/icons/up_motif.jpg"/>  Home</a>
          <a href="./uid5.html" accesskey="N"> | Next <img style="align:bottom; border:none" alt="next" src="../static/img/icons/next_motif.jpg"/></a>
        </div>
        <br/>
      </div>
    </div>
  </body>
</html>
