Communication in concurrent dynamic logic
Journal of Computer and System Sciences
Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
Knowledge and common knowledge in a distributed environment
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Sequential consistency versus linearizability
ACM Transactions on Computer Systems (TOCS)
A lesson on authentication protocol design
ACM SIGOPS Operating Systems Review
Three-Processor Tasks Are Undecidable
SIAM Journal on Computing
The topological structure of asynchronous computability
Journal of the ACM (JACM)
Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
SIAM Journal on Computing
Categorical and Kripke Semantics for Constructive S4 Modal Logic
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Belief, information acquisition, and trust in multi-agent systems: a modal logic formulation
Artificial Intelligence
A unified theory of shared memory consistency
Journal of the ACM (JACM)
A framework for intuitionistic modal logics: extended abstract
TARK '86 Proceedings of the 1986 conference on Theoretical aspects of reasoning about knowledge
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
IEEE Transactions on Computers
A lambda calculus for gödel---dummett logic capturing waitfreedom
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
An epistemic perspective on consistency of concurrent computations
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Hi-index | 0.00 |
In the celebrated Gödel Prize winning papers, Herlihy, Shavit, Saks and Zaharoglou gave topological characterization of waitfree computation. In this paper, we characterize waitfree communication logically. First, we give an intuitionistic epistemic logic K∨ for asynchronous communication. The semantics for the logic K∨ is an abstraction of Herlihy and Shavit's topological model. In the same way Kripke model for intuitionistic logic informally describes an agent increasing its knowledge over time, the semantics of K∨ describes multiple agents passing proofs around and developing their knowledge together. On top of the logic K∨, we give an axiom type that characterizes sequential consistency on shared memory. The advantage of intuitionistic logic over classical logic then becomes apparent as the axioms for sequential consistency aremeaningless for classical logic because they are classical tautologies. The axioms are similar to the axiom type for prelinearity (ϕ ⊃ ψ)∨(ψ ⊃ ϕ). This similarity reflects the analogy between sequential consistency for shared memory scheduling and linearity for Kripke frames: both require total order on schedules or models. Finally, under sequential consistency, we give soundness and completeness between a set of logical formulas called waitfree assertions and a set of models called waitfree schedule models.