• autonomic computing
• concurrency
• context-oriented programming
• formal methods
• functional programming
• ml
• mlcoda
• programming languages
• runtime analysis
• semantics
• static analysis
• type and effect systems

Autonomic systems need to be able to seamlessly adapt to changes in the environment they are immersed in, with minimal (or any) human intervention.
Of the many approaches proposed over the years to implement those systems one of the most promising is context-oriented programming (COP).
The idea in the COP approach is to provide programming languages with context-adaptation constructs, to facilitate programmer's work in writing software able to adapt.
An interesting challenge for COP languages is to introduce primitives for concurrency.

In this thesis, we will enrich ML_CoDa, a context-oriented programming language constituted by a declarative component for programming the context and a functional one for computing, with concurrency.
To do that, we will introduce four alternative concurrent semantics and their correspondent runtime verification mechanisms, differing each other in their ability to forecast possible harmful behaviour of applications.
Some theorems will also show the relationships among those four semantics.