Files:DescriptionFile size FormatBrowse
Fulltext0.55 MBPDF (requires Acrobat Reader)Previous | Next
PostScript
  
Authors:Mikhail Auguston: Computer Science Department, New Mexico State University, USA
Miu Har Hon: Computer Science Department, New Mexico State University, USA
Publication title:Assertions for Dynamic Shape Analysis of List Data Structures
Conference:Proceedings of the 3rd International Workshop on Automatic Debugging; 1997 (AADEBUG-97)
Publication type: Abstract and Fulltext
Issue:001
Article No.:004
Abstract:We introduce an assertion language for run-time checking of linked list data structure shapes. The assertion language is expressive enough to define characteristic predicates for data structures created with the use of pointers and dynamic memory allocation. Examples of such data structures include singly linked list; binary tree; doubly linked list; and cyclic list. These characteristic predicates may be used for automatic run-time detection of data constraint violations. Some results of experiments with a prototype assertion checker implementation for the PASCAL programming language are presented.
Language:English
Year:1997
No. of pages:6
Pages:37-42
Series:Linköping Electronic Conference Proceedings
ISSN (print):1650-3686
ISSN (online):1650-3740
File:http://www.ep.liu.se/ea/cis/1997/009/04/cis9700904.pdf
Available:1997-09-10
Publisher:Linköping University Electronic Press; Linköpings universitet

REFERENCE TO THIS PAGE
Mikhail Auguston, Miu Har Hon (1997). Assertions for Dynamic Shape Analysis of List Data Structures, Proceedings of the 3rd International Workshop on Automatic Debugging; 1997 (AADEBUG-97) http://www.ep.liu.se/ecp_article/index.en.aspx?issue=001;article=004 (accessed 10/1/2014)