122 search results - page 8 / 25 » Completeness of Pointer Program Verification by Separation L... |
TPHOL
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract. Lightweight separation is a novel approach to automatic reasoning about memory updates in pointer programs. It replaces the spatial formulae of separation logic, which co...
FASE
2000
Springer
13 years 11 months ago
2000
Springer
A proof system is presented for the verification and derivation of object oriented programs with as main features strong typing, dynamic binding, and inheritance. The proof system...
POPL
2004
ACM
14 years 8 months ago
2004
ACM
We investigate proof rules for information hiding, using the recent formalism of separation logic. In essence, we use the separating conjunction to partition the internal resource...
POPL
2005
ACM
14 years 8 months ago
2005
ACM
A lightweight logical approach to race-free sharing of heap storage between concurrent threads is described, based on the notion of permission to access. Transfer of permission be...
ISSTA
2012
ACM
11 years 10 months ago
2012
ACM
Use-after-free vulnerabilities are rapidly growing in popularity, especially for exploiting web browsers. Use-afterfree (and double-free) vulnerabilities are caused by a program o...