David Nowak

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 Narjes Jomaa

> Home > Persons > David Nowak

Publications

2018
[j11]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/eceasst/JomaaTNGH18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eceasst/JomaaTNGH18
Narjes Jomaa, Paolo Torrini, David Nowak, Gilles Grimaud, Samuel Hym:
Proof-Oriented Design of a Separation Kernel with Minimal Trusted Computing Base. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 76 (2018)
[j10]
- view
  authority control:
- export record
  dblp key:
  - journals/scp/JomaaNGH18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/scp/JomaaNGH18
Narjes Jomaa, David Nowak, Gilles Grimaud, Samuel Hym:
Formal proof of dynamic memory isolation based on MMU. Sci. Comput. Program. 162: 76-92 (2018)
[c23]
- view
  authority control:
- export record
  dblp key:
  - conf/vstte/TorriniNJC18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/vstte/TorriniNJC18
Paolo Torrini, David Nowak, Narjes Jomaa, Mohamed Sami Cherif:
Formalising Executable Specifications of Low-Level Systems. VSTTE 2018: 155-176
2016
[c21]
- view
  authority control:
- export record
  dblp key:
  - conf/tase/JomaaNGH16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/tase/JomaaNGH16
Narjes Jomaa, David Nowak, Gilles Grimaud, Samuel Hym:
Formal Proof of Dynamic Memory Isolation Based on MMU. TASE 2016: 73-80

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.