Communicating Process Architectures
Communicating Process Architectures 2013, the
35th WoTUG conference on concurrent and parallel programming, will take place
at
Edinburgh Napier University, in
Edinburgh, Scotland, from Sunday August 25th to Wednesday August 28th 2013.
For more information on CPA 2013, please see the
Call for Papers,
or the CPA 2013 pages.
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 formal top-down developement method for occam programs
By Donal Roantree, Maurice Clint
This paper describes a formal development method for mathematical applications in occam. Refinement rules form the basis of the method. A traces model is defined and used to give a formal semantics to occam. The rules are proved sound with respect to this semantics.
Complete record...
|
