D.R. Smith. Toward a classification approach to design. Proc. of AMAST'96, pp. 62--84. LNCS 1101. Springer, 1996.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....speed up) constraint program development and to speed up the compiled programs. Related Work This work is inspired by D.R. Smith s research on synthesising global search programs (in Refine) from first order 3 logic specifications (also in Refine) with KIDS [11, 12] and its successor DESIGNWARE [13]. Our work concentrates on generating constraint programs instead. We thus only have to generate code that (incrementally) poses the constraints, because the actual constraint propagation and pruning are performed by the CP system. We have thus detached the problem specific model (constraint part ....

....allows sets of a priori unknown size [10] and is faster than ours, but it is less expressive and less declarative. The OPL [15] constraint language sets new standards in expressiveness, but is currently limited to membership constraints with ground sets (of known size) The DESIGNWARE system [13] maybe allows the formulation of constraints on possibly infinite sets and on sets whose elements are drawn from an infinite domain, but its fully automated synthesis sub system can only generate very slow programs (though its user guided transformation sub system can optimise them into extremely ....

D.R. Smith. Toward a classification approach to design. Proc. of AMAST'96, pp. 62--84. LNCS 1101. Springer-Verlag, 1996.

....of them do not support optimisation problems. A language independent computer assisted constraint programming architecture was proposed [15] but it does not support set constraints. Taking a completely different approach, D.R. Smith developed the program synthesisers kids [12, 13] DesignWare [14], and PlanWare [2] which semiautomatically compile high level specifications written in refine into applicative programs. When applied to specifications of CSPs, these systems excel (at help int MaintCost = int NbStores = enum Warehouses . range Stores 0. NbStores 1; int ....

D.R. Smith. Toward a classification approach to design. In Proc. of AMAST'96, pp. 62--84. LNCS 1101. Springer-Verlag, 1996.

....Or in other words, the ADT specified by the source specification can be obtained from the ADT specified by the target specification by forgetting some of the structure of the latter ADT. Examples of structural relationships between specifications are interpretations and refinements [Smi96]. Interpretations define the structural correspondence between a reusable problem specification and the specification of a problem at hand (e.g. interpretation relationship I in Figure 1) Refinements define relationships between the reusable problem specifications and their reusable solutions ....

....relationship I in Figure 1) Refinements define relationships between the reusable problem specifications and their reusable solutions (e.g. refinement relationship R in Figure 1) Both types of relationships are defined in terms of specification morphisms. As an example (adopted from [Smi96]) we consider the problem of sorting a list of numbers. The algebraic specification of this problem will be called SortingProblemSpec. The problem can be solved by applying divide and conquer problem solving strategy (the resulting solution is the Quicksort algorithm; see [Smi96] for details) ....

[Article contains additional citation context not shown here]

D.R. Smith. Toward a Classification Approach to Design. In Proceedings of Algebraic Methodology & Software Technology, AMAST'96, Munich, Germany, July 1996, M. Wirsing and M. Nivat (Eds.), LCNS 1101, Springer, 1996, pp. 62-84

....program, our meta heuristic can be pre computed once and for all, in a problem independent way for an entire class of problems, and the user thus need not provide more than a high level problem description. Finally, the work of Smith et al. on the kids program synthesiser and its successors [11, 12] has some influence on ours. Their semi automatic systems excel at generating (sometimes novel) programs for CSPs, though without any explicit recourse to constraint programming technology. Indeed, they synthesise ad hoc code given a high level description of a CSP and a formal domain theory. By ....

D.R. Smith. Toward a classification approach to design. Proc. of AMAST'96, pp. 62--84. LNCS 1101. Springer-Verlag, 1996.

....Programming Language) 28] for scheduling and resource allocation problems. 5.1 Related Work This work is inspired by D.R. Smith s research on synthesising global search programs (in Refine) from first order logic specifications (also in Refine) with KIDS [23, 24] and its successor DESIGNWARE [25]. Our work concentrates on generating constraint programs instead. We thus only have to generate code that (incrementally) posts the constraints, because the actual constraint propagation and pruning are performed by the CP system. We have thus detached the problem specific model (constraint part ....

....allows sets of a priori unknown size [20] and is faster than ours, but it is less expressive and less declarative. The OPL [28] constraint language sets new standards in expressiveness, but is currently limited to membership constraints with ground sets (of known size) The DESIGNWARE system [25] maybe allows the formulation of constraints on possibly infinite sets and on sets whose elements are drawn from an infinite domain, but its fully automated synthesis sub system can only generate very slow programs (though its user guided transformation sub system can optimise them into extremely ....

D.R. Smith. Toward a classification approach to design. Proc. of AMAST'96, pp. 62--84. LNCS 1101. Springer-Verlag, 1996.

....models into mathematical notations to provide high level specification support. In addition to formal support in verification, one could also wish to provide automated support in deriving refined specifications or implementations of KBSs with techniques of automated program development (cf.[133]) In the following sections we will discuss the subfields problem solving methods and ontologies which are fruitful research areas generalizing the original notions of inference engines and domain knowledge bases. Clearly, these fields introduce new interesting requirements for formal approaches. ....

D. R. Smith, Towards a Classification Approach to Design, in: Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology (AMAST-96), Munich, Germany, July, 1996.

....of values. Operations specify how to construct, modify and differentiate values of the sort. The axioms define equivalence sets of values in the sort. Theory morphisms are the formal mechanism underlying two methods of composing smaller theories to form larger ones: extension and parameterization [10, 17]. A theory morphism maps the sorts and operators of one theory to sorts and operators of another theory such that the axioms of first theory are valid theorems in the second theory. Theory B is an extension of theory A if B contains all of the sorts, operators and axioms of A. An extension is ....

....axioms can be added (by extending the theory) to describe a certain class or style of architectures. This results in a hierarchy of architecture theories that can be used to classify a problem theory and provide a control mechanism for matching an architecture theory to a problem specification [4, 17]. 4 Architecture Implementation An overview of the role of architecture theories in system design is show in Figure 6. As described in the previous section the specialized architecture theory is created by instantiating an architecture theory with a problem and component specifications. The ....

Douglas R. Smith. Toward a classification approach to design. In Proceedings of the Fifth International Conference on Algebraic Methodology and Software Technology, LCNS. Springer Verlag, 1996.

....to accomplish the ideal optimization. Later we will see this idea arising in other approaches that we will discuss: GenVoca [Batory, Chen, et al. 1997b] Anticipatory Optimization [Biggerstaff 1997, 1998] Aspect Oriented Programming [Kiczales et al. 1997] and Kids [Smith 1990, 1991; Smith et al. 1996]. Separate domains and small grain transformations of the Draco variety are not without problems. 3.1.7 Global Dependencies The problem with small grain transformations used in a system that operates by pure forward refinement (i.e. by a local substitution paradigm) is that such a system does ....

....such domains. Another difficulty arises because of the search space induced by the deep inference chains. This is likely to lead to generational inefficiency in comparison to Draco or GenVoca style systems. Nevertheless, this is promising work that is beginning to provide practical contributions [Smith et al. 1996]. Systems in this class had their roots in the early work of Green [1969] and Waldinger [1969] who developed methods for developing constructive proofs of the existence of a program that met a given Input Output specification. The desired program was derived as a side effect of the proof process. ....

Smith, D. R. (1996), "Toward a Classification Approach to Design," In The Proceedings of the Fifth International Conference on Algebraic Methodology and Software Technology, AMAST96 , LNCS, Springer Verlag.

....the instantiation of general laws that relate the different abstraction levels in an algebraic setting such as ours. We assume that such instantiations can be determined from hierarchically structured application domains using techniques that have been developed by Smith for sequential algorithms [Smi96] In order to provide the reader with the complete picture, this section briefly discusses two fundamental concepts of the methodology: the skeleton hierarchy and cost measures for guiding the transformation process. Since our approach is in line with other skeleton based approaches, our main ....

D. R. Smith. Toward a classification approach to design. In Proceedings of the Fifth International Conference on Algebraic Methodology and Software Technology, AMAST'96, LNCS. Springer Verlag, 1996.

....specification languages and tools are available to represent and debug theories. We will use the Larch Shared Language (LSL) 4] through out the paper. Theory morphisms are the formal mechanism underlying two methods of constructing larger theories from smaller ones: extension and parameterization [13]. A theory morphism maps the sorts and operators of one theory to sorts and operators of another theory such that the axioms of first theory are theorems in the second theory [14] Theory B is an extension of theory A if B contains all of the sorts, operators and axioms of A. An extension is ....

Douglas R. Smith. Toward a classification approach to design. In Proceedings of the Fifth International Conference on Algebraic Methodologyand Software Technology, AMAST'96, LCNS. Springer Verlag, 1996.

....provides highly automated support for requirements acquisition and synthesis of high performance scheduling algorithms. The remainder of this paper covers basic concepts and the key ideas of our approach to software developmentby refinement, in particular the concept of design by classification [6]. We also discuss the application of these techniques to domain specific refinementinPlanware [1] A detailed presentation of a derivation in Designware is given in [7] 2 Basic Concepts 2.1 Specifications A specification is the finite presentation of a theory. The signature of a specification ....

....a classification arrow from A to S 0 which classifies S 0 as having A structure bymaking explicit how S 0 has at least the structure of A. Finally the refinement is applied by computing the pushout in the category of diagrams. The creativework lies in constructing the classification arrow [5,6]. 4 Scaling up The process of refining specification S 0 described above has three basic steps: 1) select a refinement A = B from a library, 2) construct a classification arrow A = S 0 ,and (3) compute the pushout S 1 of B ( A = S 0 . The resulting refinement is the cocone arrow S 0 = ....

[Article contains additional citation context not shown here]

Smith, D. R. Toward a classification approach to design. In Proceedings of the Fifth International ConferenceonAlgebraic Methodology and Software Technology, AMAST'96 (1996), vol. LNCS 1101, Springer-Verlag, pp. 62--84.

....provides highly automated support for requirements acquisition and synthesis of high performance scheduling algorithms. The remainder of this paper covers basic concepts and the key ideas of our approach to software development by refinement, in particular the concept of design by classification [9]. A simple example is carried through algorithm design, datatype refinement, and expression simplification. We also discuss the application of these techniques to domainspecific refinement in Planware [1] This paper assumes a rudimentary knowledge of logic and category theory, although details ....

....a classification arrow from A to S 0 which classifies S 0 as having A structure by making explicit how S 0 has at least the structure of A. Finally the refinement is applied by computing the pushout in the category of diagrams. The creative work lies in constructing the classification arrow [7, 9]. 3.3. Development of Sorting Algorithms Our goal in this section is to show a simple example that refines a requirement spec to code by applying (1) an algorithm design refinement, 2) a datatype refinement, and (3) an expression optimization refinement. We step through the refinement of a ....

[Article contains additional citation context not shown here]

Smith, D. R. Toward a classification approach to design. In Proceedings of the Fifth International Conference on Algebraic Methodology and Software Technology, AMAST'96 (1996), vol. LNCS 1101, Springer-Verlag, pp. 62--84.

....provides highly automated support for requirements acquisition and synthesis of high performance scheduling algorithms. The remainder of this paper covers basic concepts and the key ideas of our approach to software development by refinement, in particular the concept of design by classification [9]. A simple example is carried through algorithm design, datatype refinement, and expression simplification. We also discuss the application of these techniques to domainspecific refinement in Planware [1] This paper assumes a rudimentary knowledge of logic and category theory, although details ....

....a classification arrow from A to S 0 which classifies S 0 as having A structure by making explicit how S 0 has at least the structure of A. Finally the refinement is applied by computing the pushout in the category of diagrams. The creative work lies in constructing the classification arrow [7, 9]. 3.3. Development of Sorting Algorithms Our goal in this section is to show a simple example that refines a requirement spec to code by applying (1) an algorithm design refinement, 2) a datatype refinement, and (3) an expression optimization refinement. We step through the refinement of a ....

[Article contains additional citation context not shown here]

Smith, D. R. Toward a classification approach to design. In Proceedings of the Fifth International Conference on Algebraic Methodology and Software Technology, AMAST'96 (1996), vol. LNCS 1101, Springer-Verlag, pp. 62--84.

....theory to a sorting specification correspond to various sorting algorithms, such as quicksort, mergesort or Batcher s sort. Design theories can be arranged in a refinement hierarchy with specification morphisms providing the refinement links; e.g. a hierarchy of algorithm theories is presented in [3]. The concepts and procedures described below are intended to automate the process of algorithm design by choosing a chain of algorithm design theories for a particular problem, and by constructing an interpretation from the chosen design theory to that problem. Thus, an algorithm for the specific ....

....Informally speaking, we can use DRO, DROF, and the problem domain specification to construct a program scheme, and that will be a program scheme for our specific problem too. The third arrow construction tactic is called classification and it involves a process called ladder construction (see [3] for details) Here we only give a brief description of it in the context of algorithm design. Basically, this tactic consists of two steps: 1) selecting an appropriate design theory from a refinement hierarchy of design theories, and (2) constructing an interpretation. The first step is in ....

D. R. Smith. Toward a classification approach to design. In Proceedings of the Fifth International Conference on Algebraic Methodology and Software Technology, AMAST'96, volume LNCS 1101, pages 62--84. Springer-Verlag, 1996.

No context found.

D.R. Smith. Toward a classification approach to design. Proc. of AMAST'96, pp. 62--84. LNCS 1101. Springer, 1996.

No context found.

Douglas R. Smith. Toward a classification approach to design. Proceedings of the Fiftieth International Conference on Algebraic Methodology and Software Technology, AMAST'96, LNCS, pages 62--84, 1996. Springer Verlag.

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