C o n t r a r y to the great advantages of p r o g r a m e x e c u t i o n speed up in multip r o c e s s o r systems the use of p a r a l l e l hardware in everyday programming is still restricted. A.Valmari (Finland) describes in his contribution "PC-RIMST - A Tool for V a l i d a t i n g C o n c u r r e n t P r o g r a m Design" a p r o g r a m m i n g e n v i r o n m e n t w h i c h facilitates the design of deadlock-free, p a r a l l e l programs. The user-supplied, p a r a l l e l program, w r i t t e n in a special input language, can be compiled, executed, and s y m b o l i c a l l y debugged. An a n a l y s i s of r e a c h a b i l i t y of the p r o g r a m state space supports the c o r r e c t n e s s of
the p r o g r a m and helps to detect p r o g r a m errors. In the second (Czechoslovakia)
paper by P. Brezany entitled "Parallel
Parsing in a Multiprocessor Environment" the m e c h a n i s m for a p a r a l l e l compiler itself, running on several processors at the same time, is described. The (sequential) p r o g r a m is split up into several parts, each one parsed by a copy of the compiler program which synchronizes their activity by sending m e s s a g e s and signals.