3573 search results - page 297 / 715 » Reasoning about Codata |
275
click to vote
POPL
2008
ACM
16 years 5 months ago
2008
ACM
Conventional specifications for object-oriented (OO) programs must adhere to behavioral subtyping in support of class inheritance and method overriding. However, this requirement ...
242
click to vote
POPL
2007
ACM
16 years 5 months ago
2007
ACM
We present a formal model of memory that both captures the lowlevel features of C's pointers and memory, and that forms the basis for an expressive implementation of separati...
138
click to vote
CADE
2006
Springer
16 years 5 months ago
2006
Springer
The HOL Light prover is based on a logical kernel consisting of about 400 lines of mostly functional OCaml, whose complete formal verification seems to be quite feasible. We would ...
147
click to vote
CADE
2004
Springer
16 years 5 months ago
2004
Springer
Abstract. Automated tools for finding attacks on flawed security protocols often struggle to deal with protocols for group key agreement. Systems designed for fixed 2 or 3 party pr...
137
click to vote
CADE
2002
Springer
16 years 5 months ago
2002
Springer
The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in not just the theoretical computer science community, but also in areas where practical s...