Modular correctness proofs of behavioural implementations

Acta Informatica

Volumn 35, Issue 11, 1998, Pages 951-1005

  Bidoit, Michel ^a   Hennicker, Rolf ^b  

^a CNRS   (France)

^b UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032339472     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002360050149     Document Type: Article

References (30)

1. Bernot G, Bidoit M: Proving the correctness of algebraically specified software: modularity and observability issues. Proc. AMAST'91, pp 216-242, Workshops in Computing, Berlin Heidelberg New York: Springer 1992
2. Bidoit M, Hennicker R: Proving the correctness of behavioural implementations. In Proc. AMAST'95, 4th International Conference on Algebraic Methodology and Software Technology, Lecture Notes in Computer Science 936, pp 152-168, Berlin Heidelberg NewYork: Springer 1995
3. Bidoit M, Hennicker R: Behavioural theories and the proof of behavioural properties. Theoretical Computer Science 175:3-55 (1996)
4. Bidoit M, Hennicker R, Wirsing M: Behavioural and abstractor specifications. Science of Computer Programming 25:149-186 (1995)
5. Ehrig H, Kreowski HJ, Mahr B, Padawitz P: Algebraic implementation of abstract data types. Theor Comput Sci 20:209-263 (1982)
6. Ehrig H, Mahr B: Fundamentals of algebraic specification 1, EATCS Monographs on Theoretical Computer Science 6, Berlin Heidelberg NewYork: Springer 1985
7. Goguen JA, Burstall RM: Introducing institutions. In Proc. Logics of Programming Workshop, Carnegie-Mellon, Lecture Notes in Computer Science 164, pp 221-256, Berlin Heidelberg NewYork: Springer 1984
8. Guttag J, Horning J: Larch: Languages and Tools for Formal Specification. Texts and Monographs in Computer Science, Berlin Heidelberg NewYork: Springer 1993
9. Goguen JA, Meseguer J: Universal realization, persistent interconnection and implementation of abstract modules. In Proc. ICALP'82, Lecture Notes in Computer Science 140, pp 265-281, Berlin Heidelberg New York: Springer 1982
10. Hoare CAR: Proofs of correctness of data representations. Acta Informatica 1:271-281 (1972)
11. Hennicker R: Context induction: a proof principle for behavioural abstractions and algebraic implementations. Formal Aspects of Computing 3(4):326-345 (1991)
12. Hennicker R: Structured specifications with behavioural operators: semantics, proof methods and applications. Habilitation thesis, Institut für Informatik, Ludwig-Maximilians-Universität München, 1997
13. Hennicker R, Schmitz C: Object-oriented implementation of abstract data type specifications. In: Wirsing M, Nivat M (eds.): Proc. AMAST '96, 5th International Conference on Algebraic Methodology and Software Technology, Lecture Notes in Computer Science 1101, pp 163-179, Berlin Heidelberg NewYork: Springer 1996
14. Hennicker R, Wirsing M, Bidoit M: Proof systems for structured specifications with observability operators. Theoretical Computer Science 173:393-443 (1997)
15. Jacobs B: Invariants, bisimulations and the correctenss of coalgebraic refinements. Technical Report CSI-R9704, Computing Science Institute Nijmegen, 1997
16. Keisler HJ: Model theory for infinitary logic. Amsterdam: North-Holland, 1971
17. Kreisel G, Krivine JL: Eléments de Logique Mathématique. Dunod (Paris), 1967
18. Loeckx J, Ehrich H-D, Wolf M: Specification of Abstract Data Types. Wiley-Teubner, 1996
19. Malcolm G, Goguen JA: Proving correctness of refinement and implementation. Technical Monograph PRG-114, Oxford University Computing Laboratory, 1994
20. Maibaum TSE, Veloso PAS, Sadler MR: A theory of abstract data types for program development: Bridging the gap? In: Ehrig H, Floyd C, Nivat M, Thatcher J (eds.): Proc. TAPSOFT '85, Joint Conference on Theory and Practice of Software Development, Lecture Notes in Computer Science 186, pp 214-230, Berlin Heidelberg NewYork: Springer 1985
21. Nivela P, Orejas F: Initial behaviour semantics for algebraic specifications. In: Sannella DT, Tarlecki A (eds.): Recent Trends in Data Type Specification, Lecture Notes in Computer Science 332, pp 184-207, Berlin Heidelberg NewYork: Springer 1988
22. Padawitz P: Swinging data types. URL: http://ls5-www.informatik.uni-dortmund.de/user/peter/
23. Reichel H: Initial computability, algebraic specifications, and partial algebras. International Series of Monographs in Computer Science No. 2, Oxford: Clarendon Press 1987
24. Schoett O: Data abstraction and correctness of modular programming. Ph.D. thesis, CST-42-87, University of Edinburgh, 1987
25. Schoett O: Two impossibility theorems on behavioural specification of abstract data types. Acta Informatica 29:595-621 (1992)
26. Sannella DT, Tarlecki A: On observational equivalence and algebraic specification. J Comput Syst Sci 34:150-178 (1987)
27. Sannella DT, Tarlecki A: Toward formal development of programs from algebraic specifications: implementation revisited. Acta Informatica 25:233-281 (1988)
28. Wirsing M: Structured algebraic specifications: a kernel language. Theor Comput Sci 42:123-249 (1986)
29. Wirsing M: Algebraic specification. In: J van Leeuwen (ed.): Handbook of Theoretical Computer Science, pp 675-788, Amsterdam: Elsevier 1990
30. Wolter U: The power of behavioural validity. Preprint 1-87, TU Magdeburg, Sektion Mathematik, 1987