A model and temporal proof system for networks of processes

  • Authors:

  • Van Nguyen;David Gries;Susan Owicki

  • Affiliations:

  • Computer Sciences, Cornell University, Ithaca, NY;Computer Sciences, Cornell University, Ithaca, NY;Computer Systems Lab., Stanford University, Stanford, CA

  • Venue:
  • POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
  • Year:
  • 1985

Quantified Score

Hi-index 0.00

Visualization

Abstract

A model and a sound and complete proof system for networks of processes in which component processes communicate exclusively through messages is given. The model, an extension of the trace model, can describe both synchronous and asynchronous networks. The proof system uses temporal-logic assertions on sequences of observations — a generalization of traces. The use of observations (traces) makes the proof system simple, compositional and modular, since internal details can be hidden. The expressive power of temporal logic makes it possible to prove temporal properties (safety, liveness, precedence, etc.) in the system. The proof system is language-independent and works for both synchronous and asynchronous networks.