Results 1  10
of
184
Bisimulation can't be traced
, 1995
"... In the concurrent language CCS, hvo programs are considered the same if they are bzsimilar. Several years and many researchers have demonstrated that the theory of bisimulation is mathematically appealing and useful in practice. However, bisimulation makes too many distinctions between programs. W ..."
Abstract

Cited by 237 (2 self)
 Add to MetaCart
. We consider the problem of adding operations to CCS to make bisimulation fully abstract. We define the class of GSOS operations, generalizing the style and technical advantages of CCS operations. We characterize GSOS congruence in as a bisimulationlike relation called ready simulation. Bisimulation
A BisimulationLike Proof Method for Contextual Properties in Untyped λCalculus with References and Deallocation
, 2008
"... We develop a general method of proving properties of programs under arbitrary contexts—including (but not limited to) observational equivalence, space improvement, and a form of memory safety of the programs—in untyped callbyvalue λcalculus with firstclass, dynamically allocated, higherorder ref ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
order references and deallocation. The method generalizes Sumii et al.’s environmental bisimulation technique, and gives a sound and complete characterization of each proved property, in the sense that the “bisimilarity” (the largest set satisfying the bisimulationlike conditions) equals the set of terms
Proving congruence of bisimulation in functional programming languages
 Information and Computation
, 1996
"... Email: howe research.att.com We give a method for proving congruence of bisimulationlike equivalences in functional programming languages. The method applies to languages that can be presented as a set of expressions together with an evaluation relation. We use this method to show that some genera ..."
Abstract

Cited by 130 (1 self)
 Add to MetaCart
Email: howe research.att.com We give a method for proving congruence of bisimulationlike equivalences in functional programming languages. The method applies to languages that can be presented as a set of expressions together with an evaluation relation. We use this method to show that some
Choreography and Orchestration: a synergic approach for system design
 In Proc. of 4th International Conference on Service Oriented Computing (ICSOC
, 2005
"... Abstract. Choreography and orchestration languages deal with business processes design and specification. Referring to Web Services technology, the most credited proposals are WSCDL about choreography and WSBPEL about orchestration. A closer look to such a kind of languages highlights two distinct ..."
Abstract

Cited by 49 (9 self)
 Add to MetaCart
system is conformant to a given choreography. Choreography and orchestration are formalized by using two process algebras and conformance takes the form of a bisimulationlike relation. 1
Derivation of Characteristic Formulae
, 2001
"... This paper shows how modal mucalculus formulae characterizing finitestate processes up to strong or weak bisimulation can be derived directly from the wellknown greatest fixpoint characterizations of the bisimulation relations. Our derivation simplifies earlier proofs for the strong bisimulation ..."
Abstract

Cited by 23 (1 self)
 Add to MetaCart
case and, by virtue of derivation, immediately generalizes to various other bisimulationlike relations, in particular weak bisimulation.
Bisimulation and Unwinding for Verifying Possibilistic Security Properties
 Proc. of Int. Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI'03), volume 2575 of LNCS
, 2003
"... We study bisimulationbased information ow security properties which are persistent, in the sense that if a system is secure, then all states reachable from it are secure too. We show that such properties can be characterized in terms of bisimulationlike equivalence relations between the system ..."
Abstract

Cited by 17 (4 self)
 Add to MetaCart
We study bisimulationbased information ow security properties which are persistent, in the sense that if a system is secure, then all states reachable from it are secure too. We show that such properties can be characterized in terms of bisimulationlike equivalence relations between
Verifying Persistent Security Properties
 Computer Languages, Systems and Structures
, 2004
"... We study bisimulationbased information ow security properties which are persistent, in the sense that if a system is secure then all of its reachable states are secure too. We show that such properties can be characterized in terms of bisimulationlike equivalence relations, between the full system ..."
Abstract

Cited by 16 (8 self)
 Add to MetaCart
We study bisimulationbased information ow security properties which are persistent, in the sense that if a system is secure then all of its reachable states are secure too. We show that such properties can be characterized in terms of bisimulationlike equivalence relations, between the full
A Model for Comparing the Space Usage of Lazy Evaluators
 In Proceedings of the 2nd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming
, 2000
"... Identifying the source of space faults in functional programs is hard. The problem is compounded as space usage can vary enormously from one implementation to another. We use a termgraph rewriting model to describe evaluators with explicit space usage. Given descriptions for two evaluators E1 and E ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
and E2, if E1 never has asymptotically worse space usage than E2, we can use a bisimulationlike proof method to prove it. Conversely, if E1 is leakier than E2, we characterise a class of computations that expose the difference between them.
MartinLöf's Type Theory As An OpenEnded Framework
, 2001
"... This paper treats MartinLöf's type theory as an openended framework composed of (i) flexibly extensible languages into which various forms of objects and types can be incorporated, (ii) their uniform, effectively given semantics, and (iii) persistently valid inference rules. The class of expr ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
of expression systems is introduced here to define an openended body of languages underlying the theory. Each expression system consists of two parts: the computational part is a structured lazy evaluation system with a bisimulationlike program equivalence; the structural part is a system of strictly positive
On The Finitary Bisimulation
, 1995
"... The finitely observable, or finitary, part of bisimulation is a key tool in establishing full abstraction results for denotational semantics for process algebras with respect to bisimulationbased preorders. A bisimulationlike characterization of this relation for arbitrary transition systems is ..."
Abstract
 Add to MetaCart
The finitely observable, or finitary, part of bisimulation is a key tool in establishing full abstraction results for denotational semantics for process algebras with respect to bisimulationbased preorders. A bisimulationlike characterization of this relation for arbitrary transition systems
Results 1  10
of
184