A. Dearle, R. C. H. Connor, and Q. I. Cutts. Using persistence to support incremental system construction. Microprocessors and Microsystems, 17(3):161--72, 1993. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Designing Configuration Management Tools for Dynamically Composed .. - Schmerl (1998) (Correct)
....so the possibility of introducing Trojan horses [TP96] is increased. Napier and dbPascal depend on the type model to provide security. In Napier, added security can be achieved by sealing an application (i.e. encapsulating all bindings in the closure of a program to prevent unrestricted access) [Dearle93]. This does not work for the explicit points of dynamic composition, whereupon security is based on the type. In Java, security is more stringent. The default ClassLoader accesses a security manager which can be used to verify that a site from which classes are loaded is a trusted site. When ....
A. Dearle, R. C. H. Connor, and Q. I. Cutts. Using persistence to support incremental system construction. Microprocessors and Microsystems, 17(3):161--72, 1993.
Orthogonal Persistence and Ada - Crawley, Oudshoorn (1994) (4 citations) (Correct)
.... persistence to Ada tends to make it less reliable (e.g. by reducing encapsulation and type safety) and less maintainable (e.g. because persistent data access is visible to the application) Assuming that code objects can persist, a persistent Ada environment can support incremental binding [18] and linguistic reflection using callable compilers [16,44] Incremental binding allows the programmer to build flexible, integrated tools from shared libraries of persistent software and data components; e.g. 19] The incremental binding model is well suited to prototyping [15] and to building ....
A. Dearle, Q.I. Cutts and R.C.H. Connor, "Using Persistence to support Incremental System Construction", Microprocessors and Microsystems Vol 17 No 3, 1993.
The Addition of Persistence to Ada95 and its Consequences - Oudshoorn, Crawley (Correct)
....future. However, this is not a good argument for not supporting persistence as an Ada95 Annex. A real time programmer should use a compiler that can turn off all support for persistence. Assuming that code objects can persist, a persistent Ada environment can support incremental binding[14] and linguistic reflection using callable compilers[11, 33] Incremental binding allows the programmer to build flexible, integrated tools from shared libraries of persistent software and data components; e.g. 15] The incremental binding model is well suited to prototyping[8] and to building ....
A. Dearle, Q.I. Cutts, and R.C.H. Connor. Using persistence to support incremental system construction. Microprocessors and Microsystems, 17, 1993.
Software Constraint Models - A Means to Improve Maintainability.. - Sjøberg (Correct)
....in any persistent environment; it typically invokes an interactive menu or any persistent procedure. Type program its contents are exclusively type definitions. Several constraints help ensure adherence to an incremental construction methodology based on updatable persistent locations [14]. Using the methodology, insert programs create stub locations in environments, one for each component of the application. For each component, an update program finds bindings to locations of components required by the component under construction. The update program creates the new component with ....
Dearle, A., Cutts, Q. and Connor, R. "Using Persistence to Support Incremental System Construction". Microprocessors and Microsystems, Vol. 17, No. 3, pp. 161-171, April 1993.
Changing Persistent Applications - Farkas, Dearle Self-citation (Dearle) (Correct)
....the arcs are bindings between them. In a persistent programming language which supports first class procedures 1 , such as Napier88 [10] the objects in the store include procedures with bindings to data, and data with bindings to procedures. Persistent systems support incremental construction [4] and component reuse [9] by allowing components to be created, stored in the persistent object store and bindings between them established. Bindings may be established at different times: during program construction, at program compile time and when the program is executing [7] 1 Throughout this ....
....are stored separately. Consequently, the reusability of executable code is considerably extended: the same executable code may be used with a different environment vector to operate on different values with different types. One method of constructing general purpose code is to use generators [4]. This technique involves parameterising a procedure with all relevant intermediate free variables. For example, the update procedure needs to be bound to a database, so a generator may be constructed which takes a database as a parameter and returns an update procedure bound to that database as ....
Dearle, A., Cutts, Q. and Connor, R. "Using Persistence to Support Incremental System Construction", Microprocessors and Microsystems, vol 17, 3, pp. 161-171, 1993.
Analysing Persistent Language Applications - Sjøberg, Cutts, Welland, Atkinson (1994) Self-citation (Cutts) (Correct)
....in any persistent environment; it typically invokes an interactive menu or any persistent procedure. Type program its contents are exclusively type definitions. Several constraints help ensure adherence to an incremental construction methodology based on updatable persistent locations [23]. Using the methodology, insert programs create stub locations in environments, one for each component of the application. For each component, an update program finds bindings to locations of components required by the component under construction. The update program creates the new component with ....
Dearle A, Cutts Q, Connor R. Using Persistence to Support Incremental System Construction. Microprocessors and Microsystems 1993; 17(3):161--171
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