Blaine, Lee and Goldberg, Allen, DTRE -- A Semi-Automatic Transformation System, in Constructing Programs from Specifications, B. Moller (ed.), North Holland, 1991.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....process in simple generators may be confluent: different orders of transformation application can produce different intermediate results but further transformation will reduce them all into the same normal form. More ambitious generators, translating more abstract specifications (e.g. [12][44] usually have to choose among many tens or hundreds of transformations at every step. In other words, generators of the first kind act more like conventional compilers, while generators of the second kind apply more intelligence in the transformation process, using heuristic knowledge to make ....

....Transformations can usually be classified as refinements or optimizations. A refinement adds implementation detail to an abstract specification. For instance, an abstract data type, like a set, may be refined to be implemented using a specific data structure, like a binary tree (e.g. [12]) Refinements can occur at many levels and may fundamentally affect program structure and performance. Optimization transformations attempt to improve the performance of the produced program by transforming it into a more efficient program, at the same conceptual level of abstraction. Generators ....

L. Blaine and A. Goldberg, DTRE---a semi-automatic transformation system, in B. Moller (ed.), Constructing Programs from Specifications: 165-204, North-Holland, 1991.

....is software development and maintenance environment supporting the specification, design, and semi automated synthesis of correct by construction software. It represents the confluence of capabilities and lessons learned from Kestrel s earlier prototype systems (KIDS [13] REACTO [18] and DTRE [2]) grounded on a strong mathematical foundation (category theory) The current version of Specware TM is a robust implementation of this foundation. Specware TM supports automation of: Component based specification of programs using a graphical interface . Incremental refinement of ....

Blaine, Lee and Goldberg, Allen, DTRE -- A SemiAutomatic Transformation System, in Constructing Programs from Specifications, ed. B. Moller, North Holland, 1991.

....the abstract data types with concrete ones. The abstraction implementation model of reformulation allows complex transformations to be broken into simpler components. For example, a small representation library could contain the transformations in figure 2 2. 2.4. 6 DTRE The DTRE system of [Blaine Goldberg 91] is intended as a module of the KIDS system [Smith 90] It performs data type refinement in programs and can generate code in a variety of programming languages. A parameterised theory is an ADT coupled with a theory for that ADT. An interpretation from theory T 1 to theory T 2 is a translation ....

....this thesis. Most of the examples were used during development. A few examples, marked by an asterisk, were used for testing, i.e. they were not tried until the Pitches implementation was in its final state. Types are sometimes omitted for brevity. A comprehensive comparison with systems such as [Blaine Goldberg 91] is difficult, because they concentrate on a different problem, i.e. on large scale, user assisted, software development in which it is the responsibility of the user to ensure that an adequate theory exists which provides efficient implementations of functions. More detailed comparison is ....

[Article contains additional citation context not shown here]

L. Blaine and A. Goldberg. DTRE --- A semiautomatic transformation system. In B. Moller, editor, Constructing programs from specifications. North Holland, 1991.

....by adding more primitive operations (as are found in Chapter 1 of Tarjan s book[Tar87] into SETM. Dynamic bases and runtime data structure reorganization are also being investigated. Finally, it would be useful to formally verify our data structure selection method using a system such as DTRE[BG91] Acknowledgments We would like to thank Ulrich Gutenbeil for translating the SETM code of Appendix D into Ada using the Doberkat Gutenbeil SETL to Ada translator and for providing us with the Ada sources of their run time system. This facilitated the empirical comparisons of Section 8. ....

L. Blaine and A. Goldberg. Dtre - a semi-automatic transformation system. In B. Moeller, editor, Constructing Programs from Specifications. NorthHolland, 1991.

....with the exception of simplification (which is arbitrarily hard) take only a few seconds. 8 5. Apply data type refinements The user can select implementations for the high level data types in the program. Data type refinement rules carry out the details of constructing the implementation [5]. 6. Compile The resulting code is compiled to executable form. In a sense, KIDS can be regarded as a front end to a conventional compiler. Actually, the user is free to apply any subset of the KIDS operations in any order the above sequence is typical of our experiments in algorithm ....

....from smaller theories [3, 7, 30] A theory morphism translates the language of one theory into the language of another theory in a way that preserves theorems. Theory morphisms underlie several aspects of software development, including specification refinement and datatype implementation [5, 27, 30, 51], the binding of parameters in parameterized theories [9, 15] algorithm design [22, 43, 52] and data structure design [32] There has been work on techniques for composing implementations in a way that reflects the structure of the source specification [3, 30] however these composition ....

[Article contains additional citation context not shown here]

Blaine, L., and Goldberg, A. DTRE -- a semi-automatic transformation system. In Constructing Programs from Specifications, B. Moller, Ed. North-Holland, Amsterdam, 1991, pp. 165--204.

....automate the development of software for large families of applications. Generators automatically transform compact, high level specifications of target systems into actual source code, and rely on libraries of parameterized, plug compatible, and reusable components for code synthesis. Generators [Bla91, Bat92a, Bax92, Gom94, Lei94, Nin94] are among many approaches that are being explored to construct customized software systems quickly and inexpensively from reuse libraries. CORBA and its variants simplify the task of building distributed applications from components [Ude94] CORBA can simplify the manual integration of ....

L. Blaine and A. Goldberg, "DTRE - A Semi-Automatic Transformation System", in Constructing Programs from Specifications, Elsevier Science Publishers, 1991.

....outlined in this paper. The implementation is not yet, however, mature enough to allow substantial problems to be tackled. 11 A comparison with previous work Choosing a data representation to improve certain program operations in used in [Schonberg et al. 81] Both [Schonberg et al. 81] and [Blaine Goldberg 91] extend an initial choice of representation to as much of the program as possible using dataflow analysis, which performs a similar role in programs to that performed by propagation rules in synthesis proofs. In both these systems, once a new data type is chosen, operations in the program are ....

....The difference matching proof strategy currently requires that the same type change is made on the inputs and the output of a function, and the lifting of this constraint should be investigated. The techniques I have developed could be integrated with the more algebraic techniques of [Lowry 89, Blaine Goldberg 91, Sannella Tarlecki 88] and the relationship between dataflow analysis and propagation rules should be investigated. I assume that the transformations I carry out result in more efficient programs. Complexity rules attached to proof rules such as that in [Sands 89] could be used to ensure the ....

L. Blaine and A. Goldberg. DTRE --- a semiautomatic transformation system. In B. Moller, editor, Constructing programs from specifications. North Holland, 1991.

....the introduction of a carry bit. The proof is more difficult and has not yet been automated. Automating Data Type Changes 19 10 A comparison with previous work Choosing a data representation to improve certain program operations in used in [Schonberg et al. 81] Both [Schonberg et al. 81] and [Blaine Goldberg 91] extend an initial choice of representation to as much of the program as possible using dataflow analysis, which performs a similar role in programs to that performed by propagation rules in synthesis proofs. In both these systems, once a new data type is chosen, operations in the program are ....

....The difference matching proof strategy currently requires that the same type change is made on the inputs and the output of a function, and the lifting of this constraint should be investigated. The techniques I have developed could be integrated with the more algebraic techniques of [Lowry 89, Blaine Goldberg 91, Sannella Tarlecki 88] and the relationship between dataflow analysis and propagation rules should be investigated. I assume that the transformations I carry out result in more efficient programs. Complexity rules attached to proof rules such as that in [Sands 89] could be used to ensure the ....

L. Blaine and A. Goldberg. DTRE --- a semiautomatic transformation system. In B. Moller, editor, Constructing programs from specifications. North Holland, 1991. Automating Data Type Changes 21

....idea is to exploit not only the structure of the theory within which the constraints are stated, but the local theory of the particular problem being solved. The local structure supports the inference of specialized pruning and constraint propagation code. The use of a datatype refinement system [1] also allows specialized representations of objects, constraints, and efficient implementation of their operations. The result can be much more efficient code than is possible using general purpose representations, solvers, and inference procedures. ....

Blaine, L., and Goldberg, A. DTRE -- a semi-automatic transformation system. In Constructing Programs from Specifications, B. Moller, Ed. North-Holland, Amsterdam, 1991, pp. 165--204.

....would require libraries to be of exponential size. That is, if all features are orthogonal, there would be O(2 k ) unique views. A growing community of researchers believes that domain specific software generators hold the greatest potential for producing view specific software economically [Bla91, Bat92b, Bax92, Gom94, Gra92, Gri94, Lei94, Nin94]. Two practical approaches are currently used in generators to produce view specific software. First, there is considerable evidence that there are many domains for which one can define objects with full interfaces, i.e. interfaces that support a comprehensive set of domain specific operations. ....

L. Blaine and A. Goldberg, "DTRE - A Semi-Automatic Transformation System", in Constructing Programs from Specifications, Elsevier Science Publishers, 1991.

....domain as a parameterized domain theory. 2. representation of programming knowledge we also use theories to capture knowledge of algorithms and data structures. The logical concept of interpretation between theories is the basis for applying programming knowledge in the form of theories [3, 12, 10]. 1 This research was supported in part by the Office of Naval Research under Grant N0001490 J 1733 and in part by Air Force Office of Scientific Research under Contract F49620 91C 0073. Most, if not all, sorting algorithms can be derived as interpretations of the divide and conquer ....

....selects an optimization method from a menu and applies it by pointing at a program expression. 5. Apply data type refinements The user can select implementations for the high level data types in the program. Data type refinement rules carry out the details of constructing the implementation [3]. 6. Compile The resulting code is compiled to executable form. In a sense, KIDS can be regarded as a front end to a conventonal compiler. Actually, the user is free to apply any subset of the KIDS operations in any order the above sequence is typical of our experiments in algorithm design. ....

Blaine, L., and Goldberg, A. DTRE -- a semi-automatic transformation system. In Constructing Programs from Specifications, B. Moller, Ed. North-Holland, Amsterdam, 1991, pp. 165--204.

....from axiomatic specifications via stepwise refinement. The immediate motivation for the the development of Specware is the desire to integrate on a common conceptual basis the capabilities of several earlier systems developed at Kestrel Institute [Jullig 93] including Kids [Smith 90] and Dtre [Blaine and Goldberg 91] 1.1 Reasoning about the Structure of Specifications, Refinements, and Code The most important new aspect of the framework developed is the ability to represent explicitly the structure of specifications, refinements, and program modules. We believe that the explicit representation and ....

....to the development of Specware came from the desire to integrate several systems developed at Kestrel Institute over the last ten years, and the realization that they shared a common conceptual basis. These include the algorithm design system Kids [Smith 90] the data type refinement system Dtre [Blaine and Goldberg 91] Reacto, a system for the development of reactive systems [Gilham et al. 89] and a synthesis system for visual presentations [Green 87] An overview is presented in [Jullig 93] 7 Conclusions 7.1 Summary We presented the specification and refinement concepts of Specware, a system aimed at ....

Blaine, L., and Goldberg, A. DTRE -- a semi-automatic transformation system. In Constructing Programs from Specifications, B. Moller, Ed. North-Holland, Amsterdam, 1991, pp. 165--204.

....through the use of software system generators. Such generators will automatically transform compact, high level specifications of target systems into actual source code, and will rely on libraries of parameterized, plug compatible, and reusable components for code synthesis. Generators [Bat92, Bax92, Bla91, Gom94, Gra92, Lei94, Nin94] are among a number of approaches that are now being explored to construct customized software systems quickly and inexpensively from reuse libraries. CORBA and its variants simplify the task of building distributed applications from components [Ude94] CORBA can integrate components that are ....

L. Blaine and A. Goldberg, "DTRE - A Semi-Automatic Transformation System", in Constructing Programs from Specifications, Elsevier Science Publishers, 1991.

....automate the development of software for large families of applications. Generators automatically transform compact, highlevel specifications of target systems into actual source code, and rely on libraries of parameterized, plug compatible, and reusable components for code synthesis. Generators [Bla91, Bat92a, Bax92, Gom94, Lei94, Nin94] are among many approaches that are being explored to construct customized software systems quickly and inexpensively from reuse libraries. CORBA and its variants simplify the task of building distributed applications from components [Ude94] CORBA can integrate components that are independently ....

L. Blaine and A. Goldberg, "DTRE - A SemiAutomatic Transformation System", in Constructing Programs from Specifications, Elsevier Science Publishers, 1991.

....composable; this allows us to refine, for instance, the track specification but to defer the implementation of plot. Analogously, in principle, data type refinement could precede algorithm design. Our environment contains a library of commondata type implementations (in the sense of this paper) [2]. Support for the construction of custom implementations is available using the the same tools discussed above. There is no difference, conceptually and practically, between the implementations used for designing algorithms from those used for data type refinement. 4.8 Producing Code The ....

Blaine, L., and Goldberg, A. DTRE---a semi-automatic transformation system. In Constructing Programs from Specifications, B. Moller, Ed. North-Holland, Amsterdam, 1991, pp. 165-- 204.

....automate the development of software for large families of applications. Generators automatically transform compact, high level specifications of target systems into actual source code, and rely on libraries of parameterized, plug compatible, and reusable components for code synthesis. Generators [Bla91, Bat92a, Bax92, Gom94, Lei94, Nin94] are among many approaches that are being explored to construct customized software systems quickly and inexpensively from reuse libraries. CORBA and its variants simplify the task of building distributed applications from components [Ude94] CORBA can simplify the manual integration of ....

L. Blaine and A. Goldberg, "DTRE - A Semi-Automatic Transformation System", in Constructing Programs from Specifications, Elsevier Science Publishers, 1991.

No context found.

Blaine, L. and Goldberg, A. DTRE -- A Semi-Automatic Transformation System. Appeared in, Constructing Programs from Specifications. B. Möller, Ed., North Holland, 1991 Kestrel Institute Technical Report KES.U.91.3, May 1991.

....the straightforward formulation of nondeterministic data type specifications as algebraic theories in equational logic makes many desirable data refinements impossible to prove correct, due to the requirement of referential transparency. Consider for example the refinement of set to sequence [3]. It is desirable to refine equality of set not to equality of sequence but to an equivalence relation of sequence, in which sequences that are permutations of the same set are equivalent. Meanwhile, it is also desirable to refine the nondeterministic choose operator of set, which chooses an ....

Blaine, L., Goldberg, A. DTRE --- A semi-automatic transformation system. In Constructing Programs from Specifications, B. Moller, Ed. North-Holland, 1991, 165-204.

....of the Specware system [7] a system for developing formal specifications and refinements based on concepts from higher order logic and category theory. Planware and Specware embody theoretical developments stemming from Kestrel s experience with previous systems, such as KIDS [4] and DTRE [1]. The goal of Planware is to allow experts in planning and scheduling to assemble quickly a specification of a scheduling problem, and to generate automatically a high performance scheduler from it. The user s interactions with the system are designed to be entirely in the scheduling domain the ....

L. Blaine and A. Goldberg. DTRE -- a semiautomatic transformation system. In B. Moller, editor, Constructing Programs from Specifications, pages 165--204. North-Holland, Amsterdam, 1991.

....it through the medium of set construction. However, the straightforward formulation of nondeterministic data type specifications as algebraic theories in equational logic makes many desirable data refinements impossible to prove correct. Consider for example the refinement of set to sequence[3]. It is desirable to refine equality of set not to equality of sequence but to an equivalence relation of sequence, in which sequences that are permutations of the same set are equivalent. Meanwhile, it is also desirable to refine the nondeterministic choose operator of set, which chooses an ....

Blaine, L., Goldberg, A., "DTRE --- A Semi-Automatic Transformation System"; Constructing Programs from Specifications, B. Moller (editor), North-Holland, 1991, 165204.

No context found.

Blaine, Lee and Goldberg, Allen, DTRE -- A Semi-Automatic Transformation System, in Constructing Programs from Specifications, B. Moller (ed.), North Holland, 1991.

No context found.

L. Blaine and A. Goldberg. DTRE---A semi-automatic transformation system. In B. Moller, editor, Constructing Programs from Specifications, pages 165--203. North-Holland, Amsterdam, 1991.

No context found.

L. Blaine and A. Goldberg, "DTRE - A Semi-Automatic Transformation System", in Constructing Programs from Specifications, Elsevier Science Publishers, 1991.

No context found.

L. Blaine and A. Goldberg, "DTRE - A Semi-Automatic Transformation System", in Constructing Programs from Specifications, Elsevier Science Publishers, 1991.

No context found.

L. Blaine and A. Goldberg, "DTRE - A Semi-Automatic Transformation System", in Constructing Programs from Specifications, Elsevier Science Publishers, 1991.

First 50 documents

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