Kai Engelhardt, Willem-Paul de Roever  Home/Search
Context
Related
| informatik.unikiel....EdR_FACS95.ps.gz unsw.edu.au/pub/user...EdR_FACS95.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: uts.edu.au/~ke/kaibib (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Our own basic intuitions are presented when introducing the method developed by Abadi and Lamport in [AL88a] for proving refinement between specifications of nondeterministic programs correct to people unacquainted with it. The example we use to illustrate this method is a nontrivial communication protocol that provides a mechanism analogous to message passing between migrating processes within a fixed finite network of nodes due to Kleinman, Moscowitz, Pnueli, and Shapiro [KMPS91]. Especially... (Update)
Similar documents (at the sentence level):
11.3%: Generalizing Abadi & Lamport's Method to Solve a Problem.. - Engelhardt, de Roever (1993) (Correct)
Active bibliography (related documents): More All
0.4: Loosely-Coupled Processes - Jayadev Misra Department (1991) (Correct)
0.4: Typed Concurrent Programming with Logic Variables - Müller, Niehren, Smolka (Correct)
0.3: Refinement in State-Based Formalisms - Lamport (1996) (Correct)
Similar documents based on text: More All
0.4: The Quest For Compositionality - de Roever, Jr. (1985) (Correct)
0.3: Composition: A Way to Make Proofs Harder - Lamport (1997) (Correct)
0.2: An Incremental Stuttering Refinement Proof of a Concurrent.. - Sumners (2000) (Correct)
BibTeX entry: (Update)
@article{ engelhardt95towards,
author = "Kai Engelhardt and Willem-Paul de Roever",
title = "Towards a Practitioners' Approach to {Abadi} and {Lamport's} Method",
journal = "Formal Aspects of Computing",
volume = "7",
number = "5",
pages = "550-575",
year = "1995",
url = "citeseer.ist.psu.edu/engelhardt97towards.html" }
Citations (may not include all citations):274 The existence of refinement mappings - Abadi, Lamport - 1988
231 Information Processing Letters (context) - Alpern, Schneider - 1985
36 Simulations between specifications of distributed systems (context) - Jonsson - 1991
36 Prespecification in data refinement (context) - Hoare, He et al. - 1987
5 Assertional data reification proofs: Survey and perspective (context) - Coenen, Zwiers et al. - 1991
5 Communication with directed logic variables (context) - Kleinmann, Moscowitz et al. - 1990
5 Communication with directed logic variables (context) - Kleinmann, Moscowitz et al. - 1991
3 Lamport's method to solve a problem posed by (context) - Engelhardt, de Roever - 1993
1 shorter version thi paper appeared as [ALb] (context) - Abadi, The et al. - 1988
1 Contact email: lamport @src (context) - Lamport, TLA et al. - 1990
Documents on the same site (http://www-staff.socs.uts.edu.au/~ke/kaibib.html): More
Modal Logics with a Hierarchy of Local Propositional.. - Engelhardt, van der.. (1999) (Correct)
Generalizing Abadi & Lamport's Method to Solve a Problem.. - Engelhardt, de Roever (1993) (Correct)
Knowledge and the Logic of Local Propositions.. - Engelhardt, van der.. (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