149 citations found. Retrieving documents...
R. De Nicola and M. C. B. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83-133, 1984.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:

First 50 documents  Next 50

Process Algebraic Analysis of Cryptographic Protocols - Boreale, De Nicola, Pugliese (2000)   (1 citation)  Self-citation (De nicola)   (Correct)

No context found.

R. De Nicola, M.C.B. Hennessy. Testing Equivalence for Processes. Theoretical Computers Science, 34:83-133, Elsevier, 1984.


Proof Techniques for Cryptographic Processes - Boreale, De Nicola, Pugliese (1999)   (33 citations)  Self-citation (De nicola)   (Correct)

No context found.

R. De Nicola, M.C.B. Hennessy. Testing Equivalence for Processes. Theoretical Computers Science, 34:83-133, Elsevier, 1984.


Trace and Testing Equivalence on Asynchronous Processes - Boreale, De Nicola, Pugliese (1999)   (8 citations)  Self-citation (De nicola)   (Correct)

No context found.

R. De Nicola, M.C.B. Hennessy. Testing Equivalence for Processes. Theoretical Computers Science, 34:83-133, Elsevier, 1984.


Information Flow vs. Resource Access in the Asynchronous.. - Hennessy, Riely (2000)   (8 citations)  Self-citation (Hennessy)   (Correct)

No context found.

R. De Nicola and M. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 24:83-113, 1984.


From Rewrite Rules to Bisimulation - Congruences Peter Sewell   (Correct)

No context found.

R. De Nicola and M. C. B. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83-133, 1984.


Unknown -   (Correct)

No context found.

R. De Nicola and M. C. B. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83--133, 1984.


Unknown -   (Correct)

No context found.

R. De Nicola and M. C. B. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83--133, 1984.


A Framework for Analyzing Probabilistic - Protocols And Its   (Correct)

No context found.

R. De Nicola and M. C. B. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83--133, 1984.


A Framework for Analyzing Probabilistic - Protocols And Its   (Correct)

No context found.

R. De Nicola and M. C. B. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83--133, 1984.


A Calculus for Cryptographic Protocols - The Spi Calculus - Abadi, Gordon (1998)   (353 citations)  (Correct)

No context found.

R. De Nicola and M. C. B. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83--133, 1984.


Secrecy by Typing in Security Protocols - Abadi (1998)   (145 citations)  (Correct)

No context found.

R. De Nicola and M. C. B. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83--133, 1984.


A Calculus for Cryptographic Protocols - Lecture Notes Andrew   (Correct)

No context found.

R. De Nicola and M. C. B. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83--133, 1984.


Equational Properties of Mobile Ambients - Gordon, Cardelli (1999)   (35 citations)  (Correct)

No context found.

R. De Nicola and M. C. B. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83--133, 1984.


A Global Timed Bisimulation Preserving Abstraction - For Parametric Time-Interval (2004)   (Correct)

No context found.

de Nicola, R., Hennessy, M.: Testing equivalence for processes. Theoretical Computer Science 34 (1984) 83--133 18


Generating Test Cases for Infinite System Specifications - Stefan Heymer And   (Correct)

No context found.

R. De Nicola and M.C.B. Hennessy. Testing Equivalences for Processes. Theoretical Computer Science, 34:83--133, 1984.


Observational Congruences for Dynamically Reconfigurable .. - Bruni, Montanari..   (Correct)

No context found.

R. De Nicola, M. Hennessy, Testing equivalences for processes, Theoret. Comput. Sci. 34 (1984) 83--133.


A Testing Scenario for Probabilistic Automata - Mari Elle Stoelinga (2003)   (1 citation)  (Correct)

No context found.

R. De Nicola and M. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83-133, 1984.


A Testing Scenario for Probabilistic Automata - Stoelinga (2003)   (1 citation)  (Correct)

No context found.

R. De Nicola and M. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83-133, 1984.


A Theory of May Testing for Asynchronous Calculi with.. - Thati, Ziaei, Agha (2002)   (Correct)

No context found.

R. De Nicola and M. Hennesy. Testing equivalence for processes. In Theoretical Computer Science, volume 34, pages 83-133, 1984.


A Calculus for Cryptographic Protocols - The Spi Calculus - Abadi, Gordon (1996)   (353 citations)  (Correct)

No context found.

R. De Nicola and M. C. B. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83--133, 1984.


TGV: theory, principles and algorithms - Jard, Jeron (2002)   (Correct)

No context found.

R. De Nicola and M. Henessy. Testing Equivalences for Processes. Theoretical Computer Science, 34:83--133, 1984.


Comparing Refinements for Failure and Bisimulation Semantics - Eshuis, Fokkinga (2001)   (Correct)

No context found.

R. de Nicola and M. C. B. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34(1-2):83--133, November 1984.


SECCO 2003 Preliminary Version - Formal Approach For   (Correct)

No context found.

R. De Nicola and M. C. B. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83-133, 1984.


Verifying Semantic Relations in SPIN - Hakan Erdogmus Institute   (2 citations)  (Correct)

No context found.

R. De Nicola and M. Hennessy.Testing equivalences for processes. Theoretical Computer Science, 34:83--133, 1984.


Electronic Notes in Theoretical Computer Science 68 No. 6 (2003) - Url Http Www   (Correct)

No context found.

Rocco De Nicola and Matthew C. B. Hennessy. Testing equivalence for processes. In Josep Daz (editor) Automata, Languages and Programming, 10th Colloquium. Volume 154 of Lecture Notes in Computer Science, pages 548--560, Barcelona, Spain, 18--22 July 1983. Springer-Verlag.

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