A Semantics for Disciplined Concurrency in COP

Matteo Busi, Pierpaolo Degano, Letterio Galletta
2016 Italian Conference on Theoretical Computer Science  
A concurrent extension of the recent COP language ML CoDa is presented. We formalise its operational semantics and we propose a run time verification mechanism that enforces a notion of non-interference among concurrent threads. More precisely, this mechanism prevents an application from modifying the context so as to dispose some resources or to contradict assumptions upon which other applications rely. Partially supported by the Università di Pisa PRA_2016_64 Project Through the fog.
dblp:conf/ictcs/BusiDG16 fatcat:73aq2wxr6zblpps7hc5soq7dgi