HTML Export for WCET 2012

Copy to Clipboard Download

<h2>OASIcs, Volume 23, WCET 2012</h2>
<ul>
<li>
    <span class="authors">Tullio Vardanega</span>
    <span class="title">OASIcs, Volume 23, WCET&#039;12, Complete Volume</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.WCET.2012">10.4230/OASIcs.WCET.2012</a>
</li>
<li>
    <span class="authors">Tullio Vardanega</span>
    <span class="title">Frontmatter, Table of Contents, Preface, Workshop Organization, List of Authors</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.WCET.2012.i">10.4230/OASIcs.WCET.2012.i</a>
</li>
<li>
    <span class="authors">Franck Cassez, René Rydhof Hansen, and Mads Chr. Olesen</span>
    <span class="title">What is a Timing Anomaly?</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.WCET.2012.1">10.4230/OASIcs.WCET.2012.1</a>
</li>
<li>
    <span class="authors">Mohamed Abdel Maksoud and Jan Reineke</span>
    <span class="title">An Empirical Evaluation of the Influence of the Load-Store Unit on WCET Analysis</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.WCET.2012.13">10.4230/OASIcs.WCET.2012.13</a>
</li>
<li>
    <span class="authors">Simon Wegener</span>
    <span class="title">Computing Same Block Relations for Relational Cache Analysis</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.WCET.2012.25">10.4230/OASIcs.WCET.2012.25</a>
</li>
<li>
    <span class="authors">Andreas Gustavsson, Jan Gustafsson, and Björn Lisper</span>
    <span class="title">Toward Static Timing Analysis of Parallel Software</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.WCET.2012.38">10.4230/OASIcs.WCET.2012.38</a>
</li>
<li>
    <span class="authors">Björn Lisper</span>
    <span class="title">Towards Parallel Programming Models for Predictability</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.WCET.2012.48">10.4230/OASIcs.WCET.2012.48</a>
</li>
<li>
    <span class="authors">Robert Mittermayr and Johann Blieberger</span>
    <span class="title">Timing Analysis of Concurrent Programs</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.WCET.2012.59">10.4230/OASIcs.WCET.2012.59</a>
</li>
<li>
    <span class="authors">Andrea Baldovin, Enrico Mezzetti, and Tullio Vardanega</span>
    <span class="title">A Time-composable Operating System</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.WCET.2012.69">10.4230/OASIcs.WCET.2012.69</a>
</li>
<li>
    <span class="authors">Jorge Garrido, Daniel Brosnan, Juan A. de la Puente, Alejandro Alonso, and Juan Zamorano</span>
    <span class="title">Analysis of WCET in an experimental satellite software development</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.WCET.2012.81">10.4230/OASIcs.WCET.2012.81</a>
</li>
<li>
    <span class="authors">Benedikt Huber, Daniel Prokesch, and Peter Puschner</span>
    <span class="title">A Formal Framework for Precise Parametric WCET Formulas</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.WCET.2012.91">10.4230/OASIcs.WCET.2012.91</a>
</li>
<li>
    <span class="authors">Amine Marref</span>
    <span class="title">Evolutionary Techniques for Parametric WCET Analysis</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.WCET.2012.103">10.4230/OASIcs.WCET.2012.103</a>
</li>
</ul>

The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.

Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail