J. Rothe, H. Tews, and B. Jacobs. The Coalgebraic Class Specification Language CCSL. J. Universal Computer Science, 7(2):175--193, 2001.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... verifier for the JVM language [6] PVS and Isabelle have been used for formalizing and certifying an executable bytecode verifier for a significant subset of JVM [24] for reasoning on Java programs with Hoare style logics [21] and for applying translations of co algebraic specifications [29] to programs in JavaCard [33] and C [32] In spite of this large e#ort on class based languages, relatively little or no formal work has been done on object based ones, like Self and Obliq, where there is no notion of class (though classes can be modeled by objects able to receive the message ....

J. Rothe, H. Tews, and B. Jacobs. The coalgebraic class specification language CCSL. Technical report, Dresden-Nijmegen, 2000.

.... An alternative approach to overcome the lack of constructors is the integration of the complementary algebraic techniques into coalgebraic specification [Cr00] The motivation of our work comes from the observation that the coalgebraic specification languages being currently developed, like CCSL [RTJ01], are all using predefined types to describe observations. So we hope to use a mature modeling language, integrating coalgebraic techniques inside it and providing Category theory provides a proper abstration level for interpreting the difference between algebras and coalgebras. Let T : Set ....

Jan Rothe, Hendrik Tews, and Bart Jacobs. The coalgebraic class specification language CCSL. Journal of Universal Computer Science, 7(2):175--193, 2001.

....and quotients. On the one hand, this result allows to design specifications languages admitting final semantics, since it is usually not difficult to check whether formulas are preserved under coproducts and quotients. This can be of interest for specification languages for coalgebras like CCSL [23]. CCSL allows the coalgebraic specification of classes of object oriented programs. A question in this context is to determine the largest fragment of CCSL that ensures that specified classes of objects have a final semantics (final semantics for objects was proposed by Reichel [19] and Jacobs ....

J. Rothe, H. Tews, and B. Jacobs. The coalgebraic class specification language CCSL. Journal of Universal Computer Science, 7(2):175--193, 2001.

....[9, 12] where polynomial functors are used to model class signatures. The extension is necessary because polynomial functors are not expressive enough to model binary methods. The results of this paper are the basis for the extension of the coalgebraic class specification language CCSL [24] to allow binary methods in class specifications. Other related work is that of Hennicker and Kurz. In [7] they describe algebraic extensions for coalgebraic specifications. Binary methods whose codomain equals Self can be formalized as an algebraic extension. However, the method equal from the ....

....paper and states some general results. I will not give an introduction into the field of coalgebraic specification here. For an introduction to coalgebras and coinduction see [14, 25] a coalgebraic specification COALGEBRAS FOR BINARY METHODS 5 language that is based on coalgebras is presented in [24]. For different approaches to coalgebraic specification see [4, 7] Let me start to fix some notation. As I already said in the introduction, all results in this paper apply to the category of sets and total functions, which I denote as Set. I use to denote the Cartesian product with the ....

[Article contains additional citation context not shown here]

J. Rothe, H. Tews, and B. Jacobs. The coalgebraic class specification language CCSL. Journal of Universal Computer Science, 7(2):175--193, March 2001.

No context found.

J. Rothe, H. Tews, and B. Jacobs. The coalgebraic class specification language CCSL. Journ. of Universal Comp. Sci., 7(2), 2001.

No context found.

J. Rothe, H. Tews, and B. Jacobs. The coalgebraic class specification language CCSL. Journ. of Universal Comp. Sci., 7(2), 2001.

....in theoretical computer science, see [Rut00, Gum99] for well written and extensive introductions. Among other applications, coalgebras provide semantics for classes in object oriented programming and specification [Rei95, Jac96] This idea is exploited for coalgebraic specification, e.g. in ccsl [RTJ01] but also in the work of Corina Crstea [Cr02] Coalgebras are usually seen as generalisations of transition systems and one of the greatest advantages of this generalisation is that it delivers standard notions like bisimulation, observational equality and modal operators for free . However, ....

J. Rothe, H. Tews, and B. Jacobs. The coalgebraic class specification language CCSL. Journal of Universal Computer Science, 7(2):175--193, 2001.

....approach to object orientation is that it directly addresses terms like behaviour, behavioural indistinguishability (bisimulation) and information hiding. It further supports coinduction as a definition and proof principle and modal logics via the notion of invariants, see for instance [7, 12]. 1 However, the use of coalgebras for endofunctors to model classes (as suggested in [11] does not cover binary methods. The problem is that endofunctors are not sufficient to model class signatures with binary methods. The easiest solution to solve this problem is to treat binary methods as ....

....0 Buf from Example 3.2. So if one models environments of chained buffers with association lists then a greatest bisimulation equivalence does exist for all models. The greatest bisimulation equivalence can be used, for instance, to define behavioural equality in a specification language like CCSL [12]. Example 4.7 This example shows a coalgebra for an extended polynomial functor for which there is an infinitely ascending chain of bisimulation equivalences without an upper bound. So the preceding theorem cannot be generalised without making further assumptions. Consider the extended polynomial ....

J. Rothe, H. Tews, and B. Jacobs. The coalgebraic class specification language CCSL. Journal of Universal Computer Science, 7(2):175--193, March 2001.

No context found.

J. Rothe, H. Tews, and B. Jacobs. The Coalgebraic Class Specification Language CCSL. J. Universal Computer Science, 7(2):175--193, 2001.

No context found.

J. Rothe, B. Jacobs, and H. Tews. The coalgebraic class specification language CCSL. Journal of Universal Computer Science, 7:175--193, 2001.

No context found.

J. Rothe, H. Tews, and B. Jacobs. The coalgebraic class specification language CCSL. Technical report, Dresden-Nijmegen, 2000.

No context found.

J. Rothe, H. Tews, and B. Jacobs. The coalgebraic class specification language CCSL. Journal of Universal Computer Science, 7(2):175--193, 2001.

No context found.

J. Rothe, H. Tews, and B. Jacobs. The coalgebraic class specification language CCSL. Journal of Universal Computer Science, 7(2):175--193, 2001.

No context found.

J. Rothe, H. Tews, and B. Jacobs. The coalgebraic class specification language CCSL. Technical report, Dresden-Nijmegen, 2000.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC