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.
Adding Formal Verification to occam-π
By Peter H. Welch, Jan Bækgaard Pedersen, Frederick R. M. Barnes, Carl G. Ritson, Neil C.C. Brown
This is a proposal for the formal verification of occam-π
programs to be managed entirely within occam-π.
The language is extended with qualifiers on types and processes
(to indicate relevance for verification and/or execution) and assertions
about refinement (including deadlock, livelock and determinism).
The compiler abstracts a set of CSPm equations and assertions,
delegates their analysis to the FDR2 model checker and reports back
in terms related to the occam-π source.
The rules for mapping the extended occam-π to CSPm are given.
The full range of CSPm assertions is accessible, with no knowledge of
CSP formalism required by the occam-π programmer. Programs are proved
just by writing and compiling programs.
A case-study analysing a new (and elegant) solution to the Dining
Philosophers problem is presented.
Deadlock-freedom for colleges with any number of philosphers
is established by verifying an induction argument (the base and
induction steps).
Finally, following guidelines laid down by Roscoe, the careful use of
model compression is demonstrated to verify directly the deadlock-freedom
of an occam-π college with 10^2000 philosphers (in around 30 seconds).
All we need is a universe large enough to contain the computer
on which to run it.
Complete record...
|
