634 search results - page 15 / 127 » Separability in the Ambient Logic |
77
Voted
ENTCS
2008
14 years 9 months ago
2008
We formalize higher-order separation logic for a first-order imperative language with procedures and local variables in Isabelle/HOLCF. The assertion language is modeled in such a...
168
click to vote
POPL
2007
ACM
15 years 10 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...
90
Voted
ENTCS
2008
14 years 9 months ago
2008
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
ITP
2010
15 years 1 months ago
2010
We present a formalisation of separation logic which, by avoiding the use of existential quantifiers, allows proofs that only use standard equational rewriting methods as found in...
TFS
2008
14 years 9 months ago
2008
Abstract--Flocking algorithms essentially consist of three components: alignment, cohesion, and separation. To track a desired trajectory, the flock center should move along the de...