4224 search results - page 774 / 845 » Reasoning about Choice |
182
click to vote
POPL
2007
ACM
15 years 11 months ago
2007
ACM
We present a model of recursive and impredicatively quantified types with mutable references. We interpret in this model all of the type constructors needed for typed intermediate...
206
Voted
POPL
2006
ACM
15 years 11 months ago
2006
ACM
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
186
click to vote
POPL
2006
ACM
15 years 11 months ago
2006
ACM
The TCP/IP protocols and Sockets API underlie much of modern computation, but their semantics have historically been very complex and ill-defined. The real standard is the de fact...
176
click to vote
POPL
2006
ACM
15 years 11 months ago
2006
ACM
We describe a novel method for verifying programs that manipulate linked lists, based on two new predicates that characterize reachability of heap cells. These predicates allow re...
174
click to vote
POPL
2005
ACM
15 years 11 months ago
2005
ACM
A lightweight logical approach to race-free sharing of heap storage between concurrent threads is described, based on the notion of permission to access. Transfer of permission be...