| Berger, M., K. Honda and N. Yoshida, Linearity and bisimulation., in: Proceedings of FoSSaCS'02 (2002), pp. 290--301. |
.... is at the heart of several program transformation techniques [1] Information flow analysis, reformulated as a type inference problem, has been heavily studied in the past few years, especially in the area of high level, sequential languages; for references, see e.g. 18] Recently, researchers [9, 11, 20, 10, 12, 25] have begun further extending this study to low level, concurrent calculi, such as the calculus. This is made clearly worthwhile by the fact that these calculi allow modeling distributed computing systems and protocols, which today are at the heart of many realworld security concerns. An ....
.... causal flow property concerning the traces of a process in a colored labelled transition semantics. Because both the property and the colored semantics are ad hoc, it is difficult to determine exactly what is being guaranteed. Honda, Yoshida, Vasconcelos and Berger, in a number of papers [11, 12, 25] propose several advanced type systems, which allow exploiting linearity and deadlock freedom properties to refine the information flow analysis. Their non interference result, which is stated in terms of a weak bisimulation, requires a rather involved proof [24] due to the need to keep track of ....
[Article contains additional citation context not shown here]
N. Yoshida, K. Honda, and M. Berger. Linearity and bisimulation. In Proceedings of 5th International Conference of Foundations of Software Science and Computer Structures (FoSSaCs
.... is at the heart of several program transformation techniques [1] Information flow analysis, reformulated as a type inference problem, has been heavily studied in the past few years, especially in the area of high level, sequential languages; for references, see e.g. 19] Recently, researchers [9, 11, 21, 10, 12, 26] have begun further extending this study to low level, concurrent calculi, such as the calculus. This is made clearly worthwhile by the fact that these calculi allow modeling distributed computing systems and protocols, which today are at the heart of many realworld security concerns. An ....
.... causal flow property concerning the traces of a process in a colored labelled transition semantics. Because both the property and the colored semantics are ad hoc, it is difficult to determine exactly what is being guaranteed. Honda, Yoshida, Vasconcelos and Berger, in a number of papers [11, 12, 26] propose several advanced type systems, which allow exploiting linearity and deadlock freedom properties to refine the information flow analysis. Their non interference result, which is stated in terms of a weak bisimulation, requires a rather involved proof [25] due to the need to keep track of ....
[Article contains additional citation context not shown here]
N. Yoshida, K. Honda, and M. Berger. Linearity and bisimulation. In Proceedings of 5th International Conference of Foundations of Software Science and Computer Structures (FoSSaCs
No context found.
Nobuko Yoshida, Kohei Honda, and Martin Berger. Linearity and bisimulation. In FoSSaCs02, volume 2303 of LNCS, pages 417--433. Springer, 2002.
No context found.
Yoshida, N., Honda, K. and Berger, M. Linearity and Bisimulation, FoSSaCs 2002.
No context found.
Yoshida, N., Honda, K., and Berger, M. Linearity and bisimulation. In FoSSaCs02 (2002), vol. 2303 of LNCS, Springer, pp. 417-433.
No context found.
Yoshida, N., Berger, M. and Honda, K., Linearity and Bisimulation, Proc. FoSSaCs'02, LNCS 2303, pp.417--433, Springer-Verlag, France, 2002.
No context found.
Yoshida, N., Honda, K. and Berger, M. Linearity and Bisimulation, FoSSaCs 2002, LNCS 2303, pp.417-433, Springer, 2002.
....side e ects to distributed computing, all of which may exhibit certain forms of genericity. The calculus is a small syntax for communicating processes in which we can precisely represent many classes of computational behaviours, from purely sequential functions to those of distributed systems [5, 7, 17, 32, 33]. Can we nd a uniform account of genericity for diverse classes of computational behaviour using the calculus This work presents our initial results in this direction, concentrating on a polymorphic variant of the linear ane calculus with state [7, 12, 32, 33] It turns out that the duality ....
.... those of distributed systems [5, 7, 17, 32, 33] Can we nd a uniform account of genericity for diverse classes of computational behaviour using the calculus This work presents our initial results in this direction, concentrating on a polymorphic variant of the linear ane calculus with state [7, 12, 32, 33]. It turns out that the duality principle in the linear ane type structure naturally extends to second order quanti cation, leading to a powerful theory of polymorphism that allows precise embedding of existing polymorphic functional calculi and uni es some of the signi cant technical elements ....
[Article contains additional citation context not shown here]
Yoshida, N., Honda, K., and Berger, M. Linearity and bisimulation. In FoSSaCs'02 (2002), vol. 2303 of LNCS, Springer, pp. 417-433. 16
No context found.
Berger, M., K. Honda and N. Yoshida, Linearity and bisimulation., in: Proceedings of FoSSaCS'02 (2002), pp. 290--301.
No context found.
Berger, M., K. Honda and N. Yoshida, Linearity and bisimulation., in: Proceedings of FoSSaCS'02 (2002), pp. 290--301.
No context found.
Berger, M., K. Honda and N. Yoshida, Linearity and bisimulation., in: Proceedings of FoSSaCS'02 (2002), pp. 290--301.
No context found.
Berger, M., Honda, K., Yoshida, N.: Linearity and bisimulation. In: Proceedings of FoSSaCS'02, LNCS (2002) 290--301
No context found.
Yoshida, N., Honda, K. and Berger, M. Linearity and Bisimulation, FoSSaCs 2002.
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