SWEET - a Tool for WCET Flow Analysis

Oversætterhistorie. Med mere.

An important part of Worst-Case Execution Time (WCET) analysis is to find constraints on the possible program flows.  Upper bounds on the number of loop iterations are necessary to bound the execution time at all, and other kinds of constraints can help increasing the precision of the WCET analysis significantly by ruling out certain paths. Thus, methods and tools to find such constraints are sorely needed. Without such tools, such constraints must be provided manually by the user: this can be tedious and error-prone, and the soundness of the WCET analysis may be compromised if unsound program flow constraints are specified.

SWEET (SWEdish Execution Time tool) is a tool that derives such program flow constraints, encoded as arithmetic constraints on execution counters (so-called "Flow Facts"), automatically. SWEET can compute a variety of Flow Facts, from simple loop iteration bounds to complex infeasible path constraints. It can analyze a variety of code formats through translation into an intermediate format.  In this talk we will first give a short introduction to WCET analysis. Then we will describe the capabilities of SWEET, the algorithms used, and its architecture.

Abstract om oversætterhistorie
We give some highlights of the historical development of compiler technology 1950-1965 and its co-evolution with programming languages and hardware.  Most emphasis is on early developments and the different approaches taken by US (Fortran) and European (Algol) projects, including contributions by Böhm, Rutishauser, Bauer, Samelson, Dijkstra, Naur and Hoare.  Some extra attention is given to the development of autocodes and compilers in the Nordic countries 1955-1965: FA-5 and Autokod for BESK in Stockholm, Dahl's MAC for the Ferranti Mercury in Oslo, the loader for DASK in Copenhagen, the Algol 60 compilers for DASK and GIER in Copenhagen, FACIT in Göteborg, SMIL in Lund, and finally Simula in Oslo.

Tilmelding ved mail til: jbi@tekkva.dk



08.30 - 09.00   Ankomst og kaffe

09.00 - 09.05   Velkomst
v. Bent Thomsen

09.05 - 10.00   SWEET - a Tool for WCET Flow Analysis
v. Björn Lisper, professor in Computer Engineering at Mälardalen University, Sweden

10.00 - 10.10   Kaffe

10-10 - 11.05   A history of compilers and autocoders
v. Peter Sestoft, IT University of Copenhagen

11.05 - 11.15   Pause

11.15 - 12.00   Implementing invokedynamic in the HVM, and why the Java execution environment is poorly designed
v. Stephan Korsholm, Via University College

12.00 - 13.00   Sandwich

13.00 - 14.00   Ph.d.-forsvar: Platforms and Model-Based Analyses for Real-Time Java
v. Kaster Søe Luckow

14.00 - 16.00   Spørgerunde

16.00   Reception

Tid og sted

Dato:  24. november 2014
Tid:  Kl. 9.00-12.00. Kaffe fra kl. 8.30. Mulighed for at overvære ph.d.-forsvar kl. 13-16.
Sted:  Datalogisk Institut, Aalborg Universitet, Selma Lagerlöfsvej 300, 9220 Aalborg Ø, rum 0.2.13
Pris:  Deltagelse er gratis, men tilmelding er påkrævet. Dog beregnes et no-show-gebyr på 200 kr.
Kontakt navn:  Jørgen Biegel, tlf. 96 35 45 65
Kontakt e-mail
Tilmeldingsfrist:  21. november 2014

Se alle Infinit arrangementer

Netværkets aktiviteter er medfinansieret af Uddannelses- og Forskningsministeriet og drives af et konsortium bestående af:
Alexandra Instituttet . BrainsBusiness . CISS . Datalogisk Institut, Københavns Universitet . DELTA . DTU Compute, Danmarks Tekniske Universitet . Institut for Datalogi, Aarhus Universitet . IT-Universitetet . Knowledge Lab, Syddansk Universitet . Væksthus Hovedstadsregionen . Aalborg Universitet