Case studies for the derivation of pointer algorithms
- The method presented in Calculating with pointer structures by Bernhard Möller to derive pointer algorithms has been shown well-applicable and easy-to-use in several various examples. We present the derivation of different pointer algorithms on lists from their functional specification. The intention of this paper is to show the advantages of the method on a number of medium-sized examples on the one hand. On the other hand we point out also problems and tasks to be solved to achieve a complete framework for the derivation of pointer algorithms working on inductively defined data structures.
Download full text files
Statistics
Additional Services
| Author: | Thorsten EhmGND |
|---|---|
| URN: | urn:nbn:de:bvb:384-opus4-266 |
| Frontdoor URL | https://opus.bibliothek.uni-augsburg.de/opus4/39 |
| Series (Serial Number): | Reports / Technische Berichte der Fakultät für Angewandte Informatik der Universität Augsburg (2003-09) |
| Publisher: | Institut für Informatik, Universität Augsburg |
| Place of publication: | Augsburg |
| Type: | Report |
| Language: | English |
| Year of first Publication: | 2003 |
| Publishing Institution: | Universität Augsburg |
| Release Date: | 2005/01/26 |
| Tag: | program synthesis |
| GND-Keyword: | Programmsynthese |
| Institutes: | Fakultät für Angewandte Informatik |
| Fakultät für Angewandte Informatik / Institut für Informatik | |
| Fakultät für Angewandte Informatik / Institut für Informatik / Professur für Programmiermethodik und Multimediale Informationssysteme | |
| Dewey Decimal Classification: | 0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik |
