Marc Pantel

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Nassima Izerrouken

> Home > Persons > Marc Pantel

Publications

2011
[j8]
- view
  authority control:
- export record
  dblp key:
  - journals/tsi/IzerroukenPTK11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tsi/IzerroukenPTK11
Nassima Izerrouken, Marc Pantel, Xavier Thirioux, Olivier Ssi Yan Kai:
Expérimentations en Coq pour un générateur de code qualifiable. Tech. Sci. Informatiques 30(4): 409-440 (2011)
2010
[c18]
- view
  authority control:
- export record
  dblp key:
  - conf/edcc/IzerroukenKPT10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/edcc/IzerroukenKPT10
Nassima Izerrouken, Olivier Ssi Yan Kai, Marc Pantel, Xavier Thirioux:
Use of formal methods for building qualified code generator for safer automotive systems. EDCC-CARS 2010: 53-56
2009
[c15]
- view
  authority control:
- export record
  dblp key:
  - conf/fmics/IzerroukenPTK09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fmics/IzerroukenPTK09
Nassima Izerrouken, Marc Pantel, Xavier Thirioux, Olivier Ssi Yan Kai:
Integrated Formal Approach for Qualified Critical Embedded Code Generator. FMICS 2009: 199-201
[c14]
- view
  authority control:
- export record
  dblp key:
  - conf/icfem/IzerroukenPT09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icfem/IzerroukenPT09
Nassima Izerrouken, Marc Pantel, Xavier Thirioux:
Machine-Checked Sequencer for Critical Embedded Code Generator. ICFEM 2009: 521-540

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.