796 search results - page 86 / 160 » An Overview of Separation Logic |
81
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Abstract. We consider a simple model of higher order, functional computations over the booleans. Then, we enrich the model in order to encompass non-termination and unrecoverable e...
107
click to vote
ESOP
2004
Springer
15 years 6 months ago
2004
Springer
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
214
Voted
LCC
1994
15 years 4 months ago
1994
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
106
Voted
MOBICOM
2009
ACM
15 years 7 months ago
2009
ACM
A growing number of mobile computing applications are centered around the user’s location. The notion of location is broad, ranging from physical coordinates (latitude/longitude...
WWW
2001
ACM
16 years 1 months ago
2001
ACM
This paper presents a guided tour system for the WWW. It is a module for the Webvise open hypermedia system that implements the ideas of trails and guided tours, originating from ...