| |
Browse All Reviews > Computing Methodologies (I) > Artificial Intelligence (I.2) > Automatic Programming (I.2.2) > Program Synthesis (I.2.2...)
|
|
 |
|
|
| |
|
|
| |
1-10 of 15
Reviews about "Program Synthesis (I.2.2...)":
|
Date Reviewed |
| |
Semantics-based context-aware dynamic service composition
Fujii K., Suda T. ACM Transactions on Autonomous and Adaptive Systems 4(2): 1-31, 2009. Type: Article
There is a growing demand for new mobile and pervasive environments where software services, devices, and resources can be selected and combined to build flexible and adaptive applications. Pervasive environments are characterized by r...
|
Aug 13 2010 |
| |
Dynamic service composition using semantic information
Fujii K., Suda T. Service oriented computing (Proceedings of the 2nd International Conference on Service Oriented Computing, New York, NY, USA, Nov 15-19, 2004) 39-48, 2004. Type: Proceedings
Cumulative developments, starting with object-oriented technologies, executable components, and Web service technologies, coupled with continuing advancements in processor and memory speed, naturally lead to the dynamic composite servi...
|
Feb 24 2005 |
| |
Automated Software Synthesis: An Application in Mechanical CAD
Bhansali S., Hoar T. IEEE Transactions on Software Engineering 24(10): 848-862, 1998. Type: Article
Automatic program generation techniques are applied to a nontrivialmechanical CAD problem. This research paradigm may well be the way wemust proceed in this enticing area of programming automation. Success inautomatic program generatio...
|
Jul 1 1999 |
| |
Inductive functional programming using incremental program transformation
Olsson R. Artificial Intelligence 74(1): 55-81, 1995. Type: Article
The field of program synthesis from input/output examples has moved in recent years from one with a sporadic appearance of papers using ad hoc methods, to one with regular conferences and active research groups. Credit for this goes in...
|
Dec 1 1995 |
| |
Logic program synthesis from incomplete specifications
Flener P., Deville Y. Journal of Symbolic Computation 15(5-6): 775-805, 1993. Type: Article
The problem considered here is inferring a logic program for computing a relation that has been specified by examples and properties. The examples, which may be positive or negative, are ground atoms. The conditions are first-order sta...
|
Aug 1 1994 |
| |
Knowledge Representation and Reasoning in a Software Synthesis Architecture
Setliff D., Rutenbar R. IEEE Transactions on Software Engineering 18(6): 523-533, 1992. Type: Article
The basic purpose of this special issue was to present significant results in an area that has gone from being promising to having produced enough substantial achievements to be respected as a serious approach to fundamental questions ...
|
Jul 1 1993 |
| |
On complete sets of samples for generalized regular expressions
Kinber E. Theoretical Computer Science 91(1): 101-117, 1991. Type: Article
Is it possible to specify an arbitrary class of equivalent programs by a finite set of sample computations? To answer this question, the notion of a generalized regular expression has been proposed to formalize the sample computations....
|
Jan 1 1993 |
| |
Automated program synthesis (videotape)
Kant E., University Video Communications, Stanford, CA, 1990. Type: Book
I have little complaint about the actual material in this videotape. It gives a thorough review of the current state of the art in automated program synthesis, stating the advantages and disadvantages of the various methods available. ...
|
Mar 1 1992 |
| |
Algorithm synthesis: a comparative study
Steier D., Anderson A., Springer-Verlag New York, Inc., New York, NY, 1989. Type: Book (9789780387969602)
Steier and Anderson aim to provide a comparative study of how algorithms are designed from specifications. The book is a serious attempt to supply a uniform framework in which to compare the individual presentation styles of different ...
|
Oct 1 1990 |
| |
Top-down synthesis of divide-and-conquer algorithms
Smith D. Artificial Intelligence 27(1): 43-96, 1985. Type: Article
This paper considers recursive specifications in which the recursion (in F) is of the form:...
|
Jun 1 1986 |
| |
|
|
| |
|
|
