MPI-INF D1 Publications: Report

Technical, Research Report
@TechReport
Technischer-, Forschungsbericht

Show entries of:

this year (2020) | last year (2019) | two years ago (2018) | Notes URL

Action:

Options:

Library locked

Goto entry point

Author, Editor

Author(s):

Althaus, Ernst
Altmeyer, Sebastian
Naujoks, Rouven

dblp
dblp
dblp

Not MPG Author(s):

Althaus, Ernst
Altmeyer, Sebastian

Editor(s):

Becker, Bernd
Damm, Werner
Fränzle, Martin
Olderog, Ernst-Rüdiger
Podelski, Andreas
Wilhelm, Reinhard

dblp
dblp
dblp
dblp
dblp
dblp

Not MPII Editor(s):

Becker, Bernd
Damm, Werner
Fränzle, Martin
Olderog, Ernst-Rüdiger
Podelski, Andreas
Wilhelm, Reinhard

BibTeX Citekey*:	Naujoks10a
Language:	English

Title, Institution

Title*:	A New Combinatorial Approach to Parametric Path Analysis
Institution*:	SFB/TR 14 AVACS
Publishers or Institutions Address*:	SFB/TR 14 AVACS
Type:	Reports of SFB/TR 14 AVACS

No, Year, pp.,

Number*:	ATR 58	Pages*:	33
Month:	June	VG Wort Pages*:	33
Year*:	2010	ISBN/ISSN:	1860-9821

DOI:

Note, Abstract, ©

Note:
(LaTeX) Abstract:	Hard real-time systems require tasks to finish in time. To guarantee the timeliness of such a system, static timing analyses derive upper bounds on the \emph{worst-case execution time} of tasks. There are two types of timing analyses: numeric and parametric ones. A numeric analysis derives a numeric timing bound and, to this end, assumes all information such as loop bounds to be given a priori. If these bounds are unknown during analysis time, a parametric analysis can compute a timing formula parametric in these variables. A performance bottleneck of timing analyses, numeric and especially parametric, can be the so-called path analysis, which determines the path in the analyzed task with the longest execution time bound. In this paper, we present a new approach to the path analysis. This approach exploits the rather regular structure of software for hard real-time and safety-critical systems. As we show in the evaluation of this paper, we strongly improve upon former techniques in terms of precision and runtime in the parametric case. Even in the numeric case, our approach matches up to state-of-the-art techniques and may be an alternative to commercial tools employed for path analysis.
Categories / Keywords:	Combinatorial Optimization
Copyright Message:
HyperLinks / References / URLs:	http://www.avacs.org/Publikationen/Open/avacs_technical_report_058.pdf
Personal Comments:
File Upload:
Download Access Level:	Public

Correlation

MPG Unit:	Max-Planck-Institut für Informatik

MPG Subunit:	Algorithms and Complexity Group
Appearance:	MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort

BibTeX Entry:

@TECHREPORT{Naujoks10a,
AUTHOR = {Althaus, Ernst and Altmeyer, Sebastian and Naujoks, Rouven},
EDITOR = {Becker, Bernd and Damm, Werner and Fr{\"a}nzle, Martin and Olderog, Ernst-R{\"u}diger and Podelski, Andreas and Wilhelm, Reinhard},
TITLE = {A New Combinatorial Approach to Parametric Path Analysis},
YEAR = {2010},
TYPE = {Reports of SFB/TR 14 AVACS},
INSTITUTION = {SFB/TR 14 AVACS},
NUMBER = {ATR 58},
PAGES = {33},
ADDRESS = {SFB/TR 14 AVACS},
MONTH = {June},
ISBN = {1860-9821},
}

Entry last modified by Anja Becker, 01/13/2011

Edit History (please click the blue arrow to see the details)

	Editor(s) [Library]	Created 01/07/2011 02:00:46 PM
Revisions 5. 4. 3. 2. 1.	Editor(s) Anja Becker Rouven Naujoks Rouven Naujoks Rouven Naujoks Rouven Naujoks	Edit Dates 13.01.2011 10:12:57 07.01.2011 14:08:37 07.01.2011 14:04:04 07.01.2011 14:03:13 07.01.2011 14:01:49

Attachment Section