Using Category Theory and Data Flow Analysis for Modeling and Verifying Properties of Communications in the Process-Oriented Language Erasmus

Abstract

The increasing significance of concurrency and the need to address the challenges presented by concurrency motivate its formalization. In this paper, a methodology for modeling and verifying communications in a concurrent system developed in Erasmus, a process-oriented programming language, is proposed. The innovative aspects of this methodology include the use of category theory to model and verify properties of communications in Erasmus, and the use of data flow to analyze and abstract an implementation of Erasmus. The methodology is illustrated by a simple example.