A simple but complete set of algebraic laws is given for a basic language (e.g. at the boogie level). They include the algebraic properties of concurrency, similar to those of sequential composition. The laws are valid equally for interleaved concurrency and separate concurrency, as well as mixtures between them (e.g., as used in VCC). The most recognized methods of program analysis and verification are simply derived from algebra. But will it be useful?

Please take the opportunity to connect and share this video with your friends and family if you find it useful.