E. Kligerman and A. Stoyenko. Real-time Euclid: A language for reliable real-time systems. IEEE Trans. on Software Eng., 12(9):941--949, September 1986.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....Most real time languages, e.g. Ada and C with POSIX, do not allow temporal properties such as periods and deadlines to be explicitly de ned. Rather, the intended behaviour is achieved using timeouts and delays. An example of a language that includes such constructs is Real Time Euclid [KS86] where activities can be de ned to restart with a certain periodicity, or in response to certain events. In Real Time Java, activities can be assigned scheduling parameters such as deadline and execution time. Through subclassing, more speci c task models can be used to de ne for example ....

E. Kligerman and A. Stoyenko. Real-time Euclid: A language for reliable real-time systems. IEEE Trans. on Software Eng., 12(9):941{ 949, September 1986.

....helps achieve real time correctness and schedulability for the entire system. For this reason we call the transformation real time task slicing. The Language of Time Constrained Events. TCEL s annotation syntax is quite similar to that found in other experimental real time languages (e.g. [17, 19, 21, 24, 27, 38]) However, the semantics differs significantly, in that it is based on the time constrained relationships between observable events. For example, consider a construct such as every 10ms do B, where the block of code B is executed once every 10ms. The typical approach is to establish timing ....

E. Kligerman and A. Stoyenko. Real-Time Euclid: A language for reliable real-time systems. IEEE Trasactios o Software Egieerig, 12:941 949, September 1986.

....imposed on programs admitted for real time scheduling, the (real time) runtime system that controls the execution, and the hardware platforms that are used. We first discuss programming language aspects and then consider different approaches to deal with modern processors. Kligerman and Stoyenko [15], as well as Puschner and Koza [28] provide a detailed description of the constraints that must be obeyed by the real time tasks. The requirements include bounds on all loops, bounded depth of recursive procedure calls, and the absence of dynamic structures. To enforce these restrictions they ....

E. Kligerman and A. Stoyenko. Real-time Euclid: A language for reliable real-time systems. IEEE Trans. on Software Eng., 12(9):941--949, September 1986.

....into two groups: application development languages, and specification languages (or formalisms) that are used to describe timing constraints at the application level, or even at the system level. Examples of application programming languages are Tomal [KH76] Pearl [Mar78] Real Time Euclid [KS86], RTC [ITM92] RealTime Concurrent C [GR91] Dicon [LG85] Chaos [BG92] Flex [LN88] TCEL [GH93] Ada95 [ANS95] MPL [NTA90] and CaRT Spec [WSM95] These languages include a wide variety of features that allow the compiler (and possibly the run time system) to check assertions or even to ....

....if the language includes features that can be related to dynamic mechanisms (such as those described in [FJR94] HSNL97] RSYJ97] SH94] for monitoring, diagnosis and recovery. Language support for run time monitoring of real time programs has been addressed in [GKS95] KL91] Real Time Euclid [KS86], and Ada95 [ANS95] However, this prior work provides limited support for diagnosis and recovery actions. We extend the language features pertaining to diagnosis of timing problems, and to the 41 migration or replication of application program components to handle higher data stream or event ....

E. Kligerman and A. D. Stoyenko, "Real-Time Euclid: A Language for Reliable RealTime Systems," IEEE Transactions on Software Engineering, 12(9):941--949, September 1986.

....known then any particular scheduling scheme chosen for use can be parameterised and predictions of the overall temporal behaviour of the system can be established. The process of acquiring estimates of WCET is known as timing analysis. Since the first papers on timing analysis appeared in 1986 [6] there has been an impressive procession of techniques and algorithms (a review of this material has recently been produced, 11] By contrast the industrial take up of timing analysis has been comparatively poor. Industrial practice is still focused on measurement, with its inherent drawback of ....

E. Kligerman and A. Stoyenko. Real-Time Euclid: A language for reliable real-time systems. IEEE Transactions on Software Engineering, SE-12(9):941--949, 1986.

....1 Introduction In the past years worst case execution time (WCET) analysis has become an acknowledged part in the theory of real time systems construction. Researchers working on WCET analysis introduced extensions of high level programming languages to describe possible execution paths [Kligerman, Stoyenko 1986, Puschner, Koza 1989, Park 1993] constructed tools for machine level WCET analysis [Mok, Amerasinghe et al. 1989, Park, Shaw 1990, Harmon, Baker, Whalley 1992, Zhang, Burns, Nicholson 1993, Li, Malik, Wolfe 1995] and they built compiler prototypes to translate high level source programs ....

E. Kligerman and A. Stoyenko. Real-Time Euclid: A Language for Reliable Real-Time Systems. IEEE Transactions on Software Engineering, SE12 (9):941--949, Sep. 1986.

....3: State of the art 29 3.9. Real Time Euclid. 3.9.1. General. Alexander Stoyenko, then at the University of Toronto, was one of the driving forces behind Real Time Euclid, which is a language specially addressed to reliability and schedulability in real time systems. The language is described in [Stoyen86] and the schedulability analysis in [Stoyen91] 3.9.2. Languages supported. Real Time Euclid, which is a language specifially developed for hard real time systems. 3.9.3. Description of the approach. The real time model, used in systems developed in Real Time Euclid, has three components: the ....

A. Stoyenko and E. Kligerman, "Real-Time Euclid: A Language for Reliable Real-Time Systems", IEEE Transactions on Software Engineering, Vol. SE12, Sept. 1986, pp 940 - 949.

....systems are embedded systems with limited storage space, the result of a recursive procedure must be computed using a limited amount of stack space. In view of these problems most designers of realtime programming languages decide to forbid recursion in their languages, e.g. RT Euclid (cf. [6, 5]) Supported by the Austrian Science Foundation (FWF) under grant P10188 MAT. PEARL (cf. 3] Real Time Concurrent C (cf. 4] and the MARS approach (cf. 7, 11] Our approach is different in that we do not forbid recursion, but instead constrain recursive procedures such that their space and ....

E. Kligerman and A. D. Stoyenko. Real-time Euclid: A language for reliable real-time systems. IEEE Transactions on Software Engineering, 12(9):941--949, 1986.

....met. Similarly, TOMAL [14] timing constraints are implemented by specifying task response times which are validated by the compiler. This is done by a control flow analysis of the program which detects which combinations of task states could occur during execution. The Real Time Euclid language [15] also guarantees that its programs can be analysed for schedulability scheduling is implemented by associating each process with a time frame. A similar approach is taken by High Integrity Pearl [16] Other systems have a philosophy of run time enforcement of constraints, rather than a ....

E. Kligerman and A. D. Stoyenko. Realtime Euclid: A language for reliable realtime systems. IEEE Transactions on Software Engineering, SE-12(9):941--949, September 1986.

....by allowing trace values to be constrained only at times between 0 and . Ideally we want a target programming language which allows timing constraints on code fragments to be expressed directly. Although a handful of programming languages with first class timing constructs have been proposed [25, 11, 10, 5], none has become widely established. Therefore, for the purposes of this paper, we target Dijkstra s guarded command language augmented with timing annotations. The definition of each executable code construct is given in Figure 1 and discussed further in this section. Note that x 2 v is a ....

E. Kligerman and A.D. Stoyenko. Real-time Euclid: A language for reliable real-time systems. IEEE Transactions on Software Engineering, SE-12(9):941--949, September 1986.

....assignment and scheduling policies. Other frameworks and tools with similar goals have been proposed in the open research literature. The schedalyzer (schedulability analyzer) by Stoyenko [50] was one of the first tools for schedulability analysis. A special real time language, Real Time Euclid [34], was developed with provisions for schedulability analysis built into it. The main limitation with the schedalyzer is that it is targeted for a specific high level language, a specific run time system, and a specific platform architecture. Scheduler 1 2 3 [53] is a schedulability analyzer for ....

E. Kligerman and A. D. Stoyenko. Real-Time Euclid: A language for reliable real-time systems. IEEE Trans. on Software Engineering, 12(9):941--949, September 1986.

....statement for expressing lower absolute timing bounds, the before coercion gives us a programming language in which blocks of code can be bracketed by precise timing constraints. Although numerous experimental programming languages with first class timing annotations have been proposed previously [32, 6, 17, 18, 31, 7, 5] none has become widely accepted. The simple addition of the before directive to an existing language has a greater chance of industrial uptake than an entirely new language. More importantly, the before directive can be generated as a product of stepwise program refinement [10] thus supporting ....

E. Kligerman and A. D. Stoyenko. Real-time Euclid: A language for reliable realtime systems. IEEE Transactions on Software Engineering, SE-12(9):941--949, September 1986.

....the bounds for every loop in the program must be speci ed, which is error prone and tedious for the user. Alternatively, one could specify this information as assertions in the source code to prevent repeated speci cations of the same information (Burns et al. 1996; Puschner and Koza, 1989; Kligerman and Stoyenko, 1986). However, there are still several disadvantages. First, the user is still required to write the assertions. Second, there is no guarantee that the user will specify the correct minimum and maximum number of iterations. This problem may easily occur when a user changes the loop, but forgets to ....

Kligerman, E. and A. Stoyenko: 1986, `Real-Time Euclid: A Language for Reliable Real-Time Systems'. IEEE Transactions on Software Engineering 12(9), 941{ 949.

....etc. with or without the real time features) are being used for software development of real time systems. PEARL is well structured, has strong typing, allows direct hardware access, and has constructs for time and or event related process activation, suspension, and termination. Real time Euclid[KS86] besides providing real time constructs, also allows for schedulability analysis. 3L s Parallel C has parallel processing support added to C programming language. The popularity of real time extended programming languages seems to stem 25 from their easily available development environments for ....

E. Kligerman, A. Stoyenko, "Real-Time Euclid: A language for reliable real-time system.", IEEE Transactions on Software Engineering", September 1986.

....be divided into two groups: application development languages, and specification languages (or formalisms) that are used to describe time constraints at the application level, or even the system level. Examples of application programming languages are Tomal [KH76] Pearl [Mar78] Real Time Euclid [KS86], RTC [ITM92] Real Time Concurrent C [GR91] Dicon [LG85] Chaos [BG92] Flex [LN88] TCEL [GH93] Ada95 [ANS95] MPL [NTA90] and CaRT Spec [WSM95] These languages include a wide variety of features that allow the compiler (and possibly run time system) to check assertions or even to transform ....

....includes features that can be related to dynamic mechanisms (such as those described in [FJR94] HSNL97] RLLS97] RSYJ97] SH94] for monitoring, diagnosis and recovery. Language support for run time monitoring of real time programs has been addressed in [JRR94] GKS95] KL91] Real Time Euclid [KS86], and Ada95 [ANS95] However, limited support was provided for diagnosis and recovery actions. Our work extends the language features pertaining to diagnosis of timing problems, and the migration or replication of software components to handle higher data stream or event stream loads ....

E. Kligerman and A. D. Stoyenko, Real-Time Euclid: A language for reliable real-time systems, IEEE Transactions on Software Engineering, 12(9):941--949, September 1986.

.... of an algorithm, one of which is selected at run time according to execution time and other scheduling constraints [4, 8] Klingerman and Stoyenko use a model where processes contend for access to shared resources, and so take worst case blocking time into account in the execution time [5]. In more recent work, Stoyenko and Marlowe use a graph representation to analyze program behavior, and control transformations [19] However, their method assumes a system using a process based run time representation, and so has significant differences from the work described here. Nirkhe ....

E. Kligerman and A. D. Stoyenko. Real-Time Euclid: A Language for Reliable Real-Time Systems. IEEE Transactions on Software Engineering, September 1986.

....readily support the object oriented concepts. Object Oriented Real time Languages Ideally, a real time object oriented language must provide sufficient real time specifications as one may expect from a real time language, while integrating these specifications within the object oriented tapestry [5,6,11,13]. The significant aspects in objectoriented real time modeling can be identified as: 1. The use of inheritance and redefinition of real time constraints through the inheritance hierarchy and extension of the inheritance of the state and behavior of a class to include the definition of temporal ....

Kligerman, E., and Stoyenko, A., (1986) "Real-time Euclid: A Language for Reliable Real-time Systems", IEEE Trans. on Software Engineering, Vol. SE-12, No. 9, Sept.

....RT Euclid is also a notable language. We will confine our comparison to these latter two languages and a couple of recent proposals that were not considered in the mentioned surveys. In the next couple of subsections we briefly describe the features with regard to timing of Ada [1, 4] RT Euclid [16], and the object oriented languages DROL [23] RTC [15] FLEX [20] and Sina (with real time extensions) 3, 5] After that we discuss the major differences with our approach. 14 COMPARISON WITH OTHER APPROACHES 38 14.1 ADA The Ada language [4] was developed to supply the US Department of ....

....and reduce the number of execution platforms that can be used. It is interesting to note that timing parameters (as regular parameters of procedures) are used in the Ada program and the previously mentioned event abstraction is employed to a certain extent. 14.2 Real Time Euclid Real time Euclid [16] is a language derived from Pascal. It supports modularity and concurrency, but it does not support distribution. The authors address through their work on RT Euclid issues on real time and reliability and they do this in a very straightforward and coherent manner. The language is intended for the ....

E. Kligerman and A.D. Stoyenko, "Real-Time Euclid: A Language for Reliable Real-Time Systems", IEEE Transactions on Software Engineering, Vol. SE-12, No. 9, 1986

....the bounds for every loop in the program must be specified, which is error prone and tedious for the user. Alternatively, one could specify this information as assertions in the source code to prevent repeated specifications of the same information (Burns et al. 1996; Puschner and Koza, 1989; Kligerman and Stoyenko, 1986). However, there are still several disadvantages. First, the user is still required to write the assertions. Second, there is no guarantee that the user will specify the correct minimum and maximum number of iterations. This problem may easily occur when a user changes the loop, but forgets to ....

Kligerman, E. and A. Stoyenko: 1986, `Real-Time Euclid: A Language for Reliable Real-Time Systems'. IEEE Transactions on Software Engineering 12(9), 941-- 949.

No context found.

E. Kligerman and A. Stoyenko. Real-time Euclid: A language for reliable real-time systems. IEEE Trans. on Software Eng., 12(9):941--949, September 1986.

No context found.

Kligerman, E., Stoyenko, A.: Real-time Euclid: a language for reliable real-time systems. IEEE Trans. Software Engineering 12 (1986) 941--949

No context found.

E. Kligerman and A. Stoyenko, "Real-Time Euclid: A Language for Reliable Real-Time Systems," IEEE Transactions on Software Engineering 12(9) pp. 941-949 (September 1986).

No context found.

E. Kligerman and A. Stoyenko. Real-time euclid: A language for reliable real-time systems. IEEE Transactions on Software Engineering,SE- 12(9):941--949, Sep. 1986.

No context found.

KLIGERMAN,E.AND STOYENKO, A. D. 1986. Real-time Euclid: A language for reliable realtime systems. IEEE Trans. Softw. Eng. 12, 9, 941--949.

No context found.

E. Kligerman and A. Stoyenko. Real-Time Euclid: A Language for Reliable Real-Time Systems. IEEE Transactions on Software Engineering, SE-12(9):941 --- 949, September 1986.

First 50 documents  Next 50

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