| Author | Title | Year | Journal/Proceedings | Reftype | DOI/URL |
|---|---|---|---|---|---|
| Biermann, A. & Krishnaswamy, R. | Constructing Programs from Example Computations | 1976 | IEEE Transactions on Software Engineering | article | DOI |
| Abstract: An autoprogrammer is an interactive computer programming system which automatically constructs computer programs from example computations executed by the user. The example calculations are done in a scratch pad fashion at a computer display using a light pen or other graphic input device, and the system stores a detailed history of all of the steps executed in the process. Then the system automatically synthesizes the shortest possible program which is capable of executing the observed examples. The paper describes the computational environment provided by the system, proves that the program synthesis technique is both "sound" and "complete," describes the design of the system, and gives some programs it was used to create. | |||||
BibTeX:
@article{BiermannK76,
author = {A.W. Biermann and R. Krishnaswamy},
title = {Constructing Programs from Example Computations},
journal = {IEEE Transactions on Software Engineering},
publisher = {IEEE Computer Society},
year = {1976},
volume = {2},
number = {3},
pages = {141--153},
doi = {http://doi.ieeecomputersociety.org/10.1109/TSE.1976.233812}
}
|
|||||
| Bischof, H., Gorlatch, S. & Kitzelmann, E. | Cost Optimality and Predictability of Parallel Programming with Skeletons | 2003 | Euro-Par 2003 Parallel Processing | inproceedings | URL |
| Abstract: Skeletons are reusable, parameterized components with well-defined semantics and pre-packaged efficient parallel implementation. This paper develops a new, provably cost-optimal implementation of the DS (double-scan) skeleton for the divide-and-conquer paradigm. Our implementation is based on a novel data structure called plist (pointed list); implementation's performance is estimated using an analytical model. We demonstrate the use of the DS skeleton for parallelizing a tridiagonal system solver and report experimental results for its MPI implementation on a Cray T3E and a Linux cluster: they confirm the performance improvement achieved by the cost-optimal implementation and demonstrate its good predictability by our performance model. | |||||
BibTeX:
@inproceedings{BischofGK03b,
author = {Holger Bischof and Sergei Gorlatch and Emanuel Kitzelmann},
title = {Cost Optimality and Predictability of Parallel Programming with Skeletons},
booktitle = {Euro-Par 2003 Parallel Processing},
publisher = {Springer-Verlag},
year = {2003},
pages = {682--693},
url = {http://www.springerlink.com/content/602ycb05htd85f24}
}
|
|||||
| Blanc, G. L. | BMWk Revisited: Generalization and Formalization of an Algorithm for Detecting Recursive Relations in Term Sequences | 1994 | ECML'94: Proceedings of the European Conference on Machine Learning | inproceedings | URL |
| Abstract: As several works in Machine Learning (particularly in Inductive Logic Programming) have focused on building recursive definitions from examples, this paper presents a formalization and a generalization of the BMWk methodology, which stems from program synthesis from examples, ten years ago. The framework of the proposed formalization is term rewriting. It allows to state some theoretical results on the qualities and limitations of the method. | |||||
BibTeX:
@inproceedings{LeBlanc94,
author = {Guillaume Le Blanc},
title = {BMWk Revisited: Generalization and Formalization of an Algorithm for Detecting Recursive Relations in Term Sequences},
booktitle = {ECML'94: Proceedings of the European Conference on Machine Learning},
publisher = {Springer-Verlag},
year = {1994},
pages = {183--197},
url = {http://dx.doi.org/10.1007/3-540-57868-4_58}
}
|
|||||
| Hofmann, M., Kitzelmann, E. & Schmid, U. | Analysis and Evaluation of Inductive Programming Systems in a Higher-Order Framework [BibTeX] |
2008 | 31st German Conference on Artificial Intelligence | inproceedings | |
BibTeX:
@inproceedings{HofmannKS08,
author = {Martin Hofmann and Emanuel Kitzelmann and Ute Schmid},
title = {Analysis and Evaluation of Inductive Programming Systems in a Higher-Order Framework},
booktitle = {31st German Conference on Artificial Intelligence},
publisher = {Springer-Verlag},
year = {2008},
note = {to appear}
}
|
|||||
| Kitzelmann, E. | Data-driven Induction of Functional Programs [BibTeX] |
2008 | 18th European Conference on Artificial Intelligence | inproceedings | |
BibTeX:
@inproceedings{Kitzelmann08ECAI,
author = {Emanuel Kitzelmann},
title = {Data-driven Induction of Functional Programs},
booktitle = {18th European Conference on Artificial Intelligence},
publisher = {IOS Press},
year = {2008},
note = {to appear}
}
|
|||||
| Kitzelmann, E. | Analytical Inductive Functional Programming [BibTeX] |
2008 | 18th International Symposium on Logic-Based Program Synthesis and Transformation | inproceedings | |
BibTeX:
@inproceedings{Kitzelmann08LOPSTR,
author = {Emanuel Kitzelmann},
title = {Analytical Inductive Functional Programming},
booktitle = {18th International Symposium on Logic-Based Program Synthesis and Transformation },
publisher = {Springer-Verlag},
year = {2008},
note = {to appear}
}
|
|||||
| Lapointe, S. & Matwin, S. | Sub-unification: a Tool for Efficient Induction of Recursive Programs [BibTeX] |
1992 | ML92: Proceedings of the Ninth International Workshop on Machine Learning | inproceedings | URL |
BibTeX:
@inproceedings{LapointeM92,
author = {St\'{e}phane Lapointe and Stan Matwin},
title = {Sub-unification: a Tool for Efficient Induction of Recursive Programs},
booktitle = {ML92: Proceedings of the Ninth International Workshop on Machine Learning},
publisher = {Morgan Kaufmann Publishers Inc.},
year = {1992},
pages = {273--281},
url = {http://portal.acm.org/citation.cfm?id=141975.142038}
}
|
|||||
| Marcinkowski, J. & Pacholski, L. | Undecidability of the Horn-clause Implication Problem [BibTeX] |
1992 | Proceedings of the 33rd IEEE Annual Symposium on Foundations of Computer Science | inproceedings | DOIURL |
BibTeX:
@inproceedings{MarcinkowskiP92,
author = {J. Marcinkowski and L. Pacholski},
title = {Undecidability of the Horn-clause Implication Problem},
booktitle = {Proceedings of the 33rd IEEE Annual Symposium on Foundations of Computer Science},
publisher = {IEEE},
year = {1992},
pages = {354-362},
url = {http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=267755},
doi = {http://dx.doi.org/10.1109/SFCS.1992.267755}
}
|
|||||
| Mitchell, T. M. | Generalization as Search [BibTeX] |
1982 | Artificial Intelligence | article | |
BibTeX:
@article{Mitchell82,
author = {Tom M. Mitchell},
title = {Generalization as Search},
journal = {Artificial Intelligence},
year = {1982},
volume = {18},
number = {2},
pages = {203--226}
}
|
|||||
| Summers, P. D. | Program Construction from Examples [BibTeX] |
1975 | School: Dept. of Computer Science, Yale University | phdthesis | |
BibTeX:
@phdthesis{Summers75,
author = {P. D. Summers},
title = {Program Construction from Examples},
school = {Dept. of Computer Science, Yale University},
year = {1975}
}
|
|||||
Created by JabRef export filters on 08/09/2008 by the social publication management platform BibSonomy