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

dc.contributor.authorGanz, Steven; Friedman, Daniel
dc.date.accessioned2025-11-11T23:53:39Z
dc.date.available2025-11-11T23:53:39Z
dc.date.issued2001-08
dc.description.abstractWe 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.
dc.identifier.urihttps://hdl.handle.net/2022/34394
dc.relation.ispartofseriesIndiana University Computer Science Technical Reports; TR552
dc.rightsThis work is protected by copyright unless stated otherwise.
dc.rights.uri
dc.titleInterleaving is Possible with Refined Abstract Machines: A New Approach to Engineering a Compiler

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
TR552.pdf
Size:
223.68 KB
Format:
Adobe Portable Document Format
Can’t use the file because of accessibility barriers? Contact us