1894 search results - page 298 / 379 » A TLA Proof System |
255
click to vote
EUROPKI
2009
Springer
15 years 1 months ago
2009
Springer
Efficient zero-knowledge proofs of knowledge (ZK-PoK) are basic building blocks of many cryptographic applications such as identification schemes, group signatures, and secure mult...
206
click to vote
PEPM
2007
ACM
17 years 1 months ago
2007
ACM
programming languages community is vigorously pursuing ways to incorporate F!-style indexed types into programming languages. This paper advocates Concoqtion, a practical approach ...
234
click to vote
POPL
2008
ACM
16 years 4 months ago
2008
ACM
Contracts are behavioural descriptions of Web services. We devise a theory of contracts that formalises the compatibility of a client to a service, and the safe replacement of a s...
203
click to vote
POPL
2001
ACM
16 years 4 months ago
2001
ACM
By combining existing type systems with standard typebased compilation techniques, we describe how to write strongly typed programs that include a function that acts as a tracing ...
123
click to vote
ICFP
2004
ACM
16 years 3 months ago
2004
ACM
We present a process logic for the -calculus with the linear/affine type discipline (Berger et al. 2001; Berger et al. 2003; Honda and Yoshida 2002; Honda and Yoshida 2003; Honda ...