Files: Description File size Format
Fulltext PDF (requires Acrobat Reader)
Fulltext PostScript (requires a PostScript Reader)
   
Authors: Mikhail Auguston and Miu Har Hon
Article title: Assertions for Dynamic Shape Analysis of List Data Structures
Conference: AADEBUG'97. Proceedings of the Third International Workshop on Automatic Debugging: Linköping, Sweden, May 26-27, 1997
Publ. type: Article
Article No: 4
Language: English
Abstract [en]:

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.

PDF
Publisher: Linköping University Electronic Press
Year: 1997
Available: 1997-09-10
No. of pages: 6
Pages: 37-42
Series: Linköping Electronic Articles in Computer and Information Science
ISSN: 1401-9841
Volume: 2
No: 009
Series: Linköping Electronic Conference Proceedings
ISSN (print): 1650-3686
ISSN (online): 1650-3740
Issue: 1
REFERENCE TO THIS PAGE:
Auguston, Mikhail and Hon, Miu Har (1997). Assertions for Dynamic Shape Analysis of List Data Structures in Linköping Electronic Articles in Computer and Information Science, Vol. 2, No. 009:04. http://www.ep.liu.se/ea/cis/1997/009/04/. ()