… is shared with its program context, the ownership model of separation logic assertions can
… between and its context. And even ignoring the program context, ownership reasoning can …

… The notion of a separation context is central to our theory of data refinement. The most
intuitive explanation of a separation context is that it is a well-behaved client program that does …

… As before, our classifiers are separated into types and refinement types. Moreover, since
contextual objects include LFR contexts, we naturally obtain a refinement relation for objects as …

… We also show that a simulation theorem holds for separation contexts, while this is … separation
context for an abstract module is automatically a separation context for all its refinements. …

… be transformed to a refined model, given the context in which it should run. Currently, each
target context requires its own model transformation. Only a limited number of contexts can be …

… are added to the current context. This is called locale interpretation. In its simplest form, a
locale declaration consists of a sequence of context elements declaring parameters (the …

… context, and thus we have to prove the refinement whatever resource is given. Then we have
the following theorem, which makes the illusion of passing a resource from choose to take. …

… , which is converse to refinement: ϕ refines ψ iff ψ … Refinement hinges on the power of the
context C[−]: what can it observe, and with what can it interfere? The more powerful the context…

… The notion of a separation context is central to our theory of data refinement. The most
intuitive explanation of a separation context is that it is a well-behaved client program that does …

… via window inference in this paper differs from that taken by Grundy [7] in that we
separate programs from predicates and provide explicit mechanisms for handling program …