322 search results - page 33 / 65 » Developing and Reasoning About Probabilistic Programs in pGC... |
CSFW
2006
IEEE
14 years 1 months ago
2006
IEEE
We develop a compositional method for proving cryptographically sound security properties of key exchange protocols, based on a symbolic logic that is interpreted over conventiona...
PODS
2006
ACM
14 years 7 months ago
2006
ACM
An intelligent agent will often be uncertain about various properties of its environment, and when acting in that environment it will frequently need to quantify its uncertainty. ...
POPL
2009
ACM
14 years 8 months ago
2009
ACM
A concurrent data-structure implementation is considered nonblocking if it meets one of three following liveness criteria: waitfreedom, lock-freedom, or obstruction-freedom. Devel...
LPNMR
1993
Springer
13 years 11 months ago
1993
Springer
We present a logic programming language which uses a four-valued bilattice as the underlying framework for semantics of programs. The two orderings of the bilattice reflect the c...
FLOPS
2008
Springer
13 years 9 months ago
2008
Springer
We study various shortcut fusion rules for languages like Haskell. Following a careful semantic account of a recently proposed rule for circular program transformation, we propose ...