Denotational models for parallel programs with indeterminate operators

technical reportSeveral approaches to networks of concurrently-operating modules involving indeterminacy are discussed. Techniques for representing the denotational semantics of such networks, and for verifying properties of them, are presented, including an oracle approach, an axiomatic approach, a data-type reduction approach, and a partial-ordering approach