The Ninth IEEE International Workshop on Object-Oriented Real-Time Dependable Systems (WORDS' 03)
DOI: 10.1109/words.2003.1267490
|View full text |Cite
|
Sign up to set email alerts
|

Input-Dependency Analysis for Hard Real-Time Software

Abstract: Abstract

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
5
0

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 5 publications
0
5
0
Order By: Relevance
“…3.2.) This use effectively corresponds to a reaching definition analysis [7]. Our abstraction will therefore need to capture information about whether input information can reach the definition of a variable.…”
Section: Abstract Interpretationmentioning
confidence: 99%
“…3.2.) This use effectively corresponds to a reaching definition analysis [7]. Our abstraction will therefore need to capture information about whether input information can reach the definition of a variable.…”
Section: Abstract Interpretationmentioning
confidence: 99%
“…IIPs are interesting candidates for trace driven analysis and profile feedback optimizations, since information common to any of their runs and input data can be extracted. IIPs, or input independent program sub-parts, can be identified through several approaches: input-dependency analysis by abstract interpretation [2]; static code analysis of control structures and conditionals by variable propagation; comparisons of traces resulting from a sufficient number of executions and showing the same execution behavior. Notice that this last approach can never be as reliable as the previous ones, but can give useful information relevant to the most frequent case.…”
Section: Introductionmentioning
confidence: 99%
“…A periodic polynomial is a polynomial whose coefficients are periodic numbers, i.e., a sequence of values indexed by the modulo of the variable relatively to the number of these values. For example, the periodic polynomial [1,2,3]x 2 + [3,4]x + 5 is equal to x 2 + 3x + 5 if x mod 3 = 0 and x mod 2 = 0.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Following this spirit, the papers in this issue cover a wide range of ORDC topics, including an online hardware feasibility test scheme for thread admission control in the multithreaded Java microcontroller developed in the Komodo project (Brinkschulte, 2003), a non-blocking buffer mechanism which can facilitate communication of event messages from a producer to a consumer without causing any party to experience blocking (Kim, 2003), a fault-tolerant approach to handle transient upsets of multiple components in a TTA (Time-Triggered Architecture) system (Steiner et al, 2003), an exception handling framework for mobile agent systems to operate in the presence of agent server crash failures (Xu and Pears, 2003), two strategies to better estimate the bound for the worst-case execution time (WCET) of a code, that is, a programming strategy (WCET-oriented programming) and a code transformation strategy (the single-path conversion technique) (Gustafsson et al, 2003), and a system named VisiTrack for video based incremental tracking on mobile devices (Stichling et al, 2003). These papers do not only show how important the ORDC technology is in various applications, but they also present interesting problems in the current ORDC technology that may open up new areas of research in the future.…”
mentioning
confidence: 99%