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.
Data Escape Analysis for Process Oriented Systems
By Martin Ellis, Frederick R. M. Barnes
Escape analysis, the technique of discovering the boundaries of
dynamically allocated objects, is a well explored technique for
object-orientated languages (such as Java and C++) and stems from the
functional programming community. It provides an insight into which
objects interact directly (and indirectly) and can inform program
correctness checking, or be used for directing optimisations (e.g.
determining which objects can safely be allocated on a function-local
stack). For process-oriented languages such as occam-pi and Google's Go,
we have explored mobile escape analysis, that provides concise
information about the movement of objects (mobiles) within networks of
communicating processes. Because of the distinction between processes
(as execution contexts) and objects (dynamically allocated data,
channels and processes), combined with strict typing and aliasing rules,
the analysis is somewhat simpler then for less strict languages. This
analysis is only concerned with dynamically allocated blocks of memory
-- it does not give any consideration for the data contained within
these. However, knowing the extent to which data (statically or
dynamically allocated) escapes within a network of communicating
processes is arguably useful -- and is not necessarily a superset of
mobile escape. The fringe presentation describes an extension to the
mobile escape model that seeks to capture semantic information about the
data escape of a process-oriented system. This provides richer semantic
information about a process's behaviour (that can be used in
verification) and has clear application to security (e.g. by
demonstrating that particular data does not escape a set of
communicating processes).
Complete record...
|
