S. Crawley and M. Oudshoorn, "Orthogonal persistence and ada," in TRI-Ada, 1994, pp. 298-- 308.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....moment is PJava [8] a project that aims at providing orthogonal persistence to the Java [9] programming language. As orthogonal persistence is extremely difficult to achieve, all these implementations had to slightly modify the programming language and or modify the run time system. The papers [10, 11] for instance investigate adding orthogonal persistence to the Ada 95 [12] language. The authors identify the following problems: Orthogonal persistence requires that both data and types can have indefinite lifetimes. If a persistent application is to evolve, structural equivalence and dynamic ....

Crawley, S.; Oudshoorn, M.: "Orthogonal Persistence and Ada". In Proceedings of TRI-Ada'94, Baltimore, Maryland, USA, November 1994, pp. 298 -- 308, ACM Press, 1994.

....in Ada 95 Ada 95 [6] the recent revision of the Ada standard, does not have elaborate features for backward error recovery or data persistence. This is why many attempts have been made to extend the language, for example, a recovery block scheme in [7] and two approaches for persistent Ada [8, 9]. We believe that extending the language is for many reasons not practical; in this paper we rely on standard Ada 95 only. Among many other new features, Ada 95 introduces a new concept called streams. A stream is a sequence of elements comprising values from possibly different types. The values ....

Crawley, S.; Oudshoorn, M.: "Orthogonal Persistence and Ada". In Proceedings of TRI-Ada'94, Baltimore, Maryland, USA, November 1994, pp. 298 -- 308, ACM Press, 1994.

....key values in a persistent data structure. If another execution of the program is going to be able to use the key values successfully, the contents of tab must be made persistent. The talk discussed the various optins and their ramificatons with respect to package state. The reader is refered to [2] for the full version of this paper. 4 Funding and Collaboration This work is unfunded and is the collaborative work of the University of Adelaide and DSTO. ....

S. Crawley and M.J. Oudshoorn, "Orthogonal Persistence and Ada", Proceedings of ACM TRI-Ada'94 Conference, Baltimore, Maryland, November, 1994, pp 298-308.

....Ada95b to distinguish them from standard Ada83 and Ada95. The term persistent Ada95 is used when referring to the two variants collectively. In this paper, we concentrate mainly on language design issues. For more detailed discussions of the implementation issues, the reader should refer to [7, 8]. Note that we do not consider interactions between persistence and the Ada95 specialist annexes. In the case of the real time annex, the conflicting requirements of real time and persistent programming make it difficult to support both paradigms simultaneously, at least with current ....

....a natural extension of compatibility within an execution. The Ada type system uses name equivalence rather than structural equivalence. Furthermore, the language uses the lifetime of a type as a basis for managing dynamically allocated space. This causes difficulties for persistence in Ada. In [7], we demonstrated that the standard Ada type equivalence and lifetime rules cannot be used for persistent data. We identified four main options for type equivalence of open (not private) data types in persistent Ada95: Use structural equivalence when binding to persistent data, and name ....

S.C. Crawley and M.J. Oudshoorn. Orthogonal persistence and Ada. In Proceedings TRI-Ada'94, Baltimore MD, pages 298--308. ACM, November 1994.

....between stores are specific issues addressed by this project. 3.2 Programming Language Issues Two projects are currently underway to examine programming language level issues with regard to persistence and concurrency. The first of these projects examines the addition of persistence to Ada95 [CO94, CO95, OC96a, OC96b]. This project has taken a language with well documented design goals and attempted to retrospectively add support for persistence. Two techniques have been identified provide support by modifying the core language, or provide support through the introduction of a persistence annex. The ....

S.C. Crawley anf M.J. Oudshoorn, "Orthogonal Persistence and Ada", Proceedings of ACM TRI-Ada'94 Conference, Baltimore, Maryland, November 1994, pp 220-225.

....is not considered. In some cases, such as the use of real time and persistence annexes, the mixture of the provided features is incompatible and undesirable. This paper concerns itself mainly with language design issues. A more detailed discussion of the implementation issues can be found in [9, 10]. 2 Persistence Persistence is a general term for mechanisms that save values from a program s execution space so that they can be used in a later execution; i.e. by making the values persist from one execution to the next. In its broadest sense, the term covers conventional and object oriented ....

S.C. Crawley and M.J. Oudshoorn. Orthogonal persistence and Ada. In Proceedings TRI-Ada'94, Baltimore MD, pages 298--308. ACM, November 1994.

No context found.

S. Crawley and M. Oudshoorn, "Orthogonal persistence and ada," in TRI-Ada, 1994, pp. 298-- 308.

No context found.

Cra94A Crawley, S. C. & Oudshoorn, M. J.: Orthogonal Persistence and Ada, in proceedings of TRI-Ada '94 pp 298-308, Baltimore MD, ACM, 1994.

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