Hostname: page-component-848d4c4894-tn8tq Total loading time: 0 Render date: 2024-06-17T20:54:36.950Z Has data issue: false hasContentIssue false

Hidden coinduction: behavioural correctness proofs for objects

Published online by Cambridge University Press:  01 June 1999

JOSEPH A. GOGUEN
Affiliation:
Department of Computer Science and Engineering, University of California at San Diego, USA
GRANT MALCOLM
Affiliation:
Connect, Department of Computer Science, University of Liverpool, UK

Abstract

This paper unveils and motivates an ambitious programme of hidden algebraic research in software engineering. We begin with an outline of our general goals, continue with an overview of results, and conclude with a discussion of some future plans. The main contribution is powerful hidden coinduction techniques for proving behavioural correctness of concurrent systems, and several mechanical proofs are given using OBJ3. We also show how modularization, bisimulation, transition systems, concurrency and combinations of the functional, constraint, logic and object paradigms fit into hidden algebra.

Type
Research Article
Copyright
© 1999 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)