Timing analysis of assembler code control-flow paths

Timinganalysis of assembler code is essential to achieve the strongest possible guarantee of correctness for safety-critical, real-time software. Previous work has shown how timingconstrain ts on controlflow paths through high-level language programs can be formalised using the semantics of the statements comprisingthe path. We extend these results to assembler-level code where it becomes possible to not only determine timingconstrain ts, but also to verify them against the known execution times for each instruction. A minimal formal model is developed with both a weakest liberal precondition and a strongest postcondition semantics. However, despite the formalism’s simplicity, it is shown that complex timingb ehaviour associated with instruction pipeliningand iterative code can be modelled accurately.

Programs as paths: An approach to timing constraint analysis

A program can be decomposed into a set of possible execution paths. These can be described in terms of primitives such as assignments, assumptions and coercions, and composition operators such as sequential composition and nondeterministic choice as well as finitely or infinitely iterated sequential composition. Some of these paths cannot possibly be followed (they are dead or infeasible), and they may or may not terminate. Decomposing programs into paths provides a foundation for analyzing properties of programs. Our motivation is timing constraint analysis of real-time programs, but the same techniques can be applied in other areas such as program testing. In general the set of execution paths for a program is infinite. For timing analysis we would like to decompose a program into a finite set of subpaths that covers all possible execution paths, in the sense that we only have to analyze the subpaths in order to determine suitable timing constraints that cover all execution paths.

Not if but when: Out-group reactions to the timing of disclosure of an individual's same-sex attractions

One factor that research suggests impedes positive contact between outgroup members is the experience of anxiety that can occur when anticipating negative consequences of such interactions. Research examining attitudes and behaviour towards same-sex attracted individuals indicates that this intergroup anxiety is particularly evident when the anticipated interaction involves members of the same gender. The current studies investigate the effect of timing of disclosure of a person’s same-sex attractions in an effort to identify a means of reducing this anxiety. Study 1 uses a hypothetical scenario to gain insight into participants’ stated preferences for early or delayed knowledge of a person’s sexual orientation. Results reveal an association between experiencing close contact with gay individuals of the same gender in real life (but not opposite gender), and a preference for early disclosure. Results from an experimental study concur with these findings. After a face-to-face interaction task with a confederate of the same gender, participants sit further from the confederate for the late disclosure condition when compared with the early disclosure and no disclosure control. Future studies investigating the interaction between timing of disclosure of same-sex attractions and the intimacy of disclosure (casual vs. intimate), are discussed.