Add to ORKGdata by sealing, and develop a bisimulation proof method that is sound and complete with respect to contextual equivalence. This provides a formal basis for reasoning about data abstraction in open, dynamic settings where static techniques such as type abstraction and logical relations are not applicable.
Bisimulation is an abstraction method that can be used to reduce the number of states fortransition ...
The SOS formats ensuring that bisimilarity is a congruence often fail in the presence of structural ...
We present a sound, complete, and elementary proof method, based on bisimulation, for contextual equ...
AbstractWe define λseal, an untyped call-by-value λ-calculus with primitives for protecting abstract...
Abstract We define *seal, an untyped call-by-value *-calculus with primitives for protecting abstrac...
We present a sound, complete, and elementary proof method, based on bisimulation, for contextual equ...
AbstractThe concept of bisimulation from concurrency theory is used to reason about recursively defi...
International audienceCoinduction is a method for specifying and reasoning about infinite data types...
AbstractWe develop a general method for proving properties of programs under arbitrary contexts–incl...
The SOS formats ensuring that bisimilarity is a congruence often fail in the presence of structural ...
We investigate criteria to relate specifications and implementations belonging to conceptually diffe...
Abstract The sos formats ensuring that bisimilarity is a congruence of-ten fail in the presence of s...
The notions of bisimulation and simulation are used for graph reduction and are widely employed in m...
Abstract. Bisimilarity of two processes is formally established by producing a bisimulation relation...
We investigate criteria to relate specifications and implementations belonging to conceptually diffe...
Bisimulation is an abstraction method that can be used to reduce the number of states fortransition ...
The SOS formats ensuring that bisimilarity is a congruence often fail in the presence of structural ...
We present a sound, complete, and elementary proof method, based on bisimulation, for contextual equ...
AbstractWe define λseal, an untyped call-by-value λ-calculus with primitives for protecting abstract...
Abstract We define *seal, an untyped call-by-value *-calculus with primitives for protecting abstrac...
We present a sound, complete, and elementary proof method, based on bisimulation, for contextual equ...
AbstractThe concept of bisimulation from concurrency theory is used to reason about recursively defi...
International audienceCoinduction is a method for specifying and reasoning about infinite data types...
AbstractWe develop a general method for proving properties of programs under arbitrary contexts–incl...
The SOS formats ensuring that bisimilarity is a congruence often fail in the presence of structural ...
We investigate criteria to relate specifications and implementations belonging to conceptually diffe...
Abstract The sos formats ensuring that bisimilarity is a congruence of-ten fail in the presence of s...
The notions of bisimulation and simulation are used for graph reduction and are widely employed in m...
Abstract. Bisimilarity of two processes is formally established by producing a bisimulation relation...
We investigate criteria to relate specifications and implementations belonging to conceptually diffe...
Bisimulation is an abstraction method that can be used to reduce the number of states fortransition ...
The SOS formats ensuring that bisimilarity is a congruence often fail in the presence of structural ...
We present a sound, complete, and elementary proof method, based on bisimulation, for contextual equ...