A type system for reachability and acyclicity

  • Authors:
  • Yi Lu;John Potter

  • Affiliations:
  • Programming Languages and Compilers Group, School of Computer Science and Engineering, The University of New South Wales, Sydney, Australia;Programming Languages and Compilers Group, School of Computer Science and Engineering, The University of New South Wales, Sydney, Australia

  • Venue:
  • ECOOP'05 Proceedings of the 19th European conference on Object-Oriented Programming
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

The desire for compile-time knowledge about the structure of heap contexts is currently increasing in many areas. However, approaches using whole program analysis are too weak in terms of both efficiency and accuracy. This paper presents a novel type system that enforces programmer-defined constraints on reachability via references or pointers, and restricts reference cycles to be within definable parts of the heap. Such constraints can be useful for program understanding and reasoning about effects and invariants, for information flow security, and for run-time optimizations and memory management.