A. Shaw, "Reasoning about time in high-level language software," IEEE Transactions on Software Engineering, vol. 17, no. 7, pp. 875--889, 1989. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Java Virtual-Machine Support for Portable Worst-Case.. - Bate, Bernat, Puschner (2002) (1 citation) (Correct)
....the platformindependent and software independent analyses are integrated. Section 6 presents the results of the evaluation. The conclusions are presented in section 7. 1. 1 Worst case execution time analysis There exists a well founded ground of research on platform dependent WCET, for example [5]. Several approaches exist to determine the WCET of a section of object code. The basic and common approach is to build the graph of basic blocks (BB) from the source code and the generated object code. The timing of each BB is determined, for instance, by adding up the WCET of each of the ....
....for instance, by adding up the WCET of each of the machine instructions within the BB. Loops are identified and annotated with the maximum number of iterations. The timing information of each basic block can be then combined to determine the WCET of a whole program by using a timing schema [5] which is a set of rules to collapse the control flow graph annotated with timing information. Let WCET (S) denote the WCET of a code segment S, and assume that we have initially the WCET of all basic blocks. From this, the WCET of a whole section of code can be determined by collapsing the graph ....
A. Shaw, "Reasoning about time in high-level language software," IEEE Transactions on Software Engineering, vol. 17, no. 7, pp. 875--889, 1989.
Motivation - Computer Program (Correct)
....hardware builders[4] concede that the exact execution time of a given instruction may vary, depending upon the surrounding instructions and the current state of the machine. Park and Shaw [6] implemented a timing tool for a subset of C, which is based on the notion of timing schema presented in [8]. Although their method has the advantage of being partly machine independent, the effects of optimizations performed by the compiler make it difficult to predict the exact code emitted by the compiler from their source level schemata. Shaw acknowledges that although his approach seems to work ....
Shaw, A., "Reasoning About Time in High-Level Language Software" Research Report, Laboratoire MASI, University of Paris 6, April 1987.
A Retargetable Technique for Predicting Execution Time of .. - Harmon, Baker, Whalley (1992) (79 citations) (Correct)
....language instructions generated from the compilation of C programs. They used a graph method to find the worst case path and computed the execution time by simulating the hardware. Park and Shaw [19] implemented a timing tool for a subset of C, based on the notion of timing schema presented in [21]. A method very similar to that of Shaw is presented by Puschner and Koza [20] These approaches are similar in that they all assume that the execution time of each machine instruction is constant and that the behavior of the underlying hardware is both deterministic and known. Shaw acknowledges ....
Shaw, A. C. 1987. Reasoning About Time in High-Level Language Software. Research Report, Laboratoire MASI. University of Paris 6.
A Retargetable Technique for Predicting Execution Time - Harmon, Baker, Whalley (1992) (79 citations) (Correct)
No context found.
A. C. Shaw, "Reasoning About Time in High-Level Language Software", Research Report, Laboratoire MASI, University of Paris 6, April 1987.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC