Computational science in high schools: defining curricula and environments
Future Generation Computer Systems - Special issue: Selected papers from the workshop on education in computational sciences held at the ICCS 2002
Efficient symbolic computation of process expressions
Science of Computer Programming
Efficient symbolic execution of large quantifications in a process algebra
ICFEM'07 Proceedings of the formal engineering methods 9th international conference on Formal methods and software engineering
Hi-index | 0.00 |
Concurrency is thought to be an advanced topic - much harder than serial computing which, therefore, needs to be mastered first. This seminar contends that this tradition is wrong, which has radical implications for the way we educate people in Computer Science - and on how we apply what we have learnt.A process-oriented design pattern for concurrency is presented with a specific binding for Java. It is based on the algebra of Communicating Sequential Processes (CSP) as captured by the JCSP library of Java classes. No mathematical sophistication is needed to master it. The user gets the benefit of the sophistication underlying CSP simply by using it.Those benefits include the simplification wins we always thought concurrency should generate. Although the Java binding is new, fifteen years of working with students at Kent have shown that the ideas within process-oriented design can be quickly absorbed and applied. Getting the ideas across as soon as possible pays dividends - the later it's left, the more difficult it becomes to wean people off serial ways of thought that often fit applications so badly. Concurrency for all (and for everyday use) in the design and implementation of complex, maintainable and scalable computer systems is both achievable and necessary.