See this document in CiteSeerX!

Gamma and the Logic of Transition Traces (1997)  (Make Corrections)  (1 citation)
S. J. Gay, C. L. Hankin



  Home/Search   Context   Related

 
View or download:
dcs.gla.ac.uk/~simon/publ...tfm96.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  dcs.gla.ac.uk/~simon/publicati... (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Gamma is a language of conditional multiset rewrites, which can be seen either as a parallel programming language or as a specification language for parallel algorithms. Taking the latter view, we are interested in program refinement and formal techniques for reasoning about it. In the present paper we apply Abramsky's framework of domain theory in logical form, to systematically develop a program logic for Gamma from a denotational semantics. Our semantics is a domaintheoretic... (Update)

Context of citations to this paper:   More

.... result was two program logics: one based on a resumption semantics for Gamma [12] and the other based on a transition trace semantics [13]. The connection with types for concurrency is via the view of types as speci cations or program properties, which is a theme of domain...

Cited by:   More
Case for Support: Novel type systems for concurrent programming.. - Gay   (Correct)

Similar documents (at the sentence level):
24.6%:   A Program Logic For Gamma - Gay, Hankin   (Correct)

Active bibliography (related documents):   More   All
0.9:   Gamma And The Chemical Reaction Model: Ten Years After - Banâtre, Métayer (1996)   (Correct)
0.3:   Towards an infinitary logic of domains: Abramsky logic for.. - Bonsangue, Kok   (Correct)
0.3:   Infinitary Domain Logic for Finitary Transition Systems - Bonsangue, Kok (1997)   (Correct)

Similar documents based on text:   More   All
0.2:   Types for Correct Communication in Client-Server Systems - Gay, Hole (2000)   (Correct)
0.1:   Static Analysis of Routing Protocols for Ad-Hoc Networks - Nanz, Hankin (2004)   (Correct)
0.1:   A Domain-Theoretic Banach-Alaoglu Theorem - Gordon Plotkin School   (Correct)

BibTeX entry:   (Update)

S. J. Gay and C. L. Hankin. Gamma and the logic of transition traces. In A. Edalat, S. Jourdan, and G. McCusker, editors, Advances in Theory and Formal Methods of Computing. Imperial College Press, 1997. http://citeseer.ist.psu.edu/gay97gamma.html   More

@misc{ gay97gamma,
  author = "S. Gay and C. Hankin",
  title = "Gamma and the logic of transition traces",
  text = "S. J. Gay and C. L. Hankin. Gamma and the logic of transition traces. In
    A. Edalat, S. Jourdan, and G. McCusker, editors, Advances in Theory and
    Formal Methods of Computing. Imperial College Press, 1997.",
  year = "1997",
  url = "citeseer.ist.psu.edu/gay97gamma.html" }
Citations (may not include all citations):
84   A domain equation for bisimulation (context) - Abramsky - 1991
77   Full abstraction for a simple parallel programming language (context) - Hennessy, Plotkin - 1979
75   Annals of Pure and Applied Logic (context) - Abramsky, in - 1991
59   The GAMMA model and its discipline of programming (context) - Banatre, Le M'etayer - 1990
41   Strictness analysis in logical form - Jensen - 1991
38   Parallel machines for multiset transformation and their prog.. (context) - Banatre, Coutant et al. - 1988
35   Domain Theory and the Logic of Observable Properties (context) - Abramsky - 1987
32   Full abstraction for a shared variable parallel language - Brookes - 1993
32   A calculus of Gamma programs (context) - Hankin, Le M'etayer et al. - 1992
10   Laws of parallel synchronised termination - Sands - 1993
6   Reasoning about Gamma programs (context) - Errington, Hankin et al. - 1993
6   A program logic for Gamma - Gay, Hankin - 1996
6   Implementation of Gamma on the connection machine (context) - Creveuil - 1991
2   The coordination language Gamma: Semantics and transformatio.. (context) - Hankin, Le M'etayer et al. - 1995
2   chromatic typing and vegetation (context) - McEvoy - 1994
1   Implementing bags on a shared memory MIMD machine - Kuchen, Gladitz - 1992

Documents on the same site (http://www.dcs.gla.ac.uk/~simon/publications/):   More
A Program Logic For Gamma - Gay, Hankin   (Correct)
Types and Subtypes for Client-Server Interactions - Gay, Hole (1999)   (Correct)
A Type-theoretic Approach to Deadlock-freedom of Asynchronous .. - Samson Abramsky (1997)   (Correct)

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