526 search results - page 3 / 106 » Type Abstractions of Name-Passing Processes |
CONCUR
2000
Springer
13 years 10 months ago
2000
Springer
Abstract. We extend Kobayashi and Sumii’s type system for the deadlock-free π-calculus and develop a type reconstruction algorithm. Kobayashi and Sumii’s type system helps hig...
ESOP
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. We propose a new type discipline for the -calculus in which secure information flow is guaranteed by static type checking. Secrecy levels are assigned to channels and are...
TACS
2001
Springer
13 years 10 months ago
2001
Springer
We propose the πD -calculus, a process calculus that can flexibly model fine-grained control of resource access in distributed computation, with a type system that statically pr...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
Abstract—This paper presents a systematic methodology to derive and classify fast algorithms for linear transforms. The approach is based on the algebraic signal processing theor...
ENTCS
2010
13 years 5 months ago
2010
Process modeling languages such as "Dynamical Grammars" are highly expressive in the processes they model using stochastic and deterministic dynamical systems, and can b...