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.
Mobile Escape Analysis for occam-pi
By Frederick R. M. Barnes
Escape analysis is the process of discovering boundaries of
dynamically allocated objects in programming languages. For
object-oriented languages such as C++ and Java, this analysis leads to
an understanding of which program objects interact directly, as well
as what objects hold references to other objects. Such information
can be used to help verify the correctness of an implementation with
respect to its design, or provide information to a run-time system
about which objects can be allocated on the stack (because they do not
"escape" the method in which they are declared). For existing
object-oriented languages, this analysis is typically made difficult
by aliasing endemic to the language, and is further complicated by
inheritance and polymorphism. In contrast, the occam-pi programming
language is a process-oriented language, with systems built from
layered networks of communicating concurrent processes. The language
has a strong relationship with the CSP process algebra, that can be
used to reason formally about the correctness of occam-pi programs.
This paper presents early work on a compositional escape analysis
technique for mobiles in the occam-pi programming language, in a style
not dissimilar to existing CSP analyses. The primary aim is to
discover the boundaries of mobiles within the communication graph, and
to determine whether or not they escape any particular process or
network of processes. The technique is demonstrated by analysing some
typical occam-pi processes and networks, giving a formal understanding
of their mobile escape behaviour.
Complete record...
|
