Now showing items 1-5 of 5

    • Completeness and Incompleteness of Trace-Based Network Proof Systems 

      Widom, Jennifer; Gries, David; Schneider, Fred B. (Cornell University, 1986-07)
      Most trace-based proof systems for networks of processes are known to be incomplete. Extensions to achieve completeness are generally complicated and cumbersome. In this paper, a simple trace logic is defined and two ...
    • Expressiveness Bounds for Completeness in Trace-Based Network Proof Systems 

      Widom, Jennifer; Panangaden, Prakash (Cornell University, 1987-09)
      Network proof systems based on first-order specifications over channel traces are incomplete unless reasoning over the interleaving of communication events is permitted. Relatively complete trace-based proof systems using ...
    • A Temporal-Logic Based Compositional Proof System for Real-Time Message Passing 

      Hooman, Jozef; Widom, Jennifer (Cornell University, 1988-06)
      We consider a model of real-time network computation in which synchronous communication events occur during (possibly overlapping) intervals along a dense time scale. A specification language for processes and networks ...
    • Trace-Based Network Proof Systems: Expressiveness and Completeness 

      Widom, Jennifer (Cornell University, 1987-05)
      Most trace-based proof systems for networks of processes are known to be incomplete. Extensions to achieve completeness are generally complicated and cumbersome. In this thesis, we isolate the componenets of a trace-based ...
    • Trace-Based Network Proof Systems: Expressiveness and Completeness 

      Widom, Jennifer; Gries, David; Schneider, Fred B. (Cornell University, 1989-02)
      We consider incomplete trace-based network proof systems for safety properties, identifying extensions that are necessary and sufficient to achieve relative completeness. We then consider the expressiveness required of ...