1194 search results - page 200 / 239 » A Calculus for Predicative Programming |
CCS
1998
ACM
14 years 3 months ago
1998
ACM
We develop a framework for analyzing security protocols in which protocol adversaries may be arbitrary probabilistic polynomial-time processes. In this framework, protocols are wr...
AMAST
2008
Springer
14 years 1 months ago
2008
Springer
The Hoare approach to program verification relies on the construction and discharge of verification conditions (VCs) but offers no support to trace, analyze, and understand the VCs...
DBSEC
1996
14 years 9 days ago
1996
High assurance security is di cult to achieve in distributed computer systems and databases because of their complexity, non-determinism and inherent heterogeneity. The practical ...
IANDC
2008
13 years 11 months ago
2008
In this paper, we study sixteen communication primitives, arising from the combination of four useful programming features: synchronism (synchronous vs asynchronous primitives), a...
ENTCS
2006
13 years 11 months ago
2006
Capability passing processes model global applications in a way that decouples the global agreement aspects of protocols from the details of how the communications are actually ma...