299 citations found. Retrieving documents...
Meseguer, J., Conditional rewriting logic as a unified model of concurrency, Theoretical Computer Science 96 (1992), pp. 73--155.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:

First 50 documents  Next 50

A Rewriting Based Model for Probabilistic Distributed.. - Kumar, Sen, Meseguer..   Self-citation (Meseguer)   (Correct)

No context found.

J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96:73--155, 1992.


Rewriting Logic Semantics: From Language Specifications To.. - Meseguer, Rosu (2004)   Self-citation (Meseguer)   (Correct)

No context found.

J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96(1):73--155, 1992.


Formal JVM Code Analysis in JavaFAN - Azadeh Farzan Jose (2004)   (1 citation)  Self-citation (Meseguer)   (Correct)

No context found.

J. Meseguer. Conditional Rewriting Logic as a Unified Model of Concurrency. Theoretical Computer Science, pages 73--155, 1992.


Relating State-Based and Process-Based Concurrency through.. - Cervesato, Scedrov (2006)   (Correct)

No context found.

Meseguer, J., Conditional rewriting logic as a unified model of concurrency, Theoretical Computer Science 96 (1992), pp. 73--155.


Formal Analysis of Kerberos 5 - Frederick Butler Iliano   (Correct)

No context found.

J. Meseguer, Conditional rewriting logic as a unified model of concurrency, Theoretical Computer Science 96 (1992) 73--155.


Representing the MSR Cryptoprotocol Specification Language.. - Cervesato, Stehr (2005)   (Correct)

No context found.

Meseguer, J.: 1992, `Conditional rewriting logic as a unified model of concurrency'. Theoretical Computer Science 96, 73--155.


Representing the MSR Cryptoprotocol Specification Language in .. - Cervesato, al. (2004)   (Correct)

No context found.

J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96:73--155, 1992.


Model checking active networks with SPIN - Gallardo, Martinez, Merino (2005)   (Correct)

No context found.

J. Meseguer, Conditional rewriting logic as a unified model of concurrency, Theoretical Computer Science 96 (1996) 73--155.


Pathway Logic - Helping Biologists Understand (2005)   (Correct)

No context found.

J. Meseguer. Conditional Rewriting Logic as a unified model of concurrency. Theoretical Computer Science, 96(1):73-- 155, 1992.


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

No context found.

J. Meseguer, Conditional rewriting logic as a unified model of concurrency, Theoret. Comput. Sci. 96 (1992) 73--155.


Building tools for LOTOS Symbolic Semantics in Maude - Verdejo (2002)   (1 citation)  (Correct)

No context found.

J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96(1):73--155, 1992.


Playing with Maude - Miguel Palomino Narciso   (Correct)

No context found.

J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96(1):73--155, 1992.


Executable Structural Operational Semantics in Maude - Verdejo, Martí-Oliet (2003)   (2 citations)  (Correct)

No context found.

J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96(1):73--155, 1992.


Specification and Verification of the Tree Identify.. - Verdejo, Pita.. (2003)   (2 citations)  (Correct)

No context found.

J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96(1):73-- 155, 1992.


Reputation-Based Trust Management - Vitaly Shmatikov And (2003)   (3 citations)  (Correct)

No context found.

J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96(1):73--155, 1992.


Certifying Optimality of State Estimation Programs - Rosu, Venkatesan, Whittle.. (2003)   (Correct)

No context found.

J. Meseguer. Conditional Rewriting Logic as a Unified Model of Concurrency. Theoretical Computer Science, pages 73--155, 1992.


First Order and Higher Order Tile Models for Open and Mobile.. - Bruni, Montanari (2000)   (2 citations)  (Correct)

No context found.

J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoret. Comput. Sci., 96:73--155, 1992.


Efficient Monitoring of Safety Properties - Havelund, Rosu (2002)   (1 citation)  (Correct)

No context found.

J. Meseguer. Conditional Rewriting Logic as a Unified Model of Concurrency. Theoretical Computer Science, 1:73--155, 1992.


Certifying Kalman Filters - Leustean, Rosu (2003)   (1 citation)  (Correct)

No context found.

Jose Meseguer. Conditional Rewriting Logic as a Unified Model of Concurrency. Theoretical Computer Science, pages 73--155, 1992. 26


Categorical Term Rewriting: Monads and Modularity - Lüth (1997)   (Correct)

No context found.

J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96:73--155, 1992.


Logical Semantics for the Rewriting Calculus - Stump, Schürmann (2004)   (Correct)

No context found.

J. Meseguer. Conditional Rewriting Logic as a Unified Model of Concurrency. Theoretical Computer Science, 96(1):73--155, 1992.


Rewriting-based Techniques for Runtime Verification - Rosu, Havelund   (1 citation)  (Correct)

No context found.

J. Meseguer. Conditional Rewriting Logic as a Unified Model of Concurrency. Theoretical Computer Science, pages 73--155, 1992.


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

No context found.

J. Meseguer, Conditional rewriting logic as a unified model of concurrency, Theoret. Comput. Sci. 96 (1992) 73--155.


Foundations of a Module Concept for Distributed Object Systems - Filipe (2000)   (1 citation)  (Correct)

No context found.

J. Meseguer. Conditional rewriting logic as a unified model of concurreny. Theoretical Computer Science, 96(1):73--155, 1992.


Can Actors and π-Agents Live Together? - Montanari, Talcott   (Correct)

No context found.

J. Meseguer, Conditional Rewriting Logic as a Unified Model of Concurrency, Theoretical Computer Science 96, 1992, pp. 73-155.

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