Nils Klarlund, Fred B. Schneider
Information and Computation
Paper
Trace-Based Network Proof Systems: Expressiveness and Completeness
Abstract
We consider incomplete trace-based network proof systems for safety properties, identifying extensions that are necessary and sufficient to achieve relative completeness. We investigate the expressiveness required of any trace logic to encode these extensions. © 1992, ACM. All rights reserved.
Related
Derek Lam, Donald C. Cox, et al.
IEEE Communications Magazine
Jennifer Widom, S. Finkelstein
SIGMOD Record
Guy M. Lohman, George Lapis, et al.
SIGMOD Record