146 search results - page 8 / 30 » Monotonic Abstraction for Programs with Dynamic Memory Heaps |
TOPLAS
2002
14 years 9 months ago
2002
traction and information hiding K. RUSTAN M. LEINO and GREG NELSON Compaq Systems Research Center er describes an approach for verifying programs in the presence of data abstractio...
IPPS
2000
IEEE
15 years 2 months ago
2000
IEEE
Only a handful of fundamental mechanisms for synchronizing the access of concurrent threads to shared memory are widely implemented and used. These include locks, condition variab...
LFCS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. In order to verify programs with pointer variables, we introduce a temporal logic LTLmem whose underlying assertion language is the quantifier-free fragment of separatio...
CONCUR
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Dynamic separation is a new programming discipline for systems with transactional memory. We study it formally in the setting of a small calculus with transactions. We pr...
OOPSLA
2005
Springer
15 years 3 months ago
2005
Springer
Currently, the most adopted criterion to invoke garbage collection is heap space exhaustion. In other words, garbage collection is invoked when the heap space (either the entire s...