Indiana University Bloomington

School of Informatics and Computing

Technical Report TR552:
Interleaving is Possible with Refined Abstract Machines: A New Approach to Engineering a Compiler

Steven E. Ganz and Daniel P. Friedman
(Aug 2001), 17 pages
We study abstract machines as a perspective from which to better approach the development of complex systems. We believe that abstract machines provide a form of modularity that has been largely under-appreciated, and that has the potential to yield varied and substantial benefits. An important notion in exploring the interaction of abstract machines is one of refinement of one machine by another, which provides the ability for processes, threads, programs, or even single instructions from several abstract machines to share processors and data.

Available as: