Sciweavers

141 search results - page 1 / 29
» Heap Assumptions on Demand
Sort
View
CAV
2008
Springer
152views Hardware» more  CAV 2008»
13 years 6 months ago
Heap Assumptions on Demand
Termination of a heap-manipulating program generally depends on preconditions that express heap assumptions (i.e., assertions describing reachability, aliasing, separation and shar...
Andreas Podelski, Andrey Rybalchenko, Thomas Wies
APLAS
2010
ACM
13 years 2 months ago
Live Heap Space Bounds for Real-Time Systems
Live heap space analyses have so far been concerned with the standard sequential programming model. However, that model is not very well suited for embedded real-time systems, wher...
Martin Kero, Pawel Pietrzak, Johan Nordlander
OOPSLA
2010
Springer
13 years 3 months ago
Symbolic heap abstraction with demand-driven axiomatization of memory invariants
Heap Abstraction with Demand-Driven Axiomatization of Memory Invariants Isil Dillig Thomas Dillig Alex Aiken Stanford University lig Thomas Dillig Alex Aiken Symbolic Heap Abstract...
Isil Dillig, Thomas Dillig, Alex Aiken
ASPLOS
2006
ACM
13 years 8 months ago
Comprehensively and efficiently protecting the heap
The goal of this paper is to propose a scheme that provides comprehensive security protection for the heap. Heap vulnerabilities are increasingly being exploited for attacks on co...
Mazen Kharbutli, Xiaowei Jiang, Yan Solihin, Guru ...
PUC
2006
78views more  PUC 2006»
13 years 4 months ago
Supporting ordering and consistency in a distributed Event Heap for Ubiquitous Computing
Abstract. The Stanford Event Heap has been shown to provide appropriate support for constructing interactive workspace applications. Given this success it is natural to consider th...
Oliver Storz, Adrian Friday, Nigel Davies