Published 1999
| public
Book Section - Chapter
Examples of program composition illustrating the use of universal properties
- Creators
- Charpentier, Michel
- Chandy, K. Mani
- Others:
- Rolim, José
- Mueller, Frank
- Zomaya, Albert Y.
- Ercal, Fikret
- Olariu, Stephan
- Ravindran, Binoy
- Gustafsson, Jan
- Takada, Hiroaki
- Olsson, Ron
- Kale, Laxmikant V.
- Beckman, Pete
- Haines, Matthew
- ElGindy, Hossam
- Caromel, Denis
- Chaumette, Serge
- Fox, Geoffrey
- Pan, Yi
- Li, Keqin
- Yang, Tao
- Chiola, G.
- Conte, G.
- Mancini, L. V.
- Méry, Domenique
- Sanders, Beverly
- Bhatt, Devesh
- Prasanna, Viktor
Chicago
Abstract
This paper uses a theory of composition based on existential and universal properties. Universal properties are useful to describe components interactions through shared variables. However, some universal properties do not appear directly in components specifications and they must be constructed to prove the composed system. Coming up with such universal properties often requires creativity. The paper shows through two examples how this construction can be achieved. The principle used is first presented with a toy example and then applied to a more substantial problem.
Additional Information
© 1999 Springer-Verlag.Additional details
- Eprint ID
- 104363
- Resolver ID
- CaltechAUTHORS:20200713-150514979
- Created
-
2020-07-13Created from EPrint's datestamp field
- Updated
-
2021-11-16Created from EPrint's last_modified field
- Series Name
- Lecture Notes in Computer Science
- Series Volume or Issue Number
- 1586