Sciweavers

634 search results - page 26 / 127
» Separability in the Ambient Logic
Sort
View
FCSC
2010
170views more  FCSC 2010»
14 years 7 months ago
Formal verification of concurrent programs with read-write locks
Abstract Read-write locking is an important mechanism to improve concurrent granularity, but it is difficult to reason about the safety of concurrent programs with read-write locks...
Ming Fu, Yu Zhang, Yong Li
71
Voted
POPL
2010
ACM
15 years 7 months ago
Structuring the verification of heap-manipulating programs
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...
Aleksandar Nanevski, Josh Berdine, Viktor Vafeiadi...
TPHOL
2009
IEEE
15 years 4 months ago
A Formalisation of Smallfoot in HOL
In this paper a general framework for separation logic inside the HOL theorem prover is presented. This framework is based on Abeparation Logic. It contains a model of an abstract,...
Thomas Tuerk
ESOP
2010
Springer
15 years 7 months ago
Separating Shape Graphs
Detailed memory models that expose individual fields are necessary to precisely analyze code that makes use of low-level aspects such as, pointers to fields and untagged unions. Ye...
Vincent Laviron, Bor-Yuh Evan Chang and Xavier Riv...
COMPSAC
2006
IEEE
15 years 3 months ago
An Approach for Developing Adaptive, Mobile Applications with Separation of Concerns
Modern mobile computing paradigms have set new challenges for the development of distributed mobile applications and services. Because of the variability which characterizes the c...
Nearchos Paspallis, George A. Papadopoulos