New Mechanisms for Invocation Handling in Concurrent Programming Languages

Invocation handling mechanisms in many concurrent languages have signiicant limitations that make it diicult or costly to solve common programming situations encountered in program visu-alization, debugging, and scheduling scenarios. This paper discusses these limitations, introduces new language mechanisms aimed at remedying these limitations, and presents an implementation of the new mechanisms. The examples are given in SR; the new mechanisms and implementation are an extension of SR and its implementation. However, these new mechanisms are applicable to other concurrent languages. They can augment or replace current invocation handling mechanisms.