X-Klaim Is Back

Abstract

Klaim is a coordination language specifically designed to model and program distributed systems consisting of mobile components interacting through multiple distributed tuple spaces. The Klaim's theoretical foundations provided a solid ground for the implementation of the Klaim's programming model. To practically program Klaim-based applications, the X-Klaim programming language has been proposed. It extends Klaim with enriched primitives and standard control flow constructs, and is compiled in Java to be executed. However, due to the limits of X-Klaim in terms of usability and the aging of the technology at the basis of its compiler, X-Klaim has been progressively neglected. Motivated by the success that Klaim has gained, the popularity that still has in teaching distributed computing, and its possible future exploitations in the development of modern ICT systems, in this paper we propose a renewed and enhanced version of X-Klaim. The new implementation, coming together with an Eclipse-based IDE tooling, relies on recent powerful frameworks for the development of programming languages.

Coordinating and programming multiple ROS-based robots with X-KLAIM

“…For this reason, we also developed X -K laim, a domain-specific language (DSL) closer to K laim also providing typical high-level programming constructs. X -K laim (eXtended K laim) was initially introduced in [18] and reimplemented from scratch in [11]. The X -K laim compiler translates X -K laim programs into Java code that uses the Java package K lava.…”

“…The new implementation of X-Klaim [11] is based on Xtext [19], an Eclipse framework for developing programming languages and DSLs. X text also provides complete IDE support based on Eclipse: editor with syntax highlighting, code completion, error reporting, and incremental building, to mention a few.…”

“…Along this line of research, we introduced in [10] an approach for programming a single-robot system. Specifically, we propose using the language X -K laim [11] to program the components of a robot's software. This choice is motivated by the fact that X -K laim provides mechanisms based on distributed tuple spaces for coordinating the interactions between these software components at a high level of abstraction.…”