Nancy Lynch, Frits Vaandrager  Home/Search
Context Related
| mit.edu/publicatio...LCSTM486.b.ps.gz mit.edu/tds/papers/Lynch/IC95.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: mit.edu/publications/pubs/ps/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A unified, comprehensive presentation of simulation techniques for verification of concurrent systems is given, in terms of a simple untimed automaton model. In particular, (1) refinements, (2) forward and backward simulations, (3) hybrid forward-backward and backward-forward simulations, and (4) history and prophecy relations are defined. (Update)
Cited by: More
On Modular Pluggable Analyses Using Set Interfaces - Lam, Kuncak, Rinard (2003) (Correct)
Verifying Distributed Algorithms via Dynamic Analysis and.. - Win, Ernst (2002) (Correct)
Safe Compositional Specification of Networking Systems - Azer Bestavros Adam (2004) (Correct)
Similar documents (at the sentence level):
43.7%: Forward and Backward Simulations - Part I: Untimed Systems - Lynch, Vaandrager (1994) (Correct)
29.1%: Forward and Backward Simulations for Timing-Based Systems - Lynch, Vaandrager (1991) (Correct)
Active bibliography (related documents): More All
0.4: Verification of an Audio Control Protocol - Bosscher, Polak, al. (1994) (Correct)
0.3: Formal Verification of TCP and T/TCP - Smith (1997) (Correct)
0.3: Analysis of an Audio Control Protocol with Bus Collision - Griffioen (1994) (Correct)
Similar documents based on text: More All
1.2: Forward and Backward Simulations - Part II: Timing-Based Systems - Lynch, Vaandrager (Correct)
0.6: Eternity Variables to Simulate Specifications - Hesselink (2002) (Correct)
0.5: A Theory of Normed Simulations - Griffioen, Vaandrager (Correct)
Related documents from co-citation: More All
37: Forward and backward simulations -- Part II: Timing-based systems - Lynch, Vaandrager
31: Distributed Algorithms (context) - Lynch - 1996
28: Hierarchical Correctness Proofs for Distributed Algorithms - Lynch, Tuttle - 1987
BibTeX entry: (Update)
N. Lynch and F. Vaandrager. Forward and backward simulations part i: Untimed systems. Information and Computation, 121(2):214--233, Sept. 1995. http://citeseer.ist.psu.edu/lynch95forward.html More
@incollection{ lynch93forward,
author = "Nancy A. Lynch and Frits W. Vaandrager",
title = "Forward and backward simulations -- Part {I}: untimed systems.",
booktitle = "135",
month = "31",
publisher = "Centrum voor Wiskunde en Informatica (CWI)",
address = "ISSN 0169-118X",
pages = "35",
year = "1993",
url = "citeseer.ist.psu.edu/lynch95forward.html" }
Citations (may not include all citations):2732 Communicating Sequential Processes (context) - Hoare - 1985 ACM DBLP
689 Systematic Software Development using VDM - Jones - 1986 ACM
625 ACM Transactions on Programming Languages and Systems (context) - Lamport, program - 1983
502 Concurrency and automata on infinite sequences (context) - Park - 1981 ACM DBLP
447 Prentice-Hall International (context) - Milner, Concurrency - 1989
293 Hierarchical correctness proofs for distributed algorithms - Lynch, Tuttle - 1987 ACM DBLP
274 Prentice-Hall International (context) - Reynolds, of - 1981
274 The existence of refinement mappings - Abadi, Lamport - 1991 ACM DBLP
266 Cambridge Tracts in Theoretical Computer Science (context) - Baeten, Weijland - 1990
265 Proof of correctness of data representations (context) - Hoare - 1972 ACM DBLP
250 volume 1 of The Art of Computer Programming (context) - Knuth - 1973
231 Information Processing Letters (context) - Alpern, Schneider - 1985
208 An axiomatic proof technique for parallel programs (context) - Owicki, Gries - 1976
160 Abstraction and Specification in Program Development (context) - Liskov, Guttag - 1986 ACM
146 Prentice-Hall International (context) - Dijkstra, of - 1976
106 An algebraic definition of simulation between programs (context) - Milner - 1971 ACM DBLP
98 Forward and backward simulations -- part II: Timingbased sys.. - Lynch, Vaandrager - 1993
95 Forward and backward simulations -- part I: Untimed systems - Lynch, Vaandrager - 1993
81 The linear time -- branching time spectrum (context) - van Glabbeek - 1990
78 Forward and backward simulations for timing-based systems - Lynch, Vaandrager - 1991 ACM DBLP
57 Proof-checking a data link protocol - Helmink, Sellink et al. - 1993 ACM DBLP
45 IEEE Transactions on Software Engineering (context) - Lam, Shankar et al. - 1984
42 part I: Sequential nondeterministic programs (context) - Back, von Wright - 1989
37 Compositional Verification of Distributed Systems (context) - Jonsson - 1987
37 Three logics for branching bisimulation (context) - De Nicola, Vaandrager - 1990 ACM DBLP
36 Simulations between specifications of distributed systems (context) - Jonsson - 1991 ACM DBLP
36 Prespecification in data refinement (context) - Hoare, He et al. - 1987 ACM DBLP
31 Algebraic Theory of Automata (context) - Ginzburg - 1968
29 A single complete rule for data refinement (context) - Gardiner, Morgan - 1993 DBLP
28 A state-based approach to communicating processes (context) - Josephs - 1988 DBLP
22 The linear time -- branching time spectrum II (context) - van Glabbeek - 1993
18 Proving entailment between conceptual state specifications - Stark - 1988 ACM DBLP
18 On decomposing and refining specifications of distributed sy.. (context) - Jonsson - 1990 ACM DBLP
17 Correctness of at-most-once message delivery protocols - Lampson, Lynch et al. - 1993 ACM DBLP
17 Concurrency control for resilient nested transactions (context) - Lynch - 1983 ACM DBLP
15 Verification of a multiprocessor cache protocol using simula.. (context) - Loewenstein, Dill - 1991 ACM DBLP
14 Multivalued possibilities mappings - Lynch - 1989 ACM DBLP
13 Proving correctness with respect to nondeterministic safety .. (context) - Sistla - 1991 ACM DBLP
13 Modular verification of asynchronous networks (context) - Jonsson - 1987 ACM DBLP
12 Two constructive realizations of the block concept and their.. (context) - Lucas - 1968
11 Completeness theorems for automata (context) - Merritt - 1989 ACM DBLP
8 Formal verification of data type refinement --- theory and p.. (context) - Nipkow - 1990
7 Proving nondeterministically specified safety properties usi.. (context) - Klarlund, Schneider - 1993 ACM DBLP
6 Foundations of compositional program refinement (context) - Gerth - 1990
5 Verifying safety properties using infinite-state automata (context) - Klarlund, Schneider - 1989
5 Process simulation and refinement (context) - He - 1989 ACM DBLP
3 An extended abstract will appear (context) - Gawlick, Segala et al. - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.lcs.mit.edu/publications/pubs/ps/): More
Maps: A Compiler-Managed Memory System for Raw Machines - Barua, Lee, Amarasinghe.. (1998) (Correct)
A Technique for Constructing Highly-Available Services - Ladin, Liskov, Shrira (1987) (Correct)
Design and Verification of Speculative Processors - Shen, Arvind (1998) (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