Analyzing stores and references in a parallel symbolic language

  • Authors:
  • Suresh Jagannathan;Stephen Weeks

  • Affiliations:
  • Computer Science Division, NEC Research Institute, Princeton, NJ;Dept. of Computer Science, Carnegie Mellon University, Pittsburgh, PA

  • Venue:
  • LFP '94 Proceedings of the 1994 ACM conference on LISP and functional programming
  • Year:
  • 1994

Quantified Score

Hi-index 0.00

Visualization

Abstract

We describe an analysis of a parallel language in which processes communicate via first-class mutable shared locations. The sequential core of the language defines a higher-order strict functional language with list data structures. The parallel extensions permit processes and shared locations to be dynamically created; synchronization among processes occurs exclusively via shared locations.The analysis is defined by an abstract interpretation on this language. The interpretation is efficient and useful, facilitating a number of important optimizations related to synchronization, processor/thread mapping, and storage management.