116 search results - page 4 / 24 » Heap-Dependent Expressions in Separation Logic |
POPL
2010
ACM
14 years 4 months ago
2010
ACM
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...
AMAST
2006
Springer
13 years 11 months ago
2006
Springer
This paper proposes a modal extension of Separation Logic [8, 11] for reasoning about data-parallel programs that manipulate heap allocated linked data structures. Separation Logi...
RULEML
2005
Springer
14 years 29 days ago
2005
Springer
In this paper we evolve a rule based approach to SLA representation and management which allows separating the contractual business logic from the application logic and enables aut...
PADL
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. A lightweight approach to debugging functional logic programs by observations is presented, implemented for the language Curry. The Curry Object Observation System (COOSy...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, πcalculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place...