1794 search results - page 72 / 359 » Visualizing Memory Graphs |
96
Voted
CAV
2008
Springer
15 years 4 months ago
2008
Springer
c Abstraction for Programs with Dynamic Memory Heaps Parosh Aziz Abdulla1 , Ahmed Bouajjani2 , Jonathan Cederberg1 , Fr
115
click to vote
ICSM
2009
IEEE
15 years 9 months ago
2009
IEEE
Many of the problems that occur in long-running systems involve the way that the system uses memory. We have developed a framework for extracting and building a model of the heap ...
146
Voted
SIAMCOMP
2000
15 years 2 months ago
2000
This paper describes a scheme to implement a shared address space of size m on an n-node mesh, with m polynomial in n, where each mesh node hosts a processor and a memory module. A...
150
Voted
IPPS
2010
IEEE
14 years 12 months ago
2010
IEEE
Abstract--Ensuring the correctness of complex implementations of software transactional memory (STM) is a daunting task. Attempts have been made to formally verify STMs, but these ...
107
Voted
TSMC
1998
15 years 2 months ago
1998
: This paper presents a procedure for automatically drawing directed graphs. Our system, CG, uses a unique clan-based graph decomposition to determine intrinsic substructures (clan...