Asynchronous Programming in a Prioritized Form

TL;DR

This paper introduces a new, simple model for asynchronous programming that uses a context-free grammar and operational semantics, simplifying priority assignment and aiding bug detection.

Contribution

The paper presents a novel asynchronous programming model combining a context-free grammar with operational semantics, enhancing simplicity and expressiveness over existing models.

Findings

Model simplifies priority assignment for posted methods.

Uses singly linked list to simulate prioritized execution.

Facilitates analysis algorithms for bug detection.

Abstract

Asynchronous programming has appeared as a programming style that overcomes undesired properties of concurrent programming. Typically in asynchronous models of programming, methods are posted into a post list for latter execution. The order of method executions is serial, but nondeterministic. This paper presents a new and simple, yet powerful, model for asynchronous programming. The proposed model consists of two components; a context-free grammar and an operational semantics. The model is supported by the ability to express important applications. An advantage of our model over related work is that the model simplifies the way posted methods are assigned priorities. Another advantage is that the operational semantics uses the simple concept of singly linked list to simulate the prioritized process of methods posting and execution. The simplicity and expressiveness make it relatively easy for analysis algorithms to disclose the otherwise un-captured programming bugs in asynchronous programs.