Now showing items 1-5 of 5

    • Axiomatic Proof Techniques for Parallel Programs 

      Owicki, Susan S. (Cornell University, 1975-07)
      This thesis presents an axiomatic method for proving certain correctness properties of parallel programs. Axioms and inference rules for partial correctness are given for two parallel programming languages: The General ...
    • A Consistent and Complete Deductive System for the Verification of Parallel Programs 

      Owicki, Susan S. (Cornell University, 1976-05)
      The semantics of a simple parallel programming language is presented in two ways: deductively, by a set of Hoare-like axioms and inference rules, and operationally, by means of an interpreter. It is shown that the deductive ...
    • A Model and Temporal proof system for Networks of Processes 

      Nguyen, Van Long; Demers, Alan J.; Gries, David; Owicki, Susan S. (Cornell University, 1985-06)
      An approach is presented for modeling networks of processes that communicate exclusively through message passing. A process (or a network) is defined by its set of possible behaviors, where each behavior is an abstraction ...
    • A Model and Temporal Proof System for Networks of Processes 

      Nguyen, Van Long; Gries, David; Owicki, Susan S. (Cornell University, 1984-11)
      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 desribe both synchronous ...
    • Proving Properties of Parallel Programs: An Axiomatic Approach 

      Owicki, Susan S.; Gries, David (Cornell University, 1975-05)
      This paper presents an axiomatic technique for proving a number of properties of parallel programs. Hoare has given a set of axioms for partial correctness of parallel programs, but they are not strong enough in most ...