122 search results - page 7 / 25 » Completeness of Pointer Program Verification by Separation L... |
101
click to vote
ICFP
2006
ACM
16 years 1 months ago
2006
ACM
In previous work, we proposed a Hoare Type Theory (HTT) which combines effectful higher-order functions, dependent types and Hoare Logic specifications into a unified framework. H...
131
click to vote
FCSC
2010
14 years 10 months ago
2010
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...
POPL
2010
ACM
15 years 10 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...
136
click to vote
CONCUR
2011
Springer
14 years 1 months ago
2011
Springer
Abstract. In 2004, Berdine, Calcagno and O’Hearn introduced a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. They showed th...
131
click to vote
ECOOP
2010
Springer
15 years 4 months ago
2010
Springer
Specifications of Object-Oriented programs conventionally employ Boolean expressions of the programming language for assertions. Programming errors can be discovered by checking at...