Observational logic, constructor-based logic, and their duality

Theoretical Computer Science

Volumn 298, Issue 3, 2003, Pages 471-510

  Bidoit, Michel ^a,d   Hennicker, Rolf ^b   Kurz, Alexander ^c  

^a CNRS   (France)

^b UNIVERSITY OF MUNICH   (Germany)

^c CWI   (Netherlands)

^d CNRS   (France)

Author keywords

Algebraic specification; Duality; Institution; Observability; Reachability

Indexed keywords

ALGEBRA; FORMAL LOGIC; OBSERVABILITY; SEMANTICS;

DATATYPE CONSTRUCTORS; REACHABILITY;

SOFTWARE ENGINEERING;

EID: 0037432693     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00865-4     Document Type: Conference Paper

References (40)

1. Adámek J., Herrlich H., Strecker G. Abstract and Concrete Categories. 1990;Wiley, New York.
2. Arbib M.A., Manes E.G. Foundations of system theory. decomposable systems Automatica. 10:1974;285-302.
3. Arbib M.A., Manes E.G. Adjoint machines, state-behaviour machines, and duality. J. Pure Appl. Algebra. 6:1975;313-344.
4. Astesiano E., Bidoit M., Kirchner H., Krieg-Brückner B., Mosses P.D., Sannella D., Tarlecki A. CASL. The Common Algebraic Specification Language Theoret. Comput. Sci. 286(2):2002;153-196.
5. Astesiano E., Kreowski H.-J., Krieg-Brückner B. Algebraic Foundations of Systems Specification. 1999;Springer, Berlin.
6. Bidoit M., Cengarle M.V., Hennicker R. Proof systems for structured specifications and their refinements. Astesiano E., Kreowski H.-J., Krieg-Brückner B. Algebraic Foundations of Systems Specification. 1999;385-433 Springer, Berlin.
7. M. Bidoit, R. Hennicker, Observer complete definitions are behaviourally coherent, in: Proc. OBJ/CafeOBJ/Maude Workshop at Formal Methods '99, THETA, 1999, pp. 83-94.
8. Bidoit M., Hennicker R. On the integration of observability and reachability concepts. Nielsen M., Engberg U. Proc. 5th Internat. Conf. Foundations of Software Science and Computation Structures (FOSSACS'02), Grenoble, France. Lecture Notes in Computer Science. Vol. 2303:2002;21-36 Springer, Berlin.
9. Bidoit M., Hennicker R., Kurz A. On the duality between observability and reachability. Honsell F., Miculan M. Proc. 4th Internat. Conf. Foundations of Software Science and Computation Structures (FOSSACS'01), Genova, Italy. Lecture Notes in Computer Science. Vol. 2030:2001;72-87 Springer, Berlin.
10. Bidoit M., Hennicker R., Wirsing M. Behavioural and abstractor specifications. Sci. Comput. Program. 25(2-3):1995;149-186.
11. Borceux F. Handbook of Categorical Algebra. 1994;Cambridge University Press, Cambridge.
12. Chang C.C., Keisler H.J. Model Theory. 3rd Edition:1990;North-Holland, Amsterdam.
13. Ĉrstea C. Coalgebraic semantics for hidden algebra: parameterized objects and inheritance. Parisi-Presicce F. Recent Trends in Algebraic Development Techniques, WADT'97. Lecture Notes in Computer Science. Vol. 1376:1998;174-189 Springer, Berlin.
14. Goguen J., Burstall R. Institutions. abstract model theory for specification and programming J. ACM. 39(1):1992;95-146.
15. Goguen J., Malcolm G. A hidden agenda. Theoret. Comput. Sci. 245(1):2000;55-101.
16. Goguen J., Roşu G. Hiding more of hidden algebra. Wing J.M., Woodcock J., Davies J. Proc. Formal Methods (FM'99). Lecture Notes in Computer Science. Vol. 1709:1999;1704-1719 Springer, Berlin.
17. R. Hennicker, M. Bidoit, Observational logic (long version), Technical Report LSV-98-6, LSV, Ecole Normale Supérieure de Cachan, June 1998. Available at www.lsv.ens-cachan.fr/Publis/RAPPORTSbackslash_LSV/rr-lsv-1998-6.rr.ps.
18. Hennicker R., Bidoit M. Observational logic. Haeberer Armando Proc. 7th Internat. Conf. Algebraic Methodology and Software Technology (AMAST'98), Amazonia, Brazil. Lecture Notes in Computer Science. Vol. 1548:1999;263-277 Springer, Berlin.
19. Hennicker R., Kurz A. (Ω,Ξ)-Logic on the algebraic extension of coalgebraic specifications Jacobs B., Rutten J. Proc. Coalgebraic Methods in Computer Science (CMCS'99). Electronic Notes in Theoretical Computer Science. Vol. 19:1999;195-211 Springer, Berlin.
20. Hennicker R., Wirsing M. Behavioural specifications. Schwichtenberg H. Proof and Computation, Internat. Summer School Marktoberdorf 1993. NATO ASI Series F. Vol. 139:1995;193-230 Springer, Berlin.
21. Hennicker R., Wirsing M., Bidoit M. Proof systems for structured specifications with observability operators. Theoret. Comput. Sci. 173(2):1997;393-443.
22. Hoare C.A.R. Proofs of correctness of data representations. Acta Inform. 1:1972;271-281.
23. Hofmann M., Sannella D. On behavioural abstraction and behavioural satisfaction in higher-order logic. Mosses P.D., Nielsen M., Schwartzbach M.I. Proc. 6th Internat. Joint Conf. Theory and Practice of Software Development (TAPSOFT'95), Aarhus, Denmark. Lecture Notes in Computer Science. vol. 915:1995;247-261 Springer, Berlin.
24. Jacobs B., Rutten J. A tutorial on (Co)Algebras and (Co)Induction. EATCS Bulletin. 62:1997;222-259.
25. Kalman R.E., Falb P.L., Arbib M.A. Topics in Mathematical System Theory. 1969;McGraw-Hill, New York.
26. Keisler H.J. Model Theory for Infinitary Logic. 1971;North-Holland, Amsterdam.
27. A. Kurz, Logics for coalgebras and applications to computer science, Ph.D. Thesis, Ludwig-Maximilians-Universität München, 2000. Available at http://www.informatik.uni-muenchen.de/̃kurz.
28. Kurz A., Hennicker R. On institutions for modular coalgebraic specifications. Theoret. Comput. Sci. 280(1-2):2002;69-103.
29. A. Kurz, D. Pattinson, Coalgebras and modal logics for parameterised endofunctors, Tech. Report SEN-R0040, CWI, 2000. Available at http://www.cwi.nl/̃kurz.
30. Mac Lane S. Category Theory for the Working Mathematician. 1971;Springer, Berlin.
31. Loeckx J., Ehrich H.-D., Wolf M. Specification of Abstract Data Types. 1996;Wiley and Teubner, New York.
32. Padawitz P. Swinging. types=functions + relations + transition systems Theoret. Comput. Sci. 243(1-2):2000;93-165.
33. Poll E., Zwanenburg J. A logic for abstract data types as existential types. Girard J.-Y. Proc. 4th Internat. Conf. Typed Lambda Calculi and Applications (TLCA'99). Lecture Notes in Computer Science. vol. 1581:1999;310-324 Springer, Berlin.
34. Reichel H. Initial Computability, Algebraic Specifications, and Partial Algebras. 1987;Clarendon Press, Oxford.
35. G. Roşu, Hidden logic, Ph.D. Thesis, University of California at San Diego, 2000.
36. Sannella D., Tarlecki A. On observational equivalence and algebraic specification. J. Comput. System Sci. 34:1987;150-178.
37. Sannella D., Tarlecki A. Specifications in an arbitrary institution. Inform. and Comput. 76:1988;165-210.
38. Tarlecki A. On the existence of free models in abstract algebraic institutions. Theoret. Comput. Sci. 37:1986;269-304.
39. Tarlecki A. Towards heterogeneous specifications. Gabbay D., van Rijke M. Proc. Internat. Conf. Frontiers of Combining Systems (FroCos'98), Amsterdam. 2000;337-360 Research Studies Press.
40. Wirsing M., Broy M. A modular framework for specification and information. Diaz J., Orejas F. Proc. TAPSOFT'89. Lecture Notes in Computer Science. Vol. 351:1989;42-73 Springer, Berlin.