NDLI: Collecting a heap of shapes

Please wait, while we are loading the content...

Expressing and checking intended changes via software change contracts

Efficient and flexible GUI test execution via test merging

Calculating source line level energy information for Android applications

Dynamically validating static memory leak warnings

Variable and thread bounding for systematic testing of multithreaded programs

Using automated program repair for evaluating the effectiveness of fault localization techniques

Selective mutation testing for concurrent code

Orthogonal exploration of the search space in evolutionary test case generation

Does automated white-box test generation really help software testers?

An empirical study of PHP feature usage: a static analysis perspective

Debugging non-deadlock concurrency bugs

Generation of test databases using sampling methods

Product-line verification with feature-oriented contracts

Finding rare numerical stability errors in concurrent computations

Automatically repairing broken workflows for evolving GUI applications

Context-sensitive delta inference for identifying workload-dependent performance bottlenecks

Collecting a heap of shapes

EnforceMOP: a runtime property enforcement system for multithreaded programs

Data model property inference and repair

Faster mutation testing inspired by test prioritization and reduction

Hybrid learning: interface generation through static, dynamic, and symbolic analysis

Comparing non-adequate test suites using coverage criteria

Practical blended taint analysis for JavaScript

Generation of Java programs properties from test purposes

Analysis of performance regression testing data by transaction profiles

Formal safety proof: a real case study in a railway interlocking system

Parallel bounded analysis in code with rich invariants by refinement of field bounds

Semi-valid input coverage for fuzz testing

Combining model checking and testing with an application to reliability prediction and distribution

Griffin: grouping suspicious memory-access patterns to improve understanding of concurrency bugs

SimRacer: an automated framework to support testing for process-level races

F3: fault localization for field failures

Declarative mocking

Optimizing monitoring of finite state properties through monitor compaction

Threats to the validity and value of empirical assessments of the accuracy of coverage-based fault locators

Finding your way in the testing jungle: a learning approach to web security testing

Automated testing with targeted event sequence generation

Practical static race detection for Java parallel loops

Collecting a heap of shapes

Content Provider	ACM Digital Library
Author	Barr, Earl T. Bird, Christian Marron, Mark
Abstract	The program heap is fundamentally a simple mathematical concept --- a set of objects and a connectivity relation on them. However, a large gap exists between the set of heap structures that could be constructed and those that programmers actually build. To understand this gap, we empirically study heap structures and sharing relations in large object-oriented programs. To scale and make sense of real world heaps, any analysis must employ abstraction; our abstraction groups sets of objects by role and the aliasing present in pointer sets. We find that the heaps of real-world programs are, in practice, fundamentally simple structures that are largely constructed from a small number of simple structures and sharing idioms, such as the sharing of immutable or unique (e.g., singleton) objects. For instance, we find that, under our abstraction, 53--75% of pointers build tree structures and we classify all but 7--18% of aliasing pointers. These results provide actionable information for rethinking the design of annotation systems, memory allocation/collection, and program analyses. .
Starting Page	123
Ending Page	133
Page Count	11
File Format	PDF
ISBN	9781450321594
DOI	10.1145/2483760.2483761
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2013-07-15
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Heap structure Dynamic analysis
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Collecting a Heap of Shapes (2011)

Collecting a Heap of Shapes (2011)

Collecting a Heap of Shapes

A dynamic evaluation of the precision of static heap abstractions

Asynchronous assertions

Spencer: interactive heap analysis for the masses

Practical Techniques For Interprocedural Heap Analysis (1996)

ShadowData: shadowing heap objects in Java

Short-term memory for self-collecting mutators

Collecting a heap of shapes

Similar Documents

Collecting a Heap of Shapes (2011)

Collecting a Heap of Shapes (2011)

Collecting a Heap of Shapes

A dynamic evaluation of the precision of static heap abstractions

Asynchronous assertions

Spencer: interactive heap analysis for the masses

Practical Techniques For Interprocedural Heap Analysis (1996)

ShadowData: shadowing heap objects in Java

Short-term memory for self-collecting mutators

Collecting a heap of shapes