Filters








13,257 Hits in 2.9 sec

Shape Analysis of Single-Parent Heaps [chapter]

Ittai Balaban, Amir Pnueli, Lenore D. Zuck
Lecture Notes in Computer Science  
We define the class of single-parent heap systems, which rely on a singly-linked heap in order to model destructive updates on tree structures.  ...  It is then possible to apply shape analysis by predicate and ranking abstraction as in [2] .  ...  * (x, r) → ¼ ¬parent * (x, Unordered Single-Parent Heaps We now formally define the class of single-parent heap systems.  ... 
doi:10.1007/978-3-540-69738-1_7 dblp:conf/vmcai/BalabanPZ07 fatcat:dwyagfwxhzc7tk2q2dfootis2i

Dynamic shape analysis via degree metrics

Maria Jump, Kathryn S. McKinley
2009 Proceedings of the 2009 international symposium on Memory management - ISMM '09  
Uses of dynamic shape analysis include helping programmers find data structure errors during development, generating assertions for verification with static or dynamic analysis, and detecting subtle errors  ...  We implement dynamic shape analysis in a Java Virtual Machine (JVM).  ...  A fully accurate dynamic shape analysis requires analysis of the heap after every pointer mutation which is extremely costly.  ... 
doi:10.1145/1542431.1542449 dblp:conf/iwmm/JumpM09 fatcat:johbyko3bjantebj5smnvkrgum

Shape analysis with inductive recursion synthesis

Bolei Guo, Neil Vachharajani, David I. August
2007 Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation - PLDI '07  
For program optimization and verification purposes, shape analysis can be used to statically determine structural properties of the runtime heap.  ...  that takes advantage of the results of our shape analysis. i Acknowledgments This thesis is a direct result of the vision of my advisor David I.  ...  Introduction Shape analysis is a type of memory analysis that discovers deep properties of the runtime heap.  ... 
doi:10.1145/1250734.1250764 dblp:conf/pldi/GuoVA07 fatcat:ovl3pyb4p5dzhmudly3rqj4rku

Verification of multi-linked heaps

Ittai Balaban, Amir Pnueli, Yaniv Sa'ar, Lenore D. Zuck
2012 Journal of computer and system sciences (Print)  
Multi-linked to single-parent heap transformation. of the same property, independent of its application to shape-analysis examples.  ...  We propose a framework for shape analysis of single-parent heaps based on a small model property of a restricted class of firstorder assertions with transitive closure.  ...  The first establishes that well-formed non-sharing multi-linked states are S-mapped into well-formed single-parent heap states and vice versa.  ... 
doi:10.1016/j.jcss.2011.08.003 fatcat:vyrhpvj5vnfpfblyyq23so3dl4

Shape Refinement through Explicit Heap Analysis [chapter]

Dirk Beyer, Thomas A. Henzinger, Grégory Théoduloz, Damien Zufferey
2010 Lecture Notes in Computer Science  
The approach uses two techniques to guide the refinement of shape abstractions: (1) during program exploration, an explicit heap analysis collects sample instances of the heap structures, which are used  ...  We present a stepwise approach to the selection of instrumentation predicates for a TVLA-based shape analysis, which takes us a step closer towards the fully automatic verification of data structures.  ...  The result of HeapToShape has a single shape graph for each shape class that results from applying the newly refined SCG to the current tracking definitions.  ... 
doi:10.1007/978-3-642-12029-9_19 fatcat:o4t5abrmlnbzvcdobjjupybmzm

MemPick: A tool for data structure detection

Istvan Haller, Asia Slowinska, Herbert Bos
2013 2013 20th Working Conference on Reverse Engineering (WCRE)  
By analyzing the evolution of the heap during program execution, it identifies and classifies the most commonly used data structures, such as singly-or doubly-linked lists, many types of trees (e.g., AVL  ...  We evaluated MemPick on a wide variety of popular libraries and real world applications with great success.  ...  Shape analysis The last challenge consists of the shape analysis itself.  ... 
doi:10.1109/wcre.2013.6671327 dblp:conf/wcre/HallerSB13a fatcat:uabqixi5gbdd7a24kg2arl4zym

Abstraction for Shape Analysis with Fast and Precise Transformers [chapter]

Tal Lev-Ami, Neil Immerman, Mooly Sagiv
2006 Lecture Notes in Computer Science  
In particular, the worst case complexity of computing a single successor abstract state is O(V log V ) where V is the number of program variables.  ...  We present an efficient algorithm that computes the effect of low level heap mutations in the most precise way. The algorithm does not rely on the usage of a theorem prover.  ...  New Abstraction of Heap Shape In Sect. 3, we present our simple abstraction for heaps based on contracting segments of the heap into a single summary-node.  ... 
doi:10.1007/11817963_49 fatcat:qqzj6lfccvfgpazoy4nnl4xlwu

Reduced Product Combination of Abstract Domains for Shapes [chapter]

Antoine Toubhans, Bor-Yuh Evan Chang, Xavier Rival
2013 Lecture Notes in Computer Science  
From the static analysis point of view, we must obtain several interlocking shape invariants.  ...  As an example, we present simultaneous separating shape graphs, a product construction that combines instances of separation logic-based shape domains.  ...  For each analysis, the table shows the number of LOCs, the mode (analysis with no reduced product -no r.p.-, using a monolithic domain, with a single inductive definition, or with a reduced product and  ... 
doi:10.1007/978-3-642-35873-9_23 fatcat:52fwich2uvh3pisfd42cytdney

Alternatives to two classic data structures

Chris Okasaki
2005 Proceedings of the 36th SIGCSE technical symposium on Computer science education - SIGCSE '05  
Red-black trees and leftist heaps are classic data structures that are commonly taught in Data Structures (CS2) and/or Algorithms (CS7) courses.  ...  Unlike leftist heaps, maxiphobic heaps place no restrictions on the shape of the binary tree-a maxiphobic heap can be arbitrarily unbalanced in any direction.  ...  Elements can be inserted into a heap, and the minimum element in a heap can be inspected or removed. In addition, two heaps can be merged into a single heap.  ... 
doi:10.1145/1047344.1047407 dblp:conf/sigcse/Okasaki05 fatcat:uklfgd2uubhubci7hn2uxfqdpy

Alternatives to two classic data structures

Chris Okasaki
2005 ACM SIGCSE Bulletin  
Red-black trees and leftist heaps are classic data structures that are commonly taught in Data Structures (CS2) and/or Algorithms (CS7) courses.  ...  Unlike leftist heaps, maxiphobic heaps place no restrictions on the shape of the binary tree-a maxiphobic heap can be arbitrarily unbalanced in any direction.  ...  Elements can be inserted into a heap, and the minimum element in a heap can be inspected or removed. In addition, two heaps can be merged into a single heap.  ... 
doi:10.1145/1047124.1047407 fatcat:m6jfrwxnwjcdnm4iy43jq5dz7i

MemPick: High-level data structure detection in C/C++ binaries

Istvan Haller, Asia Slowinska, Herbert Bos
2013 2013 20th Working Conference on Reverse Engineering (WCRE)  
By analyzing how links between memory objects evolve throughout the program execution, it distinguishes between many commonly used data structures, such as singly-or doubly-linked lists, many types of  ...  Specifically, we aim for instructions that modify links in heap objects of a single type.  ...  Since a threaded child pointer keeps all nodes of the tree connected, it forms a single element overlapping structure. Observe that it has the shape of a binary parent tree.  ... 
doi:10.1109/wcre.2013.6671278 dblp:conf/wcre/HallerSB13 fatcat:ec2bjx3ycjf5rg4znbxyscuo5q

Programming pearls

Jon Bentley
1985 Communications of the ACM  
The Shape and Order properties represent a different kind of invariant: they are invariant properties of the heap data structure.  ...  Because the Shape property is guaranteed by the representation, from now on we'll use the name Heap to mean that the value in any node is greater than or equal to the value in its parent.  ... 
doi:10.1145/3166.315010 fatcat:5omhqu35lractgzjelsf6vgmwe

Precise shape analysis using field sensitivity

Sandeep Dasgupta, Amey Karkare, Vinay Kr Reddy
2013 Innovations in Systems and Software Engineering  
We present a static shape analysis technique to infer the shapes of the heap structures created by a program at run time.  ...  The shapes of the heap structures are computed using two components: (a) Boolean functions that capture the shape transitions due to the update of a field in a structure, and (b) through path matrices  ...  Hackett and Rugina in [14] presented a new approach for shape analysis which reasons about the state of a single heap location independently.  ... 
doi:10.1007/s11334-013-0198-7 fatcat:fmvpwh7elvdt7dftochqtwfvkm

Abstracting Runtime Heaps for Program Understanding [article]

Mark Marron and Cesar Sanchez and Zhendong Su and Manuel Fahndrich
2012 arXiv   pre-print
The abstract model is designed to emphasize high-level concepts about heap-based data structures, such as shape and size, as well as relationships between heap structures, such as sharing and connectivity  ...  We demonstrate the utility and computational tractability of the abstract heap model by building a memory profiler.  ...  Acknowledgments We would like to thank Peli de Halleux for setting up the online demo code at RiSE4fun, Chris Lovett for his help with DGML, and Todd Mytkowicz for his insight into some of the code in  ... 
arXiv:1201.1327v1 fatcat:ced5e5tf7vdeddj56xmea3u27y

ad-heap

Weifeng Liu, Brian Vinter
2014 Proceedings of Workshop on General Purpose Processing Using GPUs  
parent node and its child nodes must be executed sequentially, and (2) heaps, even d -heaps (d -ary heaps or d -way heaps), cannot supply enough wide data parallelism to these processors.  ...  Recent research proposed more versatile asymmetric multicore processors (AMPs) that consist of two types of cores (latency-oriented cores with high single-thread performance and throughput-oriented cores  ...  Otherwise, the single SIMD thread stores the new indices and values of both of the parent node and the child node to the bridge.  ... 
doi:10.1145/2576779.2576786 fatcat:addip2tarzes7em7wyl5zy6z7y
« Previous Showing results 1 — 15 out of 13,257 results