principles of proving concurrent programs in gypsy
Concurrency in Gypsy is based on a unique, formal approach to specifying and proving systems of concurrent processes. The specification and proof methods are designed so that proofs of individual processes are totally independent, even when operating concurrently. These methods can be applied both to terminating and non-terminating processes, and the proof methods are well suited to automated verification aids. The basic principles of these methods and their interaction with the design of Gypsy are described.
concurrent program concurrency formalism systems process method design operability automation verification interaction formal specifications parallel programs message buffers program verification program proving