Behavioural satisfaction and equivalence in concrete model categories

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1059, Issue , 1996, Pages 241-256

  Bidoit, Michel ^a   Tarlecki, Andrzej ^b  

^a CNRS   (France)

^b UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; SEMANTICS;

BEHAVIOURAL SEMANTICS; CONCRETE CATEGORY; CONCRETE MODEL; EXPLICIT REPRESENTATION; UNIVERSAL ALGEBRA;

ALGEBRA;

EID: 84947923108     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61064-2_41     Document Type: Conference Paper

References (20)

1. Bidoit, M., Hennicker, R. Behavioural theories and the proof of behavioural properties. Theoretical Computer Science, to appear; short version: Proving behavioural theorems with standard first-order logic. Proc. Intl. Conf. Algebraic and Logic Programmming ALP'94, Springer LNCS 850, 41-58, 1994.
2. Bidoit, M., Hennicker, R. Modular correctness proofs of behavioural implementations. Technical report, 1995; short version: Proving the correctness of behavioural implementations. Proc. Intl. Conf. Algebraic Methodology and Software Technology AMAST'95, Springer LNCS 936, 152-168, 1995.
3. Bidoit, M., Hennicker, R., Wirsing, M. Behavioural and abstractor specifications. Science of Computer Programming No 2-3:25(1995); short version: Characterizing behavioural semantics and abstractor semantics. Proe. European Syrup. on Programming ESOP'94, Springer LNCS 788, 105-119, 1994.
4. Bidoit, M., Tarlecki, A. Regular algebras: a framework for observational specifications with recursive definitions. Report LIENS-95-12, Ecole Normale Supèrieure, Paris 1995.
5. Bidoit, M, Tarlecki, A. Behavioural satisfaction and equivalence in concrete model categories. Full version. Technical report, Warsaw University and Ecole Normale Sup6rieure, September 1995. Available by WWW: http://zls.laimuw,edu.pl/-tarlecki/draft s/behabs. {ps, dvi}.
6. Bidoit, M., Tarlecki, A. Behavioural satisfaction and equivalence in concrete institutions. TechnicM report, Warsaw University and Ecole Normale Supèrieure, in preparation.
7. Burstall, R, Diaconescu, R. Hiding and behaviour: an institutional approach. A Classical Mind: Esseys in Honour of C.A.R. Hoare, A.W. Roscoe, ed., 75-92, Ptentice-Hall 1994.
8. Giarratana, V., Gimona, F., Montanari, U. Observability concepts in abstract data type specification. Proc. 5th Intl. Syrup. Mathematical Foundations of Computer Science MFCS'76, Springer LNCS 45, 576-587, 1976.
9. Goguen, J.A., Burstall, R.M. Institutions: abstract model theory for computer science., I. of the ACM 39(1992), 95-146; earlier version: Introducing institutions. Proc. Logics of Programming Workshop, Springer LNCS 164, 221-256, 1984.
10. Itoare, C.A.R. Proofs of correctness of data representations. Acta Informatica 1(1972), 271-281.
11. Hofmann, M, Sannella, D. On behavioural abstraction and behavioural satisfaction in higher-order logic. Proc. 6th Intl. Conf. CAAP/FASE Theory and Practice of Software Development TAPSOFT'95, Springer LNCS 915, 247-261, 1995.
12. MacLane, S. Categories for the Working Mathematician. Springer 1971.
13. Milner, R. Fully abstract models of typed lambda-calculi. Theoretical Computer Sci. 4(1977), 1-22.
14. Nivela, P., Orejas, F. Initial behaviour semantics for algebraic specifications. Recent Trends in Data Type Specification, Selected Papers from the 5th Work. Specification of Abstract Data Types ADT'87, Springer LNCS 332, 184-207, 1988.
15. Plotkin, G.D. LCF considered as a programming language. Theoretical Computer Sci. 5(1977), 223-255.
16. Reichel, I-I. Behavioural validity of conditional equations in abstract data types. Proc. Vienna Conference on Contributions to General Algebra, 3012324, Treubner-Verlag 1985.
17. Sannella, D., Tarlecki, A. On observational equivalence and algebraic specification. J. Computer and System Sci. 34(1987), 150-178.
18. Sannella, D., Tarlecki, A. Model-theoretic foundations for formal program development: basic concepts and motivation. Report ICS PAS 792, Inst. Comp. Sci. PAS, Warsaw 1995; short version: Toward formal development of programs from algebraic specifications: model-theoretic foundations. Proc. Intl. Coll. on Automata, Languages and Programming ICALP'92, Springer LNCS 623, 656=671, 1992.
19. Schoett, O. Data abstraction and correctness of modular programming. PhD thesis, CST-42-87, Dept. of Computer Science, Univ. of Edinburgh, 1987.
20. Tarlecki, A. Quasi-varieties in abstract algebraic institutions. J. Computer and System Sciences 33(1986), 333-360.