See this document in CiteSeerX!

Metric Predicate Transformers: Towards a Notion of Refinement for Concurrency (1994)  (Make Corrections)  (1 citation)
Marcello M. Bonsangue, Erik de Vink, Joost N. Kok
International Conference on Concurrency Theory



  Home/Search   Context   Related

 
View or download:
cs.vu.nl/pub/bonsang...concurrency.ps.Z
cs.vu.nl/pub/papers/theor...IR371.ps.Z
wi.leidenuniv.nl/home/...concur95.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  fermivista.math.ju...ftp.cs.vu.nl (more)
From:  wi.leidenuniv.nl/h...publications
(Enter author homepages)

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

Abstract: For two parallel languages with recursion a compositional weakest precondition semantics is given using two new metric resumption domains. The underlying domains are characterized by domain equations involving functors that deliver `observable' and `safety' predicate transformers. Further a refinement relation is defined for this domains and illustrated by rules dealing with concurrent composition. It turns out, by extending the classical duality of predicate vs. state transformers, that the... (Update)

Context of citations to this paper:   More

...The technical details of their definitions are suppressed here. The interested reader though is referred to the technical report [BKV94]. Pivotal is the formulation of a so called backward distance, which makes it possible to deal with predicate transformers in a...

Cited by:   More
Metric Predicate Transformers: Towards a Notion of.. - Marcello Bonsangue (1994)   (Correct)

Active bibliography (related documents):   More   All
0.5:   The Weakest Precondition Calculus: Recursion and Duality - Bonsangue, Kok (1994)   (Correct)
0.5:   Predicate Transformer Semantics of a Higher Order Imperative.. - Naumann (1998)   (Correct)
0.5:   Semantics of Exceptions - Leino, Snepscheut (1994)   (Correct)

System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text:   More   All
0.6:   Isomorphisms between Predicate and State Transformers - Bonsangue, Kok (1993)   (Correct)
0.6:   Relating Multifunctions and Predicate Transformers through.. - Bonsangue, Kok (1994)   (Correct)
0.5:   Semantics, Orderings and Recursion in the Weakest.. - Bonsangue, Kok   (Correct)

BibTeX entry:   (Update)

M.M. Bonsangue, J.N. Kok, and E.P. de Vink. Metric Predicate Transformers: Towards a Notion of Refinement for Concurrent Programs. Report IR-- 371, Vrije Universiteit Amsterdam, 1994. Available through anonymous ftp from ftp.cs.vu.nl as pub/papers/theory/IR-371.ps.Z. http://citeseer.ist.psu.edu/article/bonsangue94metric.html   More

@inproceedings{ bonsangue95metric,
    author = "Marcello M. Bonsangue and Joost N. Kok and Erik P. de Vink",
    title = "Metric Predicate Transformers: Towards a Notion of Refinement for Concurrency",
    booktitle = "International Conference on Concurrency Theory",
    pages = "363-377",
    year = "1995",
    url = "citeseer.ist.psu.edu/article/bonsangue94metric.html" }
Citations (may not include all citations):
652   A Discipline of Programming (context) - Dijkstra - 1976
502   Concurrency and Automata on Infinite Sequences (context) - Park - 1981
141   Predicate Calculus and Program Semantics (context) - Dijkstra, Scholten - 1990
135   A Theoretical Basis for Stepwise Refinement and the Programm.. (context) - Morris - 1987
99   Correctness Preserving Program Refinements: Proof Theory and.. (context) - Back - 1980
95   Forward and Backward Simulation - part I: Untimed Systems - Lynch, Vaandrager - 1993
83   Power Domains and Predicate Transformers: A Topological View (context) - Smyth - 1983
77   Distributed Cooperation with Action Systems (context) - Back, Kurki-Suonio - 1988
74   Allyn and Bacon (context) - Dugundji - 1966
46   the Foundations of Final Semantics: Non-Standard Sets (context) - Rutten, Turi - 1993
42   part I: Sequential Nondeterministic Programs (context) - Back, von Wright - 1990
41   Data Refinement of Predicate Transformers (context) - Gardiner, Morgan - 1991
40   Solving Reflexive Domain Equations in a Category of Complete.. (context) - America, Rutten - 1989
38   Information and Control (context) - de Bakker, Zucker et al. - 1982
37   An Introduction to Assertional Reasoning for Concurrent Syst.. (context) - Shankar - 1993
35   Domain Theory and the Logic of Observable Properties (context) - Abramsky - 1987
35   win and sin: Predicate Transformers for Concurrency - Lamport - 1990
25   On Correct Refinement of Programs (context) - Back - 1981
25   volume 5 of Cambridge Tracts in Theoretical Computer Science (context) - Vickers, Logic - 1989
24   Sur les Operations dans les Ensembles Abstraits et leurs App.. (context) - Banach - 1922
23   Induction Rules and Termination Proofs (context) - Hitchcock, Park - 1972
22   Control Flow Semantics (context) - de Bakker, de Vink - 1995
22   Processes as Terms: Non-Well-Founded Models for Bisimulation (context) - Rutten - 1992
21   A Lattice-theoretical Basis for Program Refinement (context) - von Wright - 1990
21   volume 6 of Sigma Series in Pure Mathematics (context) - Engelking - 1989
21   Contractions in Comparing Concurrency Semantics (context) - Kok, Rutten - 1990
20   Action Systems with Synchronous Communication - Back, Sere - 1994
18   Dijkstra's Predicate Transformer and Smyth's Powerdomain (context) - Plotkin - 1979
16   A Foundation of Parallel Program Design (context) - Chandy, Misra - 1988
14   Superposition Refinement of Parallel Algorithms (context) - Back, Sere - 1992
10   Stepwise Derivation of Parallel Algorithms (context) - Sere - 1990
9   The Weakest Precondition Calculus: Recursion and Duality - Bonsangue, Kok - 1994
7   The processes of De Bakker and Zucker represent bisimulation.. (context) - van Glabbek, Rutten - 1989
7   Duality beyond Sober Spaces: Topological Spaces and Observat.. - Bonsangue, Jacobs et al. - 1995
7   Topological Models in Comparative Semantics (context) - van Breugel - 1994
6   Predicate Transformer Semantics of General Recursion (context) - Hesselink - 1989
5   Comparative semantics for Prolog with cut (context) - de Vink - 1989
4   Weakest Precondition Semantics for Time and Concurrency (context) - Scholefield, Zedan - 1992
3   Deadlock and fairness in morphisms of transition systems (context) - Hesselink - 1988
3   Relating State Transformation Semantics and Predicate Transf.. (context) - van Breugel - 1993
2   Parallel Program Design and Generalized Weakest Precondition (context) - Lukkien - 1991
2   Operational Semantics and Generalized Weakest Precondition (context) - Lukkien - 1994
2   Towards Compositional Predicate Transformer Semantics for Co.. (context) - Best - 1989
1   Sur une Methode de Metrisation Complete des Certain Espaces .. (context) - Kuratowski - 1956
1   Fully Abstract Models for Nonuniform Concurrent Languages (context) - de Bakker, Horita et al. - 1990
1   Department of Mathematics and Computing Science (context) - Hesselink, Calculus et al. - 1988
1   Chelsea Publishing Company (context) - Hahn, volume - 1948

Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cs.vu.nl.html):   More
Models for Asynchronous Message Handling - Langendoen, Bhoedjang, Bal (1997)   (Correct)
Orca: a Portable User-Level Shared Object System - Bal, BHOEDJANG, HOFMAN.. (1996)   (Correct)
Object Distribution in Orca using Compile-Time and Run-Time.. - Bal, Kaashoek (1993)   (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