Nondeterminism in Algebraic Specifications and Algebraic Programs

1. Front Matter

   Pages i-x

   PDF

2. Introduction

   • Heinrich Hussmann

   Pages 1-15

3. Nondeterministic Algebraic Specifications

   • Heinrich Hussmann

   Pages 17-42

4. Specifications with a Deterministic Basis

   • Heinrich Hussmann

   Pages 43-74

5. Structure of the Model Classes

   • Heinrich Hussmann

   Pages 75-88

6. Nondeterministic Specifications as a General Framework

   • Heinrich Hussmann

   Pages 89-124

7. Implementation and Examples

   • Heinrich Hussmann

   Pages 125-159

8. Partial Nondeterministic Specifications

   • Heinrich Hussmann

   Pages 161-185

9. Communicating Processes: An Example

   • Heinrich Hussmann

   Pages 187-200

10. Concluding Remarks

    • Heinrich Hussmann

    Pages 201-203

11. Back Matter

    Pages 205-254

    PDF

Algebraic specification, nondeterminism and term rewriting are three active research areas aiming at concepts for the abstract description of software systems: Algebraic specifications are well-suited for describing data structures and sequential software systems in an abstract way. Term rewriting methods are used in many prototyping systems and form the basis for executing specifi­ cations. Nondeterminism plays a major role in formal language theory; in programming it serves for delaying design decisions in program development and occurs in a "natural" way in formalisations of distributed processes. Heinrich Hussmann presents an elegant extension of equational specification and term rewriting to include nondeterminism. Based on a clean modeltheoretic semantics he considers term rewriting systems without confluence restrictions as a specification language and shows that fundamental properties such as the existence of initial models or the soundness and completeness of narrowing, the basic mechanism for executing equational specifications, can be extended to nondeterministic computations. The work of Heinrich Hussmann is an excellent contribution to Algebraic Programming; it gives a framework that admits a direct approach to program verification, is suitable for describing concurrent and distributed processes, and it can be executed as fast as Prolog.

• algebra
• automata
• formal language
• graphs
• homomorphism
• logic
• optimization
• petri net
• programming
• term rewriting
• verification

• Institut für Informatik, Technische Universität München, München 2, Germany

  Heinrich Hussmann

Policies and ethics