Institute of Computer Languages
Compilers and Languages Group

Talks 2009 - Clément Ballabriga

Der Arbeitsbereich für Programmiersprachen und Übersetzer am Institut für Computersprachen lädt zu folgendem Vortrag ein:

Clément Ballabriga, M.Sc.

Université Paul Sabatier, TRACES/IRIT, Toulouse, France

über

An Introduction to OTAWA

Datum: Dienstag, 21. April 2009
Zeit: 11:00 (s.t.)
Location: TU Wien, Bibliothek E185.1, Argentinierstraße 8, 4. Stock (Mitte)

Abstract:

OTAWA is a freeware application dedicated to the computation of the WCET of programs. More precisely, OTAWA concerns the numerous WCET approaches based on static analyses of the executable program. Unlike many existing usual tools, the choice has been done to avoid specialisation and to produce, instead, a generic and open framework. WCET computation has always required to pass flow fact information from the user to the computation analysis even with tools including loop bound analyses. From the start of OTAWA and overmore with the use of the oRange, OTAWA has developed a more and more extensible annotation system based on XML file. In the last project, this annotation system has been largely extended to embed timing information and user domain definitions and to locate accurately information in the program and in the execution time.

About Clément Ballabriga

Clément Ballabriga is a PhD student supervised by Hugues Cassé since 2006 and works on cache behavior, partial analysis and abstract interpretation. He is a member of the TRACES team whose research interests include hardware issues of real-time embedded systems. The main goal is to guarantee that the execution time of an application code meets the system deadlines. We focus on characterizing the temporal properties of components off-the-shelves. Our target is to propose ways to use these components such that safe and tight worst-case execution time estimates can be computed. We also study architectural extensions that should improve the time predictability of the components. The estimation of the WCET requires three steps: a static analysis of the code identifies all the possible execution paths; the target hardware is modelled to determine the individual execution times of the basic blocks; then, the results of the previous steps are combined to evaluate an upper bound of the global execution time. Part of our work concerns the first and second steps.
(http://www.irit.fr/recherches/ARCHI/MARCH/index.php3)

Sie möchten auf diesen Vortrag durch Aushang hinweisen? Eine druckfertige Einladung im pdf-Format dafür finden Sie hier.

Complang
   About Us
   Research
   Lehre
   Service
      Robotics
      Library
      Talks 2017
      Talks 2016
      Talks 2015
      Talks 2014
      Talks 2013
      Talks 2012
      Talks 2011
      Talks 2010
      Talks 2009
      Talks 2008
      Talks 2007
      Talks 2006
      Talks 2005
      Talks 2004
Sitemap
Contact
Fast Access:
Previous Talk
Next Talk
Faculty of Informatics
Vienna University of Technology
top | HTML 4.01 | last update: 2017-02-13 (Webmaster)