Annual Conference: Communicating Process Architectures
Communicating Process Architectures 2018,
the 40th. WoTUG conference on concurrent and parallel systems, takes place from
Sunday August 19th. to Wednesday August 22nd. 2018 and is hosted by
Professor Dr. Rainer Spallek,
Chair of
VLSI Design, Diagnostics and Architecture
at the Faculty of Computer Science,
Technische Universität Dresden, Germany.
The conference is organised by Dr. Spallek in collboration with Oliver Knodel and Uwe Mielke
and in partnership with WoTUG.
About WoTUG
WoTUG provides a forum for the discussion and promotion of concurrency ideas,
tools and products in computer science.
It organises specialist workshops and annual conferences that address
key concurrency issues at all levels of software and hardware granularity.
WoTUG aims to progress the leading state of the art in:
-
theory (programming models, process algebra, semantics, ...);
-
practice (multicore processors and run-times, clusters, clouds, libraries, languages, verification, model checking, ...);
-
education (at school, undergraduate and postgraduate levels, ...);
-
applications (complex systems, modelling, supercomputing, embedded systems, robotics, games, e-commerce, ...);
and to stimulate discussion and ideas on the roles concurrency will play in the future:
-
for the next generation of scalable computer infrastructure (hard and soft) and application,
where scaling means the ability to ramp up functionality (stay in control as complexity increases)
as well as physical metrics (such as absolute performance and response times);
-
for system integrity (dependability, security, safety, liveness, ...);
-
for making things simple.
Of course, neither of the above sets of bullets are exclusive.
WoTUG publications
A database of papers and presentations from WoTUG conferences is here.
The Abstract below has been randomly selected from this database.
A Debugger for Communicating Scala Objects
By Andrew Bate, Gavin Lowe
This paper presents a software tool for visualising and reasoning about
the behaviour of message-passing concurrent programs built with the CSO
library for the Scala programming language. It describes the models
needed to represent the construction of process networks and the runtime
behaviour of the resulting program. We detail the manner in which
information is extracted from the use of concurrency primitives in order
to maintain these models and how these models are diagrammed. Our
implementation of dynamic deadlock detection is explained. The tool can
produce a sequence diagram of process communications, the communication
network depicting the pairs of processes which share a communication
channel, and the trees resulting from the composition of processes.
Furthermore, it allows for behavioural specifications to be defined and
then checked at runtime, and guarantees to detect the illegal usage of
concurrency primitives that could otherwise lead to deadlock or data
loss. Our implementation imposes only a small overhead on the program
under inspection.
Complete record...
|
