Real-Time Euclid: A language for reliable real-time systems

Kligerman, E.; Stoyenko, Alexander D.

doi:10.1109/tse.1986.6313049

Cited by 243 publications

(64 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Kligerman and Stoyenko [1], as well as Puschner and Koza [2] have listed the conditions for this problem to be decidable. These conditions are: (i) absence of recursive function calls, (ii) absence of dynamic structures and (iii) bounded loops.…”

Section: Related Workmentioning

confidence: 99%

Efficient microarchitecture modeling and path analysis for real-time software

Malik

Wolfe

Proceedings 16th IEEE Real-Time Systems Symposium

139

View full text Add to dashboard Cite

show abstract

Section: Related Workmentioning

confidence: 99%

Efficient microarchitecture modeling and path analysis for real-time software

Malik

Wolfe

Proceedings 16th IEEE Real-Time Systems Symposium

139

View full text Add to dashboard Cite

show abstract

“…Real-Time Euclid is one of the first real-time programming languages that features annotations for timing analysis [37]. It is structurally restricted in order to ensure the analyzability of programs.…”

Section: Real-time Euclidmentioning

confidence: 99%

Beyond loop bounds: comparing annotation languages for worst-case execution time analysis

et al. 2010

View full text Add to dashboard Cite

Worst-case execution time (WCET) analysis is concerned with computing a precise-as-possible bound for the maximum time the execution of a program can take. This information is indispensable for developing safety-critical real-time systems, e. g., in the avionics and automotive fields. Starting with the initial works of Chen, Mok, Puschner, Shaw, and others in the mid and late 1980s, WCET analysis turned into a well-established and vibrant field of research and development in academia and industry. The increasing number and diversity of hardware and software platforms and the ongoing rapid technological advancement became drivers for the development of a wide array of distinct methods and tools for WCET analysis. The precision, generality, and efficiency of these methods and tools depend much on the expressiveness and usability of the annotation languages that are used to describe feasible and infeasible program paths. In this article we survey the annotation languages which we consider formative for the field. By investigating and comparing their individual strengths and limitations with respect to a set of pivotal criteria, we provide a coherent overview of the state of the art. Identifying open issues, we encourage further research. This way, our approach is orthogonal and complementary to a recent approach of Wilhelm et al. who provide a thorough survey of WCET analysis methods and tools that have been developed and used in academia and industry.Keywords Worst-case execution time (WCET) analysis · Annotation languages · Path-oriented, constraint-oriented, and hierarchy-oriented WCET annotation languages · WCET annotation language challenge MotivationComputing the time that the execution of a program can take in the worst case is challenging. It requires to cope with analysis problems that are computationally intractable or undecidable. Tools and methods for worst-case execution time analysis (WCET) thus usually content themselves to computing an upper bound of the actual WCET. The precision, generality, and efficiency of these tools and methods depend much on the accurate description and identification of feasible and infeasible program paths. A program path is feasible, 123 412 R. Kirner et al. if there is an actual program execution taking this path; it is infeasible otherwise. In practice, this information is computed by fully automatic program analyses, where possible; it is manually provided by application programmers otherwise. In both cases this requires a dedicated language in order to annotate this information and to pass it on to a subsequent WCET analysis. Such a language is commonly called an annotation language. Over the past two decades, an array of conceptually quite diverse annotation languages has been proposed to support the needs of different WCET analysis methods and tools.In this article, we present a systematic and comprehensive comparison of the various approaches for WCET annotation languages. This acts on our suggestion of the WCET annotation language challenge [32] comple...

show abstract

“…For video coding algorithms, for instance, strict worst case analysis can lead to results one or two orders of magnitude higher than the typical complexity values that can be measured on typical video sequences [14], [15]. Moreover, restricted programming styles such as absence of dynamic data structures, recursion, and bounded loops are required so as to correctly perform a static analysis [16].…”

Section: A Static Approachesmentioning

confidence: 99%

High-abstraction level complexity analysis and memory architecture simulations of multimedia algorithms

Ravasi

Mattavelli

2005

IEEE Trans. Circuits Syst. Video Technol.

View full text Add to dashboard Cite

Abstract-An appropriate complexity analysis stage is the first and fundamental step for any methodology aiming at the implementation of today's (complex) multimedia algorithms. Such a stage may have different final implementation goals such as defining a new architecture dedicated to the specific multimedia standard under study, or defining an optimal instruction set for a selected processor architecture, or to guide the software optimization process in terms of control-flow and data-flow optimization targeting a specific architecture. The complexity of nowadays multimedia standards, in terms of number of lines of codes and cross-relations among processing algorithms that are activated by specific input signals, goes far beyond what the designer can reasonably grasp from the "pencil and paper" analysis of the (software) specifications. Moreover, depending on the implementation goal different measures and metrics are required at different steps of the implementation methodology or design flow. The process of extracting the desired measures needs to be supported by appropriate automatic tools, since code rewriting, at each design stage, may result resource consuming and error prone. This paper reviews the state of the art of complexity analysis methodologies oriented to the design of multimedia systems and presents an integrated tool for automatic analysis capable of producing complexity results based on rich and customizable metrics. The tool is based on a C virtual machine that allows extracting from any C program execution the operations and data-flow information, according to the defined metrics. The tool capabilities include the simulation of virtual memory architectures. This paper shows some examples of complexity analysis results that can be yielded with the tool and presents how the tools can be used at different stages of implementation methodologies.Index Terms-Complexity analysis, computational complexity, data-exchange, virtual architecture simulation.

show abstract

Real-Time Euclid: A language for reliable real-time systems

Cited by 243 publications

References 8 publications

Efficient microarchitecture modeling and path analysis for real-time software

Efficient microarchitecture modeling and path analysis for real-time software

Beyond loop bounds: comparing annotation languages for worst-case execution time analysis

High-abstraction level complexity analysis and memory architecture simulations of multimedia algorithms

Contact Info

Product

Resources

About