Interleaving is Possible with Refined Abstract Machines: A New Approach to Engineering a Compiler
| dc.contributor.author | Ganz, Steven; Friedman, Daniel | |
| dc.date.accessioned | 2025-11-11T23:53:39Z | |
| dc.date.available | 2025-11-11T23:53:39Z | |
| dc.date.issued | 2001-08 | |
| dc.description.abstract | 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. | |
| dc.identifier.uri | https://hdl.handle.net/2022/34394 | |
| dc.relation.ispartofseries | Indiana University Computer Science Technical Reports; TR552 | |
| dc.rights | This work is protected by copyright unless stated otherwise. | |
| dc.rights.uri | ||
| dc.title | Interleaving is Possible with Refined Abstract Machines: A New Approach to Engineering a Compiler |
Files
Original bundle
1 - 1 of 1
Collections
Can’t use the file because of accessibility barriers? Contact us