|Title:||DOMASCOS – DOMAin Specific COncurrency Skeleton|
|Conference:||Communicating Process Architectures 2017|
Kevin Chalmersa, Brian Vinterb, Kevin Vellac, John Markus Bjørndalend, Jan F. Broeninke
(a) School of Computing, Edinburgh Napier University
(b) Niels Bohr Institute, University of Copenhagen
(c) Department of Computer Science, University of Malta
(d) Department of Computer Science, University of Tromsø
(e) Robotics and Mechatronics, CTIT Institute, University of Twente
Existing approaches to concurrent programming, albeit essential, are easily used incorrectly. Testing is difficult due to the inherent non-determinism introduced by concurrency, especially in embedded systems (e.g., the Mars Rover catastrophe). DOMASCOS' goal is to produce (a) experts in concurrency programming and (b) libraries of concurrency program skeletons freeing applications from concurrency bugs – or, at least, significantly reducing their occurrence. Hence, programmers will no longer be required to implement their own concurrency mechanisms, but inherit guaranteed correct concurrency schemas directly from the DOMASCOS library. DOMASCOS addresses the problem of Reusable Concurrency for Modern System Design, supporting Europe to be at the forefront as the number of computationally enabled devices increases. DOMASCOS consists of concurrency groups of people sharing expertise in formally expressing correct concurrency, but differ in application domains: namely high-performance computing, GPU programming, embedded systems and robotics. The variety in applications ensures versatility of the skeletons and the shared concurrency knowledge ensures coherence in the team.
The application topics of DOMASCOS range from high performance computing, embedded systems, the creative industries, and robotics. These are all cross-sectional areas, key for the development for future innovation. Areas on which DOMASCOS will have an impact directly will be finance, big data, Internet of Things, games, autonomous systems, and working in extreme environments.