NDLI: Node-Set Analysis for Linked Recursive Data Structures

Content Provider	IEEE Xplore Digital Library
Author	Zhenhao Tang Hanfei Wang Bin Li Juan Zhai Jianhua Zhao Xuandong Li
Copyright Year	2015
Description	Author affiliation: Dept. of Comput. Sci. & Technol., Nanjing Univ., Nanjing, China (Zhenhao Tang; Hanfei Wang; Bin Li; Juan Zhai; Jianhua Zhao; Xuandong Li)
Abstract	The technique presented in this paper concerns the problem of how to automatically obtaining the specification of the resulting set of reachable nodes, after destructive operations over the data structure. Our work has two main contributions. First, we represent the node sets by expressions at pre-states, which facilitates the process of proving complex formulas efficiently. Second, we propose an improved version of the fold/unfold technique, which handles more general cases. Our approach is based on the observation that structure-update statements manipulate recursive data structures in a slice-and-splice way: the original data structures are sliced into several disjoint segments and these segments are further spliced into new data structures. Case studies on typical data structures show that our approach is effective and practical.
Starting Page	59
Ending Page	64
File Size	208924
Page Count	6
File Format	PDF
e-ISBN	9781467379892
DOI	10.1109/QRS.2015.19
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-08-03
Publisher Place	Canada
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Algorithm design and analysis Shape Binary search trees Software Cognition
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

Binary search tree visualization algorithm

Binary search trees for vector quantisation

Concurrent search and insertion in K-Dimensional Height Balanced Trees

A new non-recursive algorithm for binary search tree traversal

Tree structures for partial match retrieval

A fast selective traversal algorithm for binary search trees

An optimization design of knowledge reasoning machine based on the binary tree

Zero-Suppressed BDDs for Set Manipulation in Combinatorial Problems

Description logics for shape analysis

Node-Set Analysis for Linked Recursive Data Structures

Similar Documents

Binary search tree visualization algorithm

Binary search trees for vector quantisation

Concurrent search and insertion in K-Dimensional Height Balanced Trees

A new non-recursive algorithm for binary search tree traversal

Tree structures for partial match retrieval

A fast selective traversal algorithm for binary search trees

An optimization design of knowledge reasoning machine based on the binary tree

Zero-Suppressed BDDs for Set Manipulation in Combinatorial Problems

Description logics for shape analysis

Node-Set Analysis for Linked Recursive Data Structures