Blaine, L., Gilham, L.-M., Liu, J., Smith, D. R., and Westfold, S., "Planware -- Domain-Specific Synthesis of High-Performance Schedulers," in Proc. 13th Intl. Conf. Automated Software Engineering, edited by D. F. Redmiles and B. Nuseibeh, IEEE Comp. Soc. Press, 1998, pp. 270--280.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....capabilities to write formal specs, refine them, compose specs and refinements, generate running code from refined specs, and call mechanical theorem provers to prove the correctness of specs and refinements as well as putative properties of specs for validation purposes. Our Planware tool [1] is a domain specific extension of Specware: it is a fully automatic generator of schedulers from high level specs that are written by the user in a simple and intuitive tabular form. Planware internally translates these domain specific specs into Specware specs and makes use of the Specware ....

Lee Blaine, Li-Mei Gilham, Junbo Liu, Doug Smith, and Stephen Westfold. Planware: Domain-specific synthesis of high-performance schedulers. In Proc. 13th Conference on Automated Software Engineering (ASE'98), pages 270--280, October 1998.

....font. Relatively simple tools can be built to achieve this kind of program rewriting. Surprisingly, this simple approach has worked well for large applications. However, for smaller programs or algorithm synthesis, much more is needed. The work at Kestrel on synthesizing scheduling algorithms [6] and the synthesis and optimization of orbital algorithms at NASA Ames [20] are really impressive. They require nontrivial domain theories and a non trivial programming infrastructure. Even the simple data structures domain requires more sophistication than macros. Fig. 8. A Declarative GUI ....

L. Blaine, et al., "Planware: Domain-Specific Synthesis of High-performance Schedulers", Automated Software Engineering Conference 1998, 270-280.

....based on opl, our esra language is computationally incomplete, but this does not disturb us, as we just aim at speeding up the modelling (and solving) of at least some classes of (real life) CSPs. This philosophy is in line with the current trend on domain specific tools, such as the PlanWare [2] system for planning problems, or the primitives of opl [16] for scheduling and resource allocation problems. Related Work. Several set constraint languages exist (such as clps [1] conjunto [8] np spec [3] oz [11] and flogg [4] but none of them seems as expressive (or fast) as our ....

....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 Capacity[Warehouses] ....

L. Blaine, L. Gilham, J. Liu, D.R. Smith, and S. Westfold. PlanWare: Domainspecific synthesis of high-performance schedulers. In Proc. of ASE'98, pp. 270--279. IEEE Computer Society Press, 1998.

....the data mining community is to provide a flexible data modeling language [4] Finally, program synthesis has been proven to be competitive in other domains. It offers: ffl Rapid turn around : even for large tasks mature synthesis systems usually require less than a few minutes to produce code [11, 2]. ffl Reliability : synthesized code is used in production systems to schedule military logistics [2] or to price stock options [15] ffl Efficiency : synthesized code can be an order of magnitude faster than hand crafted special purpose code [2] However, to the best of our knowledge, program ....

....has been proven to be competitive in other domains. It offers: ffl Rapid turn around : even for large tasks mature synthesis systems usually require less than a few minutes to produce code [11, 2] ffl Reliability : synthesized code is used in production systems to schedule military logistics [2] or to price stock options [15] ffl Efficiency : synthesized code can be an order of magnitude faster than hand crafted special purpose code [2] However, to the best of our knowledge, program synthesis has not previously been applied to data analysis algorithms; an edited discussion on its ....

[Article contains additional citation context not shown here]

L. Blaine, L. Gilham, J. Liu, D.R. Smith, and S. Westfold. Planware -- domain-specific synthesis of high-performance schedulers. In Proc. 13th Intl. Conf. Automated Software Engineering, pp. 270--280, 1998.

....language, by just developing programming schemas for some problem families, if this is what it takes to facilitate (and speed up) constraint program development and to speed up the compiled programs. This philosophy is in line with the current trend of domain specific tools, such as the PLANWARE [2] system for planning problems, or the domain specific primitives of OPL (Optimisation 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 ....

L. Blaine, L. Gilham, J. Liu, D.R. Smith, and S. Westfold. PLANWARE: Domain-specific synthesis of high-performance schedulers. In D.F. Redmiles and B. Nuseibeh (eds), Proc. of ASE'98, pp. 270-- 279. IEEE Computer Society Press, 1998.

....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 provides the vocabulary for describing objects, operations, and properties in some domain of ....

Blaine, L., Gilham, L., Liu, J., Smith, D., , and Westfold, S. Planware -- domain-specific synthesis of high-performance schedulers. In Proceedings of the Thirteenth Automated Software Engineering Conference (October 1998), IEEE Computer Society Press, pp. 270--280.

....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 about the categories of interest are introduced and motivated by examples. 3 op empty : Container op in : E; Container Boolean end definition end spec Figure 1: Specification for Containers ....

....b into an element a and the remainder of the bag b ; i.e. an inverse of insert bag(a; b ) If the bags are ultimately implemented as lists, then it is natural to use first and rest to perform the decomposition. However consider two equal bags f1,1,2g= f2,1,1g. If f1,1,2g is represented by [1,1,2] then it will decompose into 1 and f1,2g. If f2,1,1g is represented by [2,1,1] then it will decompose into 2 and f1,1g. Hence the decomposition is not functional on bags, even though it is functional on lists. There are various approaches to this problem. We observe however that any extra work ....

[Article contains additional citation context not shown here]

Blaine, L., Gilham, L., Liu, J., Smith, D., and Westfold, S. Planware -- domain-specific synthesis of high-performance schedulers. In Proceedings of the Thirteenth Automated Software Engineering Conference (October 1998), IEEE Computer Society Press, pp. 270--280.

....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 about the categories of interest are introduced and motivated by examples. spec Container is sorts E; Container op empty : Container op singleton : E Container op join : Container; Container ....

....b into an element a and the remainder of the bag b 0 ; i.e. an inverse of insert bag(a; b 0 ) If the bags are ultimately implemented as lists, then it is natural to use first and rest to perform the decomposition. However consider two equal bags f1,1,2g= f2,1,1g. If f1,1,2g is represented by [1,1,2] then it will decompose into 1 and f1,2g. If f2,1,1g is represented by [2,1,1] then it will decompose into 2 and f1,1g. Hence the decomposition is not functional on bags, even though it is functional on lists. There are various approaches to this problem. We observe however that any extra work ....

[Article contains additional citation context not shown here]

Blaine, L., Gilham, L., Liu, J., Smith, D., and Westfold, S. Planware -- domain-specific synthesis of high-performance schedulers. In Proceedings of the Thirteenth Automated Software Engineering Conference (October 1998), IEEE Computer Society Press, pp. 270--280.

No context found.

Blaine, L., Gilham, L.-M., Liu, J., Smith, D. R., and Westfold, S., "Planware -- Domain-Specific Synthesis of High-Performance Schedulers," in Proc. 13th Intl. Conf. Automated Software Engineering, edited by D. F. Redmiles and B. Nuseibeh, IEEE Comp. Soc. Press, 1998, pp. 270--280.

No context found.

L. Blaine et al. PLANWARE: Domain-specific synthesis of high-performance schedulers. In Proc. of ASE'98, pp. 270--279. IEEE Computer Society Press, 1998. 18

No context found.

Lee Blaine, Li-Mei Gilham, Junbo Liu, Doug Smith, and Stephen Westfold. Planware: Domain-specific synthesis of high-performance schedulers. In Proc. 13th Conference on Automated Software Engineering (ASE'98), pages 270--280, October 1998.

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