Posting Graphs for Finding Non-Terminating Executions in Asynchronous Programs

Citation:
El-Zawawy, M. A., "Posting Graphs for Finding Non-Terminating Executions in Asynchronous Programs", Proceedings of The 17th International Conference on Computational Science and Its Applications, Trieste, Italy, July 3-6, 2017.

Date Presented:

July 3-6, 2017

Abstract:

Asynchronous programming is one of the currently dominant programming techniques. The key idea of asynchronous programming is to use a queue to post computations as tasks (events). This queue is used then by the application to pick events asynchronously for processing. Asynchronous programming was found very convenient for achieving a massive percentage of software systems used today such as Gmail and Facebook which are Web 2.0 JavaScript ones.

This paper presents a novel technique for searching for nonterminating executions in asynchronous programming. The targeted cases of nontermination are those caused by the posting concept. The proposed technique is based on graphical representation for posting behaviours of asynchronous programs. Proofs for termination and correctness of the proposed method is outlined in the paper.

Related External Link

Tourism