D. Sangiorgi. Termination of processes. Mathematical Structures in Computer Science, 2006. To appear. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Solo Diagrams - Laneve, Parrow, Victor (2001) (2 citations) (Correct)
....[13] Replication can be de ned in terms of unguarded recursion: P def = P j P . This de nition is, however, hard to implement when should the unfolding stop How many (possibly nested) replications need be expanded in order to infer a reduction For the calculus Sangiorgi has shown [21] that replication of general agents is not necessary, but it can be replaced by the guarded variant : P . This corresponds to using guarded recursion ( P def = P j : P ) In languages based on the 1 asynchronous communication such as Pict [20] or Join [3] it is relatively ....
D. Sangiorgi. On the bisimulation proof method. Mathematical Structures in Computer Science, 8(5):447-479, 1998.
Proof Techniques for Cryptographic Processes - Boreale, De Nicola, Pugliese (1999) (33 citations) (Correct)
....semantics is sufficient for expressing many security properties (especially secrecy and autenthicity ones, 7] bisimulation is sometimes preferrable because it is supported by a nice, purely co inductive proof technique. The latter can be enhanced by tailoring, as we do, some up to techniques [21, 10] to the cryptographic setting. Another advantage of our semantics are the congruence rules that make compositional proofs possible. The use of trace and bisimulation semantics as proof techniques is illustrated with a few examples; some of the them concern the problem of implementing (like in [4] ....
....of given in Definition 3.8 gives us a powerful proof technique when proving equalities between two processes: it is sufficient to exhibit any bisimulation relation containing the given pair. This technique can be enhanced using the so called up to techniques (similar to those in, e.g. [21, 10]) which often permit to reduce the size of the relation to exhibit. We introduce below some useful up to techniques, which will be used in later proofs and examples. Up to structural equivalence allows one to freely identify structurally equivalent processes; up to weakening permits discarding ....
[Article contains additional citation context not shown here]
D. Sangiorgi. On the Bisimulation Proof Method. Mathematical Structures in Computer Science, 8:447-479, 1998.
A Bisimulation for the Blue Calculus - Dal-Zilio (1999) (1 citation) (Correct)
....the paper The rest of the paper is organized as follows. In Sect. 2, we review the blue calculus augmented with extensible records and we dene barbed congruence. In Sect. 4, we present the labeled transition system. In Sect. 5, we sketch the proof of validity of the iup to contextj proof technique [25] for the labeled bisimulation. The complete proof is given in Appendix A. We use this result to prove, at the same time, three properties: i) the labeled bisimulation is a congruence, ii) it contains the structural equivalence and (iii) it veries the replication laws (see Sect. 6) In Sect. 7, ....
....as (d ) uh(c) c(x) dhi)i j : and Q as (d ) uhOi j : Like the problem concerning asynchrony and d , we believe that this category of non bisimilar, yet congruent processes, is not important. 5 Bisimulation Up To In this section, we study the iup to contextj proof technique [25], and we prove that a bisimulation up to context is a def bisimulation. The complete proof can be found in Appendix A. One of the interests of this proof technique, is that it allows us to avoid a direct proof that d is a congruence. Other properties that follow from the proof of Th. 5.1 are ....
[Article contains additional citation context not shown here]
Davide Sangiorgi. On the bisimulation proof method. Mathematical Structures in Computer Science, 8(5):447479, October 1998.
Ensuring Termination by Typability - Deng, Sangiorgi Self-citation (Sangiorgi) (Correct)
No context found.
D. Sangiorgi. Termination of processes. Mathematical Structures in Computer Science, 2006. To appear.
Proof Methods for Corecursive Programs - Gibbons, Hutton (2005) (1 citation) (Correct)
No context found.
Sangiorgi, D.: On the Bisimulation Proof Method, Mathematical Structures in Computer Science, 8, 1998, 447--479.
Proof Techniques for Cryptographic Processes - Boreale, De Nicola, Pugliese (1999) (33 citations) (Correct)
No context found.
D. Sangiorgi. On the Bisimulation Proof Method. Mathematical Structures in Computer Science, 8:447-479, 1998.
When Ambients Cannot be Opened - Boneva, Talbot (2003) (1 citation) (Correct)
No context found.
P. Zimmer. On the Expressiveness of Pure Safe Ambients. Mathematical Structures of Computer Science, 2002. To appear.
Linear Forwarders - Gardner, Laneve, Wischik (2003) (Correct)
No context found.
D. Sangiorgi. On the bisimulation proof method. Mathematical Structures in Computer Science, 8(5):447--479, 1998.
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