LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

CREATE AN ACCOUNT

Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Publisher: University of Warwick. Department of Computer Science
Languages: English
Types: Other
Subjects: QA76
This paper describes a compositional specification and proof system for networks of distributed processes. Each process in a network is specified using first order logic in terms of a presupposition P and an affirmation A as a triple (P) S (A). For purely sequential programs, these triples reduce to the familiar Hoare triples extended for total correctness. In distributed programs, P-A triples allow the Internal behaviour of a process to be specified in the context of the communications of the other processes in the network. Communications may either by synchronous or asynchronous. Properties such as termination, the absence of deadlock and the absence of livelock can be verified. As the technique is syntax-directed and allows network abstraction, proofs follow the structure of the program and a subnetwork within a network can be replaced by a single process. It also allows proof of the properties of non-terminating processes, such as servers.
  • No references.
  • No related research data.
  • No similar publications.

Share - Bookmark

Cite this article