A complete modal proof system for a subset of SCCS [chapter]

Colin Stirling
1985 Lecture Notes in Computer Science  
Logical proof systems for concurrent programs are notoriously complex, often involving arbitrary restrictions. One of the main reasons for this is that unlike other major programming concepts parallelism does not appear to have a logical correlate. Here using a simple semantic strategy we tentatively propose one and offer an example modal proof system for a subset of Milner's SCCS. The proof rules are reminiscent of Gentzen introduction rules except that there are also introduction rules for the operators of the program language.
doi:10.1007/3-540-15198-2_16 fatcat:lmabgcfgpbabnh44bth4rbsx3i