A technique for generating graphical abstractions of program data structures

3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Representing abstract data structures in a real programming language is a key step of algorithm implementation and often requires programmers to introduce language-dependent details irrelevant for both a high-level analysis of the code and algorithm comprehension. In this paper we present a logic-based technique for recovering from the loss of abstraction related to the implementation process in order to create intuitive high-level pictorial representations of data structures, useful for program debugging, research and educational purposes.

Cite

CITATION STYLE

APA

Demetrescu, C., & Finocchi, I. (1999). A technique for generating graphical abstractions of program data structures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1614, pp. 785–792). Springer Verlag. https://doi.org/10.1007/3-540-48762-x_97

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free