Accession Number : ADA112492

Title :   On Program Transformations for Abstract Data Types and Concurrency,

Corporate Author : STANFORD UNIV CA DEPT OF COMPUTER SCIENCE

Personal Author(s) : Pepper,P

PDF Url : ADA112492

Report Date : Oct 1981

Pagination or Media Count : 38

Abstract : We study transformation rules for a particular class of abstract data types, namely types that are representable by recursive mode declarations. The transformations are tailored to the development of efficient tree traversal and they allow for concurrency. The techniques are exemplified by an implementation of concurrent insertion and deletion in 2-3-trees. (Author)

Descriptors :   *Computer programming, *Transformations(Mathematics), *Data bases, Recursive functions, Order disorder transformations, Optimization, Multiprocessors, Algorithms

Subject Categories : Theoretical Mathematics
      Computer Programming and Software
      Computer Hardware

Distribution Statement : APPROVED FOR PUBLIC RELEASE