Nancy Lynch and Frits Vaandrager. Forward and backward simulations -- Part I: Untimed systems. Information and Computation, 121(2), 1995. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
A Verification Environment for I/O Automata - Müller (1998) (Correct)
....research questions. I O Automata. Input Output automata are a semantic model for reactive, distributed systems together with a tailored refinement concept. The model has been originally proposed by Lynch and Tuttle [LT87] subsequent developments are mainly due to Lynch and Vaandrager [LV95, LV96, Lyn96, GSSL93, RV96, LSVW96] The method has already 1.1 Motivation 3 been successfully applied to the verification of several non trivial case studies, ranging from communication protocols [SLL93] and automated transit systems [DL97] to database applications [LMWF94] Apart from I O ....
....as executions of I O automata contain explicit actions . Even in TLA, however, actions are merely state changes. Furthermore, existing temporal logics do not consider finite computations. A Priori Verification. Whereas safe implementation relations have been studied very well for I O automata [LV95] there is no tailored proof infrastructure for live implementation relations. The standard game theoretic treatment of liveness [GSSL93] deals only with general requirements on the automaton model, but does not provide a proof infrastructure for liveness proofs. Therefore, actual refinement ....
[Article contains additional citation context not shown here]
N.A. Lynch and F. Vaandrager. Forward and backward simulations -- part I: Untimed systems. Information and Computation, 121(2):214--233, 1995.
Concise Graphs and Functional Bisimulations - Cheung, Hughes (Correct)
....them, we do not investigate the related skeletal category) This yields the category P. Functional bisimulations seem to be an interesting (if non traditional) choice, because they are closely related to history relations. Indeed, the FB relation of ibid corresponds to the opposite of in [2]. In fact, a direct application of Lynch and Vaandrager s Proposition 5.4 yields: There is a functional bisimulation A B i# A is essentially obtained by adding a history variable to B. The function A B is the e#ect of forgetting that variable. Having taken history relations as our ....
Lynch, N., Vaandrager, F.: Forward and backward simulations part I: Untimed systems. Information and Computation 121 (1995) 214--233
A Static Analysis for Instance-based Confinement in Java - Banerjee, Naumann (1 citation) (Correct)
....says behavior of a client is independent of the internal representation of an object of class A, provided that the representation objects are con ned. The theorem formalizes representation independence in terms of simulation relations which are widely used for reasoning about data abstraction [Rey84,LV95,dRE98], secure information ow [MS92,ABHR99] program analysis [NNH99] and program transformation [HHS93] The present paper makes three contributions. First, we give a static analysis of instance based con nement. That is, we de ne con nement as a property of program syntax. The de nition is ....
N. Lynch and F. Vaandrager. Forward and backward simulations part I: Untimed systems. Information and Computation, 121(2), 1995.
Systematic Verification of Safety Properties of.. - Bradley, Bestavros.. (2003) (Correct)
....(preferably finite) set of behaviorally representative arrangements, which could then each be verified. To be useful, the discovery and application of such reductions must follow a systematic approach. Much work has already been done in several communities on discovery of such relationships (e.g. [7, 2, 22]) in the remainder of this paper, we presume such results and develop a reduction strategy based upon an algebraic term rewriting technique that is immediately applicable to a wide range of network application structures. It is important to note that a number of techniques have been developed ....
.... of # are fully represented by the behaviors of members of its subsetf (A # ) The means by which this behavioral equivalence is established may be any mechanism appropriate to the given application and # (e.g. logical proofs, type systems [7] process algebra [2] theory of I O automata [22], I O equivalence, etc. 3.4 Reduction Strategy Intuitively, our strategy is to identify a set of reductions (i.e. congruence relations overA which preserve behavioral equivalence) by which we can establish a finite sized homomorphic image ofA (that is, a finite sizedA n#A such that ....
Nancy Lynch and Frits Vaandrager. Forward and backward simulations -- part I: Untimed systems. Information and Computation, 121(2):214-- 233, September 1995.
Robust Declassification - Zdancewic, Myers (2001) (15 citations) (Correct)
....of taking states modulo equivalence and traces up to stutterequivalence, yields essentially the same result. Equivalence relations over states appear in all of these formulations in the guise of unwinding relations [8, 20, 13, 12] and the closely related notion of simulation relations [10]. The difference between unwinding relations and views is that rather than starting with an event system and trying to find a consistent unwinding relation as a means of establishing a security property, we start with a view of the system and determine how the view is altered by information leaks ....
N. Lynch and F. Vaandrager. Forward and backward simulations -- Part I: Untimed systems. Information and Computation, 121(2):214--233, September 1995. Also, Technical Memo MIT/LCS/TM-486.b (with minor revisions), Laboratory for Computer Science, Massachusetts Institute of Technology.
Systematic Verification of Safety Properties of.. - Bradley, Bestavros.. (2003) (Correct)
....(preferably finite) set of behaviorally representative arrangements, which could then each be verified. To be useful, the discovery and application of such reductions must follow a systematic approach. Much work has already been done in several communities on discovery of such relationships (e.g. [7, 2, 22]) in the remainder of this paper, we presume such results and develop a reduction strategy based upon an algebraic term rewriting technique that is immediately applicable to a wide range of network application structures. It is important to note that a number of techniques have been developed ....
.... of set # are fully represented by the behaviors of members of its subset f(A # ) The means by which this behavioral equivalence is established may be any mechanism appropriate to the given application and # (e.g. logical proofs, type systems [7] process algebra [2] theory of I O automata [22], I O equivalence, etc. 3.4 Reduction Strategy Intuitively, our strategy is to identify a set of reductions (i.e. congruence relations over which preserve behavioral equivalence) by which we can establish a finite sized homomorphic image of (that is, a finite sized An # A such that ....
Nancy Lynch and Frits Vaandrager. Forward and backward simulations -- part I: Untimed systems. Information and Computation, 121(2):214-- 233, September 1995.
A Static Analysis for Instance-based Confinement in Java - Banerjee, Naumann (1 citation) (Correct)
....says behavior of a client is independent of the internal representation of an object of class A, provided that the representation objects are confined. The theorem formalizes representation independence in terms of simulation relations which are widely used for reasoning about data abstraction [Rey84,LV95,dRE98], secure information flow [MS92,ABHR99] program analysis [NNH99] and program transformation [HHS93] The present paper makes three contributions. First, we give a static analysis of instance based confinement. That is, we define confinement as a property of program syntax. The definition is ....
N. Lynch and F. Vaandrager. Forward and backward simulations part I: Untimed systems. Information and Computation, 121(2), 1995.
Dynamic Input/Output Automata: a Formal Model for Dynamic Systems - Attie, Lynch (2003) Self-citation (Lynch) (Correct)
No context found.
N.A. Lynch and F.W. Vaandrager. Forward and backward simulations | part I: Untimed systems. Information and Computation, 121(2):214-233, sep 1995.
Using Simulated Execution in Verifying Distributed.. - Win, Ernst, Garland.. (2004) (3 citations) Self-citation (Lynch) (Correct)
No context found.
Nancy Lynch and Frits Vaandrager. Forward and backward simulations --- Part I: Untimed systems. Information and Computation, 121(2):214--233, September 1995.
The BG Distributed Simulation Algorithm - Borowsky, Gafni, al. (1997) (11 citations) Self-citation (Lynch) (Correct)
No context found.
Nancy Lynch and Frits Vaandrager. "Forward and Backward Simulations -- Part I: Untimed Systems," Information and Computation, Vol. 121, No. 2, September 1995, 214--233.
Formal Verification of TCP and T/TCP - Smith (1997) Self-citation (Lynch) (Correct)
....about the system and precisely define the problem. We then prove that it is impossible for any protocol to solve the problem. 1.3 Formal methods We use invariant assertion and simulation (refinement) techniques to verify TCP and T TCP. We use the formalization of simulations developed in [24, 26] by Lynch and Vaandrager. These methods are used for proving trace inclusion relationships between concurrent We do not verify this. 14 systems. The methodology is developed in the context of very simple and general automaton models for both untimed [24] and timed [26] systems. For timed ....
....of simulations developed in [24, 26] by Lynch and Vaandrager. These methods are used for proving trace inclusion relationships between concurrent We do not verify this. 14 systems. The methodology is developed in the context of very simple and general automaton models for both untimed [24] and timed [26] systems. For timed systems we use a formulation of the automaton model called General Timed Automata (GTA) presented in [21] For the impossibility result, we also use a special case of the GTA model called clock GTA [29] which is used to model systems with local clocks. While the ....
[Article contains additional citation context not shown here]
Nancy Lynch and Frits Vaandrager. Forward and backward simulations --- Part I: Untimed systems. Information and Computation, 121(2):214--233, September 1995. Also, [23].
Formal Verification of TCP and T/TCP - Smith (1997) Self-citation (Lynch) (Correct)
No context found.
Nancy Lynch and Frits Vaandrager. Forward and backward simulations --- Part I: Untimed systems. Technical Memo MIT/LCS/TM-486, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 02139, May 1993.
On Modular Pluggable Analyses Using Set Interfaces - Lam, Kuncak, Rinard (2003) (Correct)
No context found.
Nancy Lynch and Frits Vaandrager. Forward and backward simulations -- Part I: Untimed systems. Information and Computation, 121(2), 1995.
On Modular Pluggable Analyses Using Set Interfaces - Lam, Kuncak, Rinard (2003) (Correct)
No context found.
Nancy Lynch and Frits Vaandrager. Forward and backward simulations -- Part I: Untimed systems. Information and Computation, 121(2), 1995.
Verifying Distributed Algorithms via Dynamic Analysis and.. - Win, Ernst (2002) (1 citation) (Correct)
No context found.
Nancy A. Lynch and Frits W. Vaandrager. Forward and backward simulations { part I: Untimed systems. Information and Computation, 121(2):214-233, September 1995.
Safe Compositional Specification of Networking Systems - Azer Bestavros Adam (2004) (Correct)
No context found.
Nancy Lynch and Frits Vaandrager, Forward and backward simulations -- part I: Untimed systems, Information and Computation 121(2) (1995), 214--233.
Unknown - (Correct)
No context found.
N. Lynch and F. Vaandrager. Forward and backward simulations part I: Untimed systems. Information and Computation, 121(2):214--233, Sept. 1995.
Verifying Distributed Algorithms via Dynamic Analysis and.. - Win, Ernst (2002) (1 citation) (Correct)
No context found.
Nancy A. Lynch and Frits W. Vaandrager. Forward and backward simulations { part I: Untimed systems. Information and Computation, 121(2):214-233, September 1995.
Safe Compositional Specification of Networking Systems - Azer Bestavros Adam (2004) (Correct)
No context found.
Nancy Lynch and Frits Vaandrager, Forward and backward simulations -- part I: Untimed systems, Information and Computation 121(2) (1995), 214--233.
Turing Machines, Transition Systems, and Interaction - Goldin, Smolka, al. (2004) (1 citation) (Correct)
No context found.
N. Lynch and F.W. Vaandrager. Forward and backward simulations { part i: Untimed systems. Information and Computation, 121(2):214-233, September 29 1995.
Safe Compositional Specification of Networking Systems - Azer Bestavros Adam (2004) (Correct)
No context found.
Nancy Lynch and Frits Vaandrager, Forward and backward simulations -- part I: Untimed systems, Information and Computation 121(2) (1995), 214--233.
On Modular Pluggable Analyses Using Set Interfaces - Lam, Kuncak, Rinard (2003) (Correct)
No context found.
Nancy Lynch and Frits Vaandrager. Forward and backward simulations -- Part I: Untimed systems. Information and Computation, 121(2), 1995.
On the Borowsky-Gafni Simulation Algorithm (Extended Abstract) - Lynch, Rajsbaum (1996) (Correct)
No context found.
Nancy Lynch and Frits Vaandrager. "Forward and Backward Simulations -- Part I: Untimed Systems," Information and Computation, Vol. 121, No. 2, September 1995, 214--233.
Verifiable Code Generation from Abstract I/O Automata Models for.. - Tauber (2001) (Correct)
No context found.
Nancy Lynch and Frits Vaandrager. Forward and backward simulations | Part I: Untimed systems. Information and Computation, 121(2):214-233, September 1995.
Nomadic π-Calculi: Expressing and Verifying Communication.. - Unyapoth (2001) (Correct)
No context found.
N. Lynch and F. Vaandrager. Forward and backward simulations part I: Untimed systems (replaces TM-486). Technical Memo MIT/LCS/TM-486b, Massachusetts Institute of Technology, Laboratory for Computer Science, October 1994.
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