Run-Time Guarantees for Real-Time Systems—The USES Approach

Ferdinand, Christian; Kastner, Daniel L.; Langenbach, Marc; Martin, Florian; Schmidt, Michael D.; Schneider, Jörn; Theiling, Henrik; Thesing, Stephan; Wilhelm, Reinhard

doi:10.1007/978-3-662-01069-3_60

Cited by 12 publications

(6 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Dynamic methods estimate the WCET by measurements [12]. Methods to measure the execution time can be divided into three different categories: hardware (1) software (2) and hybrid methods (3). The hardware methods include measuring execution time using oscilloscopes, logic analyzers and emulators.…”

Section: Dynamic Estimationmentioning

confidence: 99%

“…With the appearance of new architectures intended to increase the computing performance of the processors (superscalar processor), computing the WCET for a code sequence requires to abstract complex processor units like the cache memory, the pipeline, the speculative execution or re-scheduling of instructions. Among all the various approaches, the one developped by R. Wilhelm and the AbsInt team [3] is certainly the most mature one. As represented in figure 1, WCET computation is carried out by a succession of analyses [3,7].…”

Section: Static Analysismentioning

confidence: 99%

“…Among all the various approaches, the one developped by R. Wilhelm and the AbsInt team [3] is certainly the most mature one. As represented in figure 1, WCET computation is carried out by a succession of analyses [3,7]. First the control flow graph (CFG) is extracted from the binary code.…”

Section: Static Analysismentioning

confidence: 99%

See 2 more Smart Citations

Computing WCET using symbolic execution

Benhamamouch

Monsuez

Védrine

2008

Electronic Workshops in Computing

View full text Add to dashboard Cite

We propose a novel formal method to compute an upper estimation of the WCET that contains the loss of precision and also can be easily parametrized by the hardware architecture. Assuming that there exists an executable timed model of the hardware, we first use symbolic execution [5] to precisely infer the execution time for a given instruction flow. We secondly identify execution states that can be merged with no loss of precision. Depending on the loss of precision we are ready to accept, we finally merge execution paths that have similar execution times.

show abstract

Section: Dynamic Estimationmentioning

confidence: 99%

Section: Static Analysismentioning

confidence: 99%

See 1 more Smart Citation

Computing WCET using symbolic execution

Benhamamouch

Monsuez

Védrine

2008

Electronic Workshops in Computing

View full text Add to dashboard Cite

show abstract

“…Unlike the static analysis based approach [3,4], our measurement based [6] analysis requires large test suites to obtain reliable results. We are thus developing tools to efficiently generate these test sets in a whitebox-testing approach.…”

Section: Introductionmentioning

confidence: 99%

A Benchmarking Suite for Measurement-Based WCET Analysis Tools

Bünte

Tautschnig

2008

2008 IEEE International Conference on Software Testing Verification and Validation Workshop

View full text Add to dashboard Cite

Worst case execution time analysis based on measurements requires large test suites to obtain reliable numbers. We are thus developing tools to efficiently generate these test sets in a whitebox-testing approach.To make project progress measurable and guard against regressions, a benchmarking suite is sought for. We present a set of requirements that have been collected and outline the design of a benchmarking tool-set. While we are currently developing our domain-specific tool chain, we assume the presented architecture to be sufficiently general.

show abstract

“…Only the TDL specifications and the decoder plug-ins for exec2crl are architecture dependent, so a generic analysis framework is created. CRL files (Control flow Representation Language, [5,111) store the ICFG target independently. CRL consists of routines, containing basic blocks, containing instructions, containing operations.…”

Section: Themodulesmentioning

confidence: 99%

Extracting safe and precise control flow from binaries

Theiling

Proceedings Seventh International Conference on Real-Time Computing Systems and Applications

View full text Add to dashboard Cite

As a starting point for static program analysis a control flow graph (CFG) is needed. If only the binary executable is available, this CFG has to be reconstructed from sequences of instructions.The usual way to do this is a top-down approach: the executable's information about routines is used to split the sequence into routines, and then, each instruction is analysed for branch targets in order to compute basic block boundaries.When analysing safety critical real-time systems, safe and precise results are needed. The CFG the analyses traverse has to satisfy the same safety and precision requirements, because the analyses inherit all deficiencies.In this paper a bottom-up approach for CFG approximation is presented. It starts at a set of entry points and clusters the sequence of instructions into larger units like blocks and routines. By this the algorithm is able to account for uncertainties early to generate a safe CFG.

show abstract

Run-Time Guarantees for Real-Time Systems—The USES Approach

Cited by 12 publications

References 4 publications

Computing WCET using symbolic execution

Computing WCET using symbolic execution

A Benchmarking Suite for Measurement-Based WCET Analysis Tools

Extracting safe and precise control flow from binaries

Contact Info

Product

Resources

About