394 search results - page 8 / 79 » Formal polytypic programs and proofs |
TPHOL
2003
IEEE
14 years 1 months ago
2003
IEEE
Abstract. It is well known that mathematical proofs often contain (abstract) algorithms, but although these algorithms can be understood by a human, it still takes a lot of time an...
ICFP
1999
ACM
14 years 7 days ago
1999
ACM
Programs are often structured around the idea that different pieces of code comprise distinct principals, each with a view of its environment. Typical examples include the module...
IFIP
2004
Springer
14 years 1 months ago
2004
Springer
Abstract The computational proof model of Bellare and Rogaway for cryptographic protocol analysis is complemented by providing a formal specification of the actions of the adversa...
POPL
2007
ACM
14 years 8 months ago
2007
ACM
This paper contributes to the development of techniques for the modular proof of programs that include concurrent algorithms. We present a proof of a non-blocking concurrent algor...
CCS
2004
ACM
14 years 1 months ago
2004
ACM
Information flow type systems provide an elegant means to enforce confidentiality of programs. Using the proof assistant Isabelle/HOL, we have machine-checked a recent work of B...