The coalgebraic class specification language CCSL

Journal of Universal Computer Science

Volumn 7, Issue 2, 2001, Pages 175-193

  Rothe, Jan ^a   Tews, Hendrik ^a   Jacobs, Bart ^b  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

Binary methods; Coalgebra; Modal logic; Specification

Indexed keywords

EID: 0003254713     PISSN: 0958695X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (24)

1. +95] K. Bruce, L. Cardelli, G. Castagna, The Hopkins Object Group, G. T. Leavens, and B. Pierce. On binary methods. Theory and Practice of Object Systems, 1(3):221-242, 1995.
2. [Cîr99] C. Cîrstea. A coalgebraic equational approach to specifying observational structures. In B. Jacobs and J. Rutten, editors, Coalgebraic Methods in Computer Science, volume 19 of ENTCS. Elsevier, 1999. Available via http://www.elsevier.nl/locate/entcs/.
3. [Eme90] E. A. Emerson. Temporal and modal logic. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics, pages 995-1072. Elsevier Science Publishers, 1990.
4. [HHJT98] U. Hensel, M. Huisman, B. Jacobs, and H. Tews. Reasoning about classes in object-oriented languages: Logical models and tools. In Ch. Hankin, editor, European Symposium on Programming, number 1381 in LNCS, pages 105-121. Springer, 1998.
5. [HJ97] U. Hensel and B. Jacobs. Proof principles for datatypes with iterated recursion. In E. Moggi and G. Rosolini, editors, Category Theory and Computer Science, number 1290 in LNCS, pages 220-241. Springer, 1997.
6. [HJ98] C. Hermida and B. Jacobs. Structural induction and coinduction in a fibrational setting. Inf. & Comp., pages 107-152, 1998.
7. [HK99] R. Hennicker and A. Kurz, (Ω, E)-Logic: On the algebraic extension of coalgebraic specifications. In B. Jacobs and J. Rutten, editors, Coalgebraic Methods in Computer Science, volume 19 of ENTCS, pages 195-212. Elsevier, 1999. Available via http://www.elsevier.nl/locate/entcs/.
8. [Jac97] B. Jacobs. Invariants, bisimulations and the correctness of coalgebraic refinements. In M. Johnson, editor, Algebraic Methodology and Software Technology, volume 1349 of LNCS, pages 276-291. Springer, 1997.
9. [Jac99a] B. Jacobs. Categorical Logic and Type Theory. Number 141 in Studies in Logic and the Foundations of Mathematics. North Holland, Elsevier, 1999.
10. [Jac99b] B. Jacobs. The temporal logic of coalgebras via galois algebras. Technical Report CSI-R9906, Computing Science Institute, University of Nijmegen, 1999. To appear in Mathematical Structures in Computer Science.
11. [JR97] B. Jacobs and J. Rutten. A tutorial on (co)algebras and (co)induction. EATCS Bulletin, 62:222-259, 1997.
12. +98] B. Jacobs, J. van den Berg, M. Huisman, M. van Berkum, U. Hensel, and H. Tews. Reasoning about classes in Java (preliminary report). In Object-Oriented Programming, Systems, Languages and Applications (OOPSLA), pages 329-340. ACM Press, 1998.
13. [Lam00] P. Lambooij. The YAPI protocol for buffered data transfer. Techn. Rep. CSI-R9923, Comput. Sei. Inst., Univ. of Nijmegen. Available at URL http://www.cs.kun.nl/csi/reports/info/CSI-R9923.html, 2000.
14. [LBR99] G.T. Leavens, A.L. Baker, and C. Ruby. JML: A notation for detailed design. In H. Kilov and B. Rumpe, editors, Behavioral Specifications of Business and Systems, pages 175-188. Kluwer, 1999.
15. +00] X. Leroy, D. Doligez, J. Garrigue, D. Rémy, and J. Vouillon. The Objective Caml system, release 3.00, April 2000. available via http://caml.inria.fr/ocaml/.
16. [Mey99] Dion Meyer. A case study in object oriented specification and verification: The MSMIE protocol. Master's thesis, University of Nijmegen, 1999.
17. +96] S. Owre, S. Rajan, J.M. Rushby, N. Shankar, and M. Srivas. PVS: Combining specification, proof checking, and model checking. In R. Alur and T.A. Henzinger, editors, Computer Aided Verification, number 1102 in LNCS, pages 411-414. Springer, 1996.
18. [Pau94] L. C. Paulson. Isabelle: A Generic Theorem Prover. Number 828 in LNCS. Springer, 1994.
19. [Rei95] H. Reichel. An approach to object semantics based on terminal coalgebras. Mathematical Structures in Computer Science, 5:129-152, 1995.
20. [Roş00] Grigore Roşu. Hidden Logic. PhD thesis, University of California at San Diego, 2000.
21. [Rot00] J. Rothe. Modal logics for coalgebraic class specification. Master's thesis, TU Dresden, Germany, 2000. Available at URL: http://wwwtcs.inf.tudresden.de/~janr/diplom.ps.gz.
22. [Rut00] J. J. M. M. Rutten. Universal coalgebra: a theory of systems. Theoretical Computer Science, 249(1):3-80, October 2000.
23. [Tew00a] H. Tews. A case study in coalgebraic specification: Memory management in the FIASCO microkernel. Report TPG2/1/2000, SFB 358, April 2000. Available at URL http://wwwtcs.inf.tu-dresden.de/~tews/vfiasco/.
24. [Tew00b] H. Tews. Coalgebras for binary methods. In H. Reichet, editor, Coalgebraic Methods in Computer Science, volume 33 of ENTCS. Elsevier, 2000. Available via http://www.elsevier.nl/locate/entcs/.