Reinhard Wilhelm

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 Michael Schmidt 0007

> Home > Persons > Reinhard Wilhelm

Publications

2003
[c51]
- view
- export record
  dblp key:
  - conf/gi/FerdinandKMLSWHFTFTSEW03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/gi/FerdinandKMLSWHFTFTSEW03
Christian Ferdinand, Daniel Kästner, Florian Martin, Marc Langenbach, Martin Sicks, Stephan Wilhelm, Reinhold Heckmann, Nicolas Fritz, Stephan Thesing, Frank Fontaine, Henrik Theiling, Michael Schmidt, Alexander A. Evstiougov-Babaev, Reinhard Wilhelm:
Validierung des Zeitverhaltens von kritischer Echtzeit-Software. GI Jahrestagung (1) 2003: 335-339
2001
[c47]
- view
  authority control:
- export record
  dblp key:
  - conf/emsoft/FerdinandHLMSTTW01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/emsoft/FerdinandHLMSTTW01
Christian Ferdinand, Reinhold Heckmann, Marc Langenbach, Florian Martin, Michael Schmidt, Henrik Theiling, Stephan Thesing, Reinhard Wilhelm:
Reliable and Precise WCET Determination for a Real-Life Processor. EMSOFT 2001: 469-485
1999
[c44]
- view
  authority control:
- export record
  dblp key:
  - conf/gi/FerdinandKLMSSTTW99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/gi/FerdinandKLMSSTTW99
Christian Ferdinand, Daniel Kästner, Marc Langenbach, Florian Martin, Michael Schmidt, Jörn Schneider, Henrik Theiling, Stephan Thesing, Reinhard Wilhelm:
Run-Time Guarantees for Real-Time Systems - The USES Approach. GI Jahrestagung 1999: 410-419

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.