Communicating sequential processes
Communicating sequential processes
A model and temporal proof system for networks of processes
Distributed Computing
Trace-based network proof systems: expressiveness and completeness (concurrency)
Trace-based network proof systems: expressiveness and completeness (concurrency)
Completeness and incompleteness of trace-based network proof systems
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Compositionality, concurrency and partial correctness
Compositionality, concurrency and partial correctness
A model and proof system for asynchronous networks
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Ten Years of Hoare's Logic: A Survey—Part I
ACM Transactions on Programming Languages and Systems (TOPLAS)
Compositionality and Concurrent Networks: Soundness and Completeness of a Proofsystem
Proceedings of the 12th Colloquium on Automata, Languages and Programming
Scenarios: A Model of Non-Determinate Computation
Proceedings of the International Colloquium on Formalization of Programming Concepts
A Semantics and Proof System for Communicating Processes
Proceedings of the Carnegie Mellon Workshop on Logic of Programs
Compositional Proofs For Networks Of Processes
Fundamenta Informaticae
| Hi-index | 0.00 |
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.