Advertisement

The RAP system as a tool for testing COLD specifications

  • Heinrich Hussmann
  • Alfons Geser
Part III Rapid Prototyping With Algebraic Specification
  • 106 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 394)

Abstract

This paper describes the practical use of the RAP system, a rapid prototyping system for algebraic specifications combining term rewriting and resolution techniques. After a sketch of the general aims of RAP, the behaviour of the system is described from the user's point of view, illustrated by detailed examples of moderate size. All examples are presented in COLD-K syntax.

Keywords

Rapid Prototype Logic Programming Function Symbol Proof Tree Logic Programming Language 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Bauer, Wössner 82]
    F. L. Bauer, H. Wössner, Algorithmic language and program development. Springe 1982.Google Scholar
  2. [Berghammer, et al. 87]
    R. Berghammer, H. Ehler, H. Zierer, Towards an algebraic specification of code generation. Report No. TUM-I8707 Technische Universität München.Google Scholar
  3. [Berry, Wing 85]
    D. M. Berry, J. M. Wing, Specifying and prototyping: some thoughts on why they are successful. Proc. TAPSOFT 85 Conf., Vol. 2, LNCS 186, Springer 1985, pp. 117–128.Google Scholar
  4. [Bouge et al. 85]
    L. Bouge, N. Choquet, L. Fribourg, M. C. Gaudel, Test sets generation from algebraic specifications using logic programming. Proc. TAPSOFT 85 Conf., LNCS 186, Springer 1986, pp. 262–275.Google Scholar
  5. [Budde et al. 85]
    R. Budde, K. Kuhlenkamp, L., Matthiassen, H. Züllinghoven (Eds.), Approaches to prototyping. Springer 1984.Google Scholar
  6. [Feijs, Jonkers, Koymans, Renardel 87]
    L. M. G. Feijs, H. B. M. Jonkers, C. P. J. Koymans, G. R. Renardel de Lavalette, Formal definition of the design language COLD-K. Report ESPRIT METEOR Task 7, 1987.Google Scholar
  7. [Fribourg 84]
    L. Fribourg, Oriented equational clauses as a programming language. Report 84002 Laboratories de Marcoussis, 1984. Short version in: Proc. 11th ICALP Conf., LNCS 172, Springer 1984, pp. 162–173Google Scholar
  8. [Gelissen 88]
    J. H. A. Gelissen, Rapid prototyping of COLD specifications using RAP. Report ESPRIT METEOR Task 8, 1988.Google Scholar
  9. [Geser 86/88]
    A. Geser, An algebraic specification of the INTEL 8085 microprocessor: A case study. Report MIP-8608 Universität Passau, 1986. Revised version contained within this volume.Google Scholar
  10. [Geser, Hussmann 85/88]
    A. Geser, H. Hussmann, Rapid prototyping for algebraic specifications — Examples for the use of the RAP system. Report MIP-8517 Universität Passau, 1985. Second, revised edition to appear.Google Scholar
  11. [Geser, Hussmann 86]
    A. Geser, H. Hussmann, Experiences with the RAP system — a specification interpreter combining term rewriting and resolution. Proc. ESOP 86 Conf., LNCS 213, Springer 1986, pp. 339–350.Google Scholar
  12. [Geser, Hussmann, Mueck 88]
    A. Geser, H. Hussmann, A. Mueck, A compiler for a class of conditional term rewriting systems. In: Conditional Term Rewriting Systems, LNCS 308, Springer 1988, pp. 84–90.Google Scholar
  13. [Huet, Hullot 80]
    G. Huet, J.-M. Hullot, Proofs by induction in equational theories with constructors. Journal of Computer and System Sciences 25, 239–266 (1982)CrossRefGoogle Scholar
  14. [Hussmann 85]
    H. Hussmann, Unification in conditional-equational theories. Report Universität Passau MIP-8502, 1985. Short version in: Proc. EUROCAL 85 Conf., LNCS 204, Springer 1985, pp. 543–553.Google Scholar
  15. [Hussmann 85/87]
    H. Hussmann, Rapid prototyping for algebraic specifications — RAP system user's manual. Report Universität Passau MIP-8504, 1985. Second, completely revised edition, 1987.Google Scholar
  16. [Hussmann, Rank 88]
    H. Hussmann, C. Rank, Specification and Prototyping of a Compiler for a Small Applicative Language. Contained within this volume.Google Scholar
  17. [Jonkers 88]
    H. B. M. Jonkers, A concrete syntax for COLD-K. Report ESPRIT METEOR Task 8, 1988.Google Scholar
  18. [Jonkers, Koymans, Renardel 85]
    H. B. M. Jonkers, C. P. J. Koymans, G. R. Renardel de Lavalette, A semantic framework for the COLD family of languages. Report Philips Research Laboratories Eindhoven, 1985.Google Scholar
  19. [Padawitz 87]
    P. Padawitz, ECDS-A rewrite rule based interpreter for a programming language with abstraction and communication, Report Universität Passau MIP-8703, 1987.Google Scholar
  20. [Padawitz 88]
    P. Padawitz, Computing in Horn clause theories. EATCS Monographs in Computer Science Vol. 16, Springer 1988.Google Scholar
  21. [Spec 85]
    Hansi A. Spec, Possible and impossible questions to an interpreter for algebraic specifications [in German]. Report No. 4/85 Universität Bremen, 1985.Google Scholar
  22. [Rety et al. 85]
    P. Rety, C. Kirchner, H. Kirchner, P. Lescanne, NARROWER: a new algorithm for unification and its application to logic programming. In Proc. RTA 85 Conf., LNCS 202, Springer 1985, pp. 141–155.Google Scholar
  23. [Wirsing et al. 83]
    M. Wirsing, P. Pepper, H. Partsch, W. Dosch, M. Broy, On hierarchies of abstract data types. Acta Informatica 20, 1–33 (1983).CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Heinrich Hussmann
    • 1
  • Alfons Geser
    • 1
  1. 1.Fakultät für Mathematik und InformatikUniversität PassauPassau

Personalised recommendations