Abstract
Cleverly designed software often fails to satisfy its requirements strictly, but instead satisfies them behaviorally, in the sense that they appear to be satisfied under every experiment that can be performed on the system. A good example is the traditional implementation of sets by lists, where union as implemented by append fails to strictly satisfy basic laws like commutativity and idempotency, but does satisfy them behaviorally. It is becoming increasingly clear that behavioral specification is more appropriate to software engineering than traditional approaches that rely on strict satisfaction of axioms, and it is therefore becoming increasingly important to develop powerful techniques for behavioral verification. This paper presents some techniques of this kind in the area called hidden algebra, clustered around the central notion of coinduction. We believe hidden algebra is the natural next step in the evolution of algebraic semantics and its first order proof technology. Hidden algebra originated in [7], and was developed further in [8,10,3,12,5] among other places; the most comprehensive survey currently available is [12].
On leave from Fundamentals of Computer Science, Faculty of Mathematics, University of Bucharest, Romania.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Narjes Berregeb, Adel Bouhoula, and Michaël Rusinowitch. Observational proofs with critical contexts. In FundamentalApproaches to Software Engineering, volume 1382 of Lecture Notes in Computer Science, pages 38–53. Springer-Verlag, 1998.
Michael Bidoit and Rolf Hennicker. Behavioral theories and the proof of behavioral properties. Theoretical Computer Science, 165:3–55, 1996.
Rod Burstall and Răzvan Diaconescu. Hiding and behaviour: an institutional approach. In A. William Roscoe, editor, A Classical Mind: Essays in Honour of C.A.R. Hoare, pages 75–92. Prentice-Hall, 1994.
Răzvan Diaconescu. Behavioral coherence in object-oriented algebraic specification. Technical Report IS-RR-98-0017F, Japan Advanced Institute for Science and Technology, June 1998. Submitted for publication.
Răzvan Diaconescu and Kokichi Futatsugi. CafeOBJ Report: The Language, Proof Techniques, and Methodologies for Object-Oriented Algebraic Specification. World Scientific, 1998. AMAST Series in Computing, volume 6.
Marie-Claude Gaudel and Igor Privara. Context induction: an exercise. Technical Report 687, LRI, Université de Paris-Sud, 1991.
Joseph Goguen. Types as theories. In George Michael Reed, Andrew William Roscoe, and Ralph F. Wachter, editors, Topology and Category Theory in Computer Science, pages 357–390. Oxford, 1991. Proceedings of a Conference held at Oxford, June 1989.
Joseph Goguen and Răzvan Diaconescu. Towards an algebraic semantics for the object paradigm. In Hartmut Ehrig and Fernando Orejas, editors, Proceedings, Tenth Workshop on Abstract Data Types, pages 1–29. Springer, 1994. Lecture Notes in Computer Science, Volume 785.
Joseph Goguen, Kai Lin, Akira Mori, Grigore Roşsu, and Akiyoshi Sato. Tools for distributed cooperative design and validation. In Proceedings, CafeOBJ Symposium. Japan Advanced Institute for Science and Technology, 1998. Numazu, Japan, April 1998.
Joseph Goguen and Grant Malcolm. Proof of correctness of object representation. In A. William Roscoe, editor, A Classical Mind: Essays in Honour of C.A.R. Hoare, pages 119–142. Prentice-Hall, 1994.
Joseph Goguen and Grant Malcolm. Algebraic Semantics of Imperative Programs. MIT, 1996.
Joseph Goguen and Grant Malcolm. A hidden agenda. Theoretical Computer Science, to appear 1999. Also UCSD Dept. Computer Science & Eng. Technical Report CS97-538, May 1997.
Rolf Hennicker. Context induction: a proof principle for behavioral abstractions. Formal Aspects of Computing, 3(4):326–345, 1991.
Bart Jacobs and Jan Rutten. A tutorial on (co)algebras and (co)induction. Bulletin of the European Association for Theoretical Computer Science, 62:222–259, 1997.
Michihiro Matsumoto and Kokichi Futatsugi. Test set coinduction — toward automated verification of behavioral properties —. In Proceedings of the Second InternationalWorkshop on Rewriting Logic and its Applications, Electronic Notes in Theoretical Computer Science. Elsevier Science, to appear 1998.
Peter Padawitz. Towards the one-tiered design of data types and transition systems. In WADT’97, volume 1376 of Lecture Notes in Computer Science, pages 365–380. Springer, 1998.
Horst Reichel. An approach to object semantics based on terminal co-algebras. Mathematical Structures in Computer Science, 5:129–152, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Roşu, G., Goguen, J. (2000). Hidden Congruent Deduction. In: Caferra, R., Salzer, G. (eds) Automated Deduction in Classical and Non-Classical Logics. FTP 1998. Lecture Notes in Computer Science(), vol 1761. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46508-1_17
Download citation
DOI: https://doi.org/10.1007/3-540-46508-1_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67190-9
Online ISBN: 978-3-540-46508-9
eBook Packages: Springer Book Archive