Towards executable specifications using conditional axioms

  • K. Drosten
Contibuted Papers

DOI: 10.1007/3-540-12920-0_8

Part of the Lecture Notes in Computer Science book series (LNCS, volume 166)
Cite this paper as:
Drosten K. (1984) Towards executable specifications using conditional axioms. In: Fontet M., Mehlhorn K. (eds) STACS 84. STACS 1984. Lecture Notes in Computer Science, vol 166. Springer, Berlin, Heidelberg

Abstract

Executing algebraic specifications is done by considering the equations as directed rules from left to right in order to compute normal forms. To improve the expressiveness of algebraic specifications, we not only admit pure equations but conditional ones having the form of positive Horn clauses. Based on a hierarchical approach where conditions have to be evaluated by means of axioms at lower levels, syntactical criteria are provided which guarantee the Church-Rosser property and, therefore, the well-definedness of the operational semantics. Besides, these criteria turn out to be sufficient for the termination of the full substitution strategy as well. Automatic computation of normal forms is possible if each proper subspecification has the finite termination property additionally.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1984

Authors and Affiliations

  • K. Drosten
    • 1
  1. 1.TU Braunschweig, Institut fuer InformatikBraunschweig

Personalised recommendations