Behavioural theories and the proof of behavioural properties

Theoretical Computer Science

Volumn 165, Issue 1, 1996, Pages 3-55

  Bidoit, Michel ^a   Hennicker, Rolf ^b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATION THEORY; COMPUTER SOFTWARE; FORMAL LOGIC; SOFTWARE ENGINEERING;

AXIOMATIZATION; BEHAVIOURAL EQUALITY; BEHAVIOURAL THEORIES; CONGRUENCE RELATIONS; EQUALITY PREDICATE SYMBOL; FIRST ORDER THEORIES;

THEOREM PROVING;

EID: 0030247056     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(96)00039-4     Document Type: Article

References (31)

1. B. Bauer and R. Hennicker, Proving the correctness of algebraic implementations by the ISAR system, in: Proc. DISCO'93, Lecture Notes in Computer Science, Vol. 722 (Springer, New York, 1993) 2-16.
2. G. Bernot and M. Bidoit, Proving the correctness of algebraically specified software: modularity and observability issues, in: Proc. AMAST'91, Springer Workshops in Computing Series (Springer, Berlin, 1992). 216-242.
3. M. Bidoit and R. Hennicker, How to prove observational theorems with LP, in: Proc. First Internat. Workshop on Larch, Springer Workshops in Computing Series (Springer, Berlin, 1993) 18-35.
4. M. Bidoit and R. Hennicker, Proving behavioural theorems with standard first-order logic, in: Proc. ALP'94, Lecture Notes in Computer Science, Vol. 850 (Springer, New York, 1994) 41-58.
5. M. Bidoit and R. Hennicker, Behavioural theories, in: Recent Trends in Data Type Specification, Lecture Notes in Computer Science, Vol. 906 (Springer, New York, 1995) 153-169.
6. M. Bidoit and R. Hennicker, Modular correctness proofs of behavioural implementations, Available by WWW: http://www.pst.informatik.uni-muenchen.de/∼hennicke/, 1995; A short version appeared as: Proving the correctness of behavioural implementations, in: Proc. of AM AST'95, Lecture Notes in Computer Science, Vol.936 (Springer, New York, 1995) 152-168.
7. M. Bidoit and R. Hennicker, Modular correctness proofs of behavioural implementations, Available by WWW: http://www.pst.informatik.uni-muenchen.de/∼hennicke/, 1995; A short version appeared as: Proving the correctness of behavioural implementations, in: Proc. of AM AST'95, Lecture Notes in Computer Science, Vol.936 (Springer, New York, 1995) 152-168.
8. M. Bidoit, R. Hennicker and M. Wirsing, Behavioural and abstractor specifications, Sci. Comput. Programming 25(2-3) (1995); A short version appeared as: Characterizing behavioural semantics and abstractor semantics, in: Proc. of ESOP'94, Lecture Notes in Computer Science, Vol. 788 (Springer, New York, 1994) 105-119.
9. M. Bidoit, R. Hennicker and M. Wirsing, Behavioural and abstractor specifications, Sci. Comput. Programming 25(2-3) (1995); A short version appeared as: Characterizing behavioural semantics and abstractor semantics, in: Proc. of ESOP'94, Lecture Notes in Computer Science, Vol. 788 (Springer, New York, 1994) 105-119.
10. M. Bidoit and A. Tarlecki, Behavioural satisfaction and equivalence in concrete model categories, in: Proc. CAAP'96, Lecture Notes in Computer Science, Vol. 1059 (Springer, New York, 1996) 241-256
11. H. Ehrig and B. Mahr, Fundamentals of Algebraic Specification 1. Equations and initial semantics, EATCS Monographs on Theoretical Computer Science, Vol. 6 (Springer, Berlin, 1985).
12. H. Ehrig and B. Mahr, Fundamentals of Algebraic Specification 2, EATCS Monographs on Theoretical Computer Science, Vol. 21 (Springer, Berlin 1990).
13. S. Garland and J. Guttag, An overview of LP, the Larch Prover, in: Proc. Third internat. Conf. on Rewriting Techniques and Applications, Lecture Notes in Computer Science, Vol. 355 (Springer, Berlin, 1989) 137-151.
14. J. Goguen and J. Meseguer, Universal realization, persistent interconnection and implementation of abstract modules, in: Proc. 9th ICALP, Lecture Notes in Computer Science, Vol. 140 (Springer, New York, 1982) 265-281.
15. R. Hennicker, Context induction: a proof principle for behavioural abstractions and algebraic implementations, Formal Aspects of Computing 3(4) (1991) 326-345.
16. R. Hennicker, M. Wirsing and M. Bidoit, Proof systems for structured specifications with observability operators, Theoret. Comput. Sci., to appear.
17. M. Hofmann and D. Sannella, On behavioural abstraction and behavioural satisfaction in higher-order logic, in: Proc. TAPSOFT'95, Lecture Notes in Computer Science, Vol. 915 (Springer, New York 1995) 247-261.
18. G. Kreisel and J.L. Krivine. Eléments de Logique Mathématique (Dunod, Paris, 1967).
19. G. Malcolm and J. Goguen, Proving correctness of refinement and implementation, Technical Monograph PRG-114, Oxford University Computing Laboratory, 1994.
20. R. Milner, Fully abstract models of typed λ-calculi, Theoret. Comput. Sci. 4 (1977) 1-22.
21. P. Nivela and F. Orejas, Initial behaviour semantics for algebraic specification, in: Recent Trends in Data Type Specification, Lecture Notes in Computer Science, Vol. 332 (Springer, New York, 1988) 184-207.
22. F. Orejas, M. Navarro and A. Sànches, Implementation and behavioural equivalence: A survey, in: Recent Trends in Data Type Specification, Lecture Notes in Computer Science, Vol. 655 (Springer, New York, 1993) 93-125.
23. H. Reichel, Initial restrictions of behaviour, in: Proc. IFIP Working Conference, The Role of Abstract Models in Information Processing, 1985.
24. H. Reichel, Initial computability, algebraic specifications, and partial algebras, International Series of Monographs in Computer Science 2 (Clarendon Press, Oxford, 1987).
25. D. Sannella and A. Tarlecki, On observational equivalence and algebraic specification, J. Comput. System Sci. 34 (1987) 150-178.
26. D. Sannella and A. Tarlecki, Toward formal development of programs from algebraic specification: implementation revisited, Acta inform. 25 (1988) 233-281.
27. D. Sannella and M. Wirsing, A kernel language for algebraic specifications and implementation, in: Proc. FCT'83, Lecture Notes in Computer Science, Vol. 158 (Springer, New York, 1983) 413-427.
28. O. Schoett, Behavioural correctness of data representation, Sci. Comput. Programming 14 (1990) 43-57.
29. J.W. Thatcher, E.G. Wagner and J.B. Wright, Data type specification: parameterization and the power of specification techniques, ACM Trans. on Programming Languages and Systems, 4 (1982) 711-732.
30. M. Wirsing, Algebraic specification, Handbook of Theoretical Computer Science (Elsevier, Amsterdam, 1990).
31. M. Wirsing, Structured Specifications: Syntax, Semantics and Proof Calculus. Logic and Algebra of Specification, International Summer School Marktoberdorf, 1991 (Springer, Berlin, 1993).