The Worst Case Execution Time Tool Challenge 2006: The External Test

Tan, Lili

doi:10.1109/isola.2006.73

Cited by 19 publications

(5 citation statements)

References 1 publication

(1 reference statement)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Challenge was executed by a neutral person, Lili Tan of the University Duisburg-Essen. Her findings are published in [Tan07]. They support the above claims about usability of some tools and precision of the results.…”

Section: Architectural Trendssupporting

confidence: 68%

The worst-case execution-time problem—overview of methods and survey of tools

Wilhelm

Engblom²,

Ermedahl

et al. 2008

ACM Trans. Embed. Comput. Syst.

1,460

1,029

View full text Add to dashboard Cite

Abstract. The determination of upper bounds on execution times, commonly called WorstCase Execution Times (WCETs), is a necessary step in the development and validation process for hard real-time systems. This problem is hard if the underlying processor architecture has components such as caches, pipelines, branch prediction, and other speculative components. This article describes different approaches to this problem and surveys several commercially available tools and research prototypes.

show abstract

Section: Architectural Trendssupporting

confidence: 68%

The worst-case execution-time problem—overview of methods and survey of tools

Wilhelm

Engblom²,

Ermedahl

et al. 2008

ACM Trans. Embed. Comput. Syst.

1,460

1,029

View full text Add to dashboard Cite

show abstract

“…While [36] concentrates on the design of the Challenge and summarizes test results obtained by tool developers, this paper focuses on the independent evaluation. It provides an in-depth analysis and interpretation of the results, extending a previous paper [40].…”

supporting

confidence: 63%

The worst-case execution time tool challenge 2006

Tan

2009

Int J Softw Tools Technol Transfer

Self Cite

View full text Add to dashboard Cite

The first international Worst Case Execution Time (WCET) Tool Challenge in 2006 used benchmark programs to evaluate academic and commercial WCET tools. It aimed to study the state-of-the-art in WCET analysis. The WCET Tool Challenge comprised two parallel evaluation approaches: an internal evaluation by the respective tool developers and an external test by a neutral person of an independent institute. The latter was conducted by the author of this paper. Focusing on the external test, we describe the rules, benchmarks, participants and discuss the obtained results.

show abstract

“…We remark that the average input completion time and worst case time are very similar for these programs. To find T for larger programs, one may use established techniques in determining worst case execution time (e.g., a tool from [54]).…”

Section: Discussionmentioning

confidence: 99%

HOP: Hardware makes Obfuscation Practical

Nayak

Fletcher

Ren

et al. 2017

Proceedings 2017 Network and Distributed System Security Symposium

View full text Add to dashboard Cite

Program obfuscation is a central primitive in cryptography, and has important real-world applications in protecting software from IP theft. However, well known results from the cryptographic literature have shown that software only virtual black box (VBB) obfuscation of general programs is impossible. In this paper we propose HOP, a system (with matching theoretic analysis) that achieves simulation-secure obfuscation for RAM programs, using secure hardware to circumvent previous impossibility results. To the best of our knowledge, HOP is the first implementation of a provably secure VBB obfuscation scheme in any model under any assumptions. HOP trusts only a hardware single-chip processor. We present a theoretical model for our complete hardware design and prove its security in the UC framework. Our goal is both provable security and practicality. To this end, our theoretic analysis accounts for all optimizations used in our practical design, including the use of a hardware Oblivious RAM (ORAM), hardware scratchpad memories, instruction scheduling techniques and context switching. We then detail a prototype hardware implementation of HOP. The complete design requires 72% of the area of a V7485t Field Programmable Gate Array (FPGA) chip. Evaluated on a variety of benchmarks, HOP achieves an overhead of 8× ∼ 76× relative to an insecure system. Compared to all prior (not implemented) work that strives to achieve obfuscation, HOP improves performance by more than three orders of magnitude. We view this as an important step towards deploying obfuscation technology in practice. Permission to freely reproduce all or part of this paper for noncommercial purposes is granted provided that copies bear this notice and the full citation on the first page. Reproduction for commercial purposes is strictly prohibited without the prior written consent of the Internet Society, the first-named author (for reproduction of an entire paper only), and the author's employer if the paper was prepared within the scope of employment.

show abstract

The Worst Case Execution Time Tool Challenge 2006: The External Test

Cited by 19 publications

References 1 publication

The worst-case execution-time problem—overview of methods and survey of tools

The worst-case execution-time problem—overview of methods and survey of tools

The worst-case execution time tool challenge 2006

HOP: Hardware makes Obfuscation Practical

Contact Info

Product

Resources

About