67 citations found. Retrieving documents...
D. Turi and G.D. Plotkin. Towards a mathematical operational semantics. In Proc. 12 th LICS Conf., pages 280-291. IEEE, Computer Society Press, 1997.

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:

First 50 documents  Next 50

Sequent Calculi for Process Verification: Hennessy-Milner Logic.. - Simpson   (Correct)

....as a technical tool, needed to establish a general completeness result (Theorem 2 of the present paper) Nevertheless, it seemed a natural notion. This was later substantiated by Turi and Plotkin in their category theoretic account of the operational and denotational semantics of GSOS systems [26, 27]. In their work, a GSOS system gives rise to a monad on the category of transition systems with functional bisimulations as morphisms. The algebras of this monad turn out to be exactly the GSOS models in the sense of De nition 3.1. The idea of using sequent calculus for process veri cation was ....

D. Turi and G.D. Plotkin. Towards a mathematical operational semantics. In Proceedings of 12th IEEE Symposium on Logic in Computer Science, pages 280{ 291, 1997.


Structural Operational Semantics - Aceto, Fokkink, Verhoef (1999)   (15 citations)  (Correct)

....ordering on programs with certain basic properties can be extended to a term model that is fully abstract with respect to it. The issue of defining abstract mathematical models for, rather than from, operational semantics has also received some attention. We refer the interested reader to, e.g. [19, 214], and the references therein, for details on this line of investigation. 107 ....

D. Turi and G. Plotkin, Towards a mathematical operational semantics, in Proceedings 12th Symposium on Logic in Computer Science, Warsaw, Poland, 1997, IEEE Computer Society Press, pp. 280-- 291.


Generalised Coinduction - Bartels (2001)   (9 citations)  (Correct)

....above can be obtained from the # coiteration schema for suitable instantiations of T and #, although we do not explain the details here. Instead, we briefly sketch how it can be used to justify specifications involving operators of a certain type. These are the operators that Turi and Plotkin [TP97] have shown to be closely related to those definable by structured transition rules in GSOS format [BIM95] Presenting these schemata as instances of our framework at the same time produces the corresponding variants of the # bisimulation proof technique. For the case of definitions via operators ....

....: C C be two functors. A natural transformation # : TF FT is called a distributive law of T over F. We will sometimes alternatively use the phrase that T distributes over F via #. A major application of the notion of a distributive law in computer science has been given by Turi and Plotkin [TP97] where the two functors were coming as a monad and a comonad respectively and additional coherence axions involving the extra structure were considered (see the work by Power and Watanabe [PW99] for a structured account of this setting) Subsequently, distributive laws were also used in situations ....

[Article contains additional citation context not shown here]

D. Turi and G.D. Plotkin. Towards a mathematical operational semantics. In Proc. 12 th LICS Conf., pages 280--291. IEEE, Computer Society Press, 1997.


GSOS for Probabilistic Transition Systems - Bartels (2002)   (2 citations)  (Correct)

....the GSOS format and introduce PGSOS, give examples and state properties. In a second, technical part we explain how the format together with its properties was derived using (co)algebraic methods: It arose from an abstract categorical account of operator specification formats by Turi and Plotkin [TP97]. Among other things, they generalize the GSOS format for LTS to the abstract GSOS format for coalgebras of an arbitrary Set functor B. Such a functor describes the type of system under consideration and a specification in abstract GSOS is a natural transformation between two functors constructed ....

....to prove p q it su#ces to find a bisimulation up to context R with R. R. Furthermore, such a solution is determined up to bisimilarity. With the development in Section 7 these properties and others will follows from corresponding facts about the abstract framework by Turi and Plotkin [TP97]. The first statement is well known. The other two may be new. The bisimulation up to context proof principle was studied by Sangiorgi [San98] who proves that it is valid for specifications in the more restrictive DeSimone format. He also gives an example for an operator specification for which ....

[Article contains additional citation context not shown here]

Daniele Turi and Gordon D. Plotkin. Towards a mathematical operational semantics. In Proc. 12 LICS Conf., pages 280--291. IEEE, Computer Society Press, 1997.


Computational Effects and Operations: An Overview - Plotkin, Power (2002)   Self-citation (Plotkin)   (Correct)

No context found.

D. Turi and G. D. Plotkin, Towards a Mathematical Operational Semantics, Proc. LICS 12 (1997) 280--291. 12


Adequacy for Algebraic Effects - Plotkin, Power (2001)   Self-citation (Plotkin)   (Correct)

No context found.

D. Turi and G. D. Plotkin, Towards a Mathematical Operational Semantics, in Proc. LICS 97, pp. 268--279, Washington: IEEE Press, 1997.


The Origins of Structural Operational Semantics - Plotkin (2003)   (1 citation)  Self-citation (Plotkin)   (Correct)

No context found.

Daniele Turi and Gordon D. Plotkin, Towards a Mathematical Operational Semantics, Proc. 12th. LICS, pp. 280-291, Los Alamitos: IEEE Computer Society Press, 1997.


Semantics of Name and Value Passing - Fiore, Turi (2001)   (7 citations)  Self-citation (Turi)   (Correct)

No context found.

D. Turi and G. Plotkin. Towards a mathematical operational semantics. In Proc. 12 LICS Conf., pages 280--291. IEEE, Computer Society Press, 1997.


From Rewrite Rules to Bisimulation - Congruences Peter Sewell   (Correct)

No context found.

D. Turi and G.D. Plotkin. Towards a mathematical operational semantics. In Proc. 12 th LICS Conf., pages 280-291. IEEE, Computer Society Press, 1997.


Unknown -   (Correct)

No context found.

D. Turi and G.D. Plotkin. Towards a mathematical operational semantics. In Proc. 12 th LICS Conf., pages 280--291. IEEE, Computer Society Press, 1997.


Unknown -   (Correct)

No context found.

D. Turi and G.D. Plotkin. Towards a mathematical operational semantics. In Proc. 12 th LICS Conf., pages 280--291. IEEE, Computer Society Press, 1997.


Modularity in Meta-Languages - Mosses   (Correct)

No context found.

D. Turi and G. D. Plotkin. Towards a mathematical operational semantics. In Proc. LICS'97. IEEE, 1997.


A Formal Calculus for Categories - Caccamo (2003)   (Correct)

No context found.

Daniele Turi and Gordon Plotkin. Towards a mathematical operational semantics. In 12th Annual IEEE Symposioum on Logic in Computer Science, pages 280--293. IEEE Computer Society, 1997.


Categorical Term Rewriting: Monads and Modularity - Lüth (1997)   (Correct)

No context found.

D. Turi and G. Plotkin. Towards a mathematical operational semantics. In Twelfth Annual Symposium on Logic in Computer Science. IEEE, Computer Society Press, 1997. Appendix A --- Bibliography 204


A Formal Calculus for Categories - Caccamo (2003)   (Correct)

No context found.

Daniele Turi and Gordon Plotkin. Towards a mathematical operational semantics. In 12th Annual IEEE Symposioum on Logic in Computer Science, pages 280--293. IEEE Computer Society, 1997.


Ordered SOS Process Languages for Branching and Eager.. - Ulidowski, Phillips (2002)   (2 citations)  (Correct)

No context found.

D. Turi and G.D. Plotkin. Towards a mathematical operational semantics. In Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science, pages 280-291. IEEE, Computer Society Press, 1997.


Recursive Coalgebras from Comonads - Capretta, Uustalu (2004)   (Correct)

No context found.

D. Turi, G. D. Plotkin, Towards a mathematical operational semantics, in: Proc. of 12th Ann. IEEE Symp. on Logic in Computer Science, LICS'97 (Warsaw, June/July 1997.


Generalised Coinduction - Bartels (2000)   (9 citations)  (Correct)

No context found.

D. Turi and G.D. Plotkin. Towards a mathematical operational semantics. In Proc. 12 th LICS Conf., pages 280--291. IEEE, Computer Society Press, 1997.


Synthesising Labelled Transitions and Operational Congruences in.. - Leifer (2002)   (7 citations)  (Correct)

No context found.

D. Turi and G. Plotkin. Towards a mathematical operational semantics. In 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29 -- July 2, 1997, pages 280--291. IEEE Press, 1997.


Relating Two Approaches to Coinductive Solution of Recursive.. - Jacobs (2004)   (Correct)

No context found.

D. Turi and G. Plotkin. Towards a mathematical operational semantics. In Logic in Computer Science, pages 280--291. IEEE, Computer Science Press, 1997. 20


Coalg_{KPF}: Towards a Coalgebraic Calculus for.. - Meng, Aichernig   (Correct)

No context found.

D. Turi and G. D. Plotkin. Towards a mathematical operational semantics. In Proceedings 12th Ann. IEEE Symp. on Logic in Computer Science, LICS'97, Warsaw, Poland, 29 June -- 2 July 1997.


Trace Semantics for Coalgebras - Jacobs (2003)   (Correct)

No context found.

D. Turi and G. Plotkin. Towards a mathematical operational semantics. In Logic in Computer Science, pages 280--291. IEEE, Computer Science Press, 1997. 16


On Generalised Coinduction and Probabilistic Specification.. - Bartels (2004)   (3 citations)  (Correct)

No context found.

Daniele Turi and Gordon D. Plotkin. Towards a mathematical operational semantics. In Proc. 12 LICS Conf., pages 280--291. IEEE, Computer Society Press, 1997.


Modular Construction of Modal Logics - Crstea, Pattinson (2004)   (Correct)

No context found.

D. Turi and G. Plotkin. Towards a mathematical operational semantics. In Proc. 12 th LICS Conference, pages 280--291. IEEE, Computer Society Press, 1999.


Generalized Coiteration Schemata - Cancila, Honsell, Lenisa (2003)   (3 citations)  (Correct)

No context found.

D.Turi, G.Plotkin. Towards a mathematical operational semantics, 12 th LICS, IEEE, Computer Science Press, 1997, 280--291.

First 50 documents  Next 50

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