A linear-history semantics for languages for distributed programming
Theoretical Computer Science
What processes know: Definitions and proof methods
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Formal Justification of a Proof System for Communicating Sequential Processes
Journal of the ACM (JACM)
A Proof System for Communicating Sequential Processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communicating sequential processes
Communications of the ACM
Mathematical Theory of Program Correctness
Mathematical Theory of Program Correctness
Towards an Epistemic Approach to Reasoning about Concurrent Programs
Proceedings of the REX Workshop on Sematics: Foundations and Applications
Epistemic Logic for AI and Computer Science
Epistemic Logic for AI and Computer Science
Refining knowledge oriented actions to layered implementations
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Interpreted systems semantics for process algebra with identity annotations
TbiLLC'11 Proceedings of the 9th international conference on Logic, Language, and Computation
Hi-index | 0.00 |
A proof system for the correctness of parallel programs using knowledge in distributed systems is presented and proven sound and relatively complete with respect to a formal Kripke style semantics that supports truly concurrent computations.