ACM Transactions on Programming Languages and Systems (TOPLAS)
Paper

Trace-Based Network Proof Systems: Expressiveness and Completeness

View publication

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.

View all publications