Sciweavers

7943 search results - page 51 / 1589
» A calculus for costed computations
Sort
View
TCS
1998
14 years 9 months ago
Unary PCF is Decidable
We show that unary PCF, a very small fragment of Plotkin’s PCF [?], cidable observational pre-order, and that its fully abstract model is effectively presentable. This is in ma...
Ralph Loader
TCS
2010
14 years 4 months ago
An exact correspondence between a typed pi-calculus and polarised proof-nets
This paper presents an exact correspondence in typing and dynamics between polarised linear logic and a typed -calculus based on IO-typing. The respective incremental constraints,...
Kohei Honda, Olivier Laurent
FSTTCS
2004
Springer
15 years 3 months ago
A Calculus for Trust Management
We introduce ctm, a process calculus which embodies a notion of trust for global computing systems. In ctm each principal (location) is equipped with a policy, which determines its...
Marco Carbone, Mogens Nielsen, Vladimiro Sassone
VLDB
1991
ACM
111views Database» more  VLDB 1991»
15 years 1 months ago
The Power of Methods With Parallel Semantics
A model capturing the data manipulation capabilities of a large class of methods in ohjectoriented databases is proposed and investsigated. The model uses a deterministic, paralle...
Karl Denninghoff, Victor Vianu
CONCUR
2003
Springer
15 years 3 months ago
Composition of Cryptographic Protocols in a Probabilistic Polynomial-Time Process Calculus
We describe a probabilistic polynomial-time process calculus for analyzing cryptographic protocols and use it to derive compositionality properties of protocols in the presence of ...
Paulo Mateus, John C. Mitchell, Andre Scedrov