Sciweavers

20 search results - page 4 / 4
» Deriving Weak Bisimulation Congruences from Reduction System...
Sort
View
ALP
1997
Springer
13 years 10 months ago
Perpetuality and Uniform Normalization
We de ne a perpetual one-step reduction strategy which enables one to construct minimal (w.r.t. Levy's ordering 2 on reductions) in nite reductions in Conditional Orthogonal ...
Zurab Khasidashvili, Mizuhito Ogawa
ACTA
2010
87views more  ACTA 2010»
13 years 6 months ago
On the observational theory of the CPS-calculus
We study the observational theory of Thielecke's CPS-calculus, a distillation of the target language of Continuation-Passing Style transforms. We define a labelled transition...
Massimo Merro
ENTCS
2006
140views more  ENTCS 2006»
13 years 6 months ago
Stochastic Ambient Calculus
Mobile Ambients (MA) have acquired a fundamental role in modelling mobility in systems with mobile code and mobile devices, and in computation over administrative domains. We pres...
Maria Grazia Vigliotti, Peter G. Harrison
CCS
2006
ACM
13 years 9 months ago
Secure information flow with random assignment and encryption
Type systems for secure information flow aim to prevent a program from leaking information from variables classified as H to variables classified as L. In this work we extend such...
Geoffrey Smith
INFOVIS
2003
IEEE
13 years 11 months ago
Visualizing Evolving Networks: Minimum Spanning Trees versus Pathfinder Networks
Network evolution is a ubiquitous phenomenon in a wide variety of complex systems. There is an increasing interest in statistically modeling the evolution of complex networks such...
Chaomei Chen, Steven Morris