The following pages link to (Q4934623):
Displaying 19 items.
- On the diversity of asynchronous communication (Q315311) (← links)
- Domain science and engineering from computer science to the sciences of informatics. II: Science (Q464883) (← links)
- Manifest domains: analysis and description (Q520235) (← links)
- Improving automation for higher-order proof steps (Q831930) (← links)
- Deductive verification of alternating systems (Q939163) (← links)
- Fast Paxos (Q1954195) (← links)
- Lower bounds for asynchronous consensus (Q1954196) (← links)
- A modular framework for verifying versatile distributed systems (Q2011199) (← links)
- Information flow control in software DB units based on formal verification (Q2172738) (← links)
- Specifying reversibility with \(\mathrm{TLA}^+\) (Q2210867) (← links)
- Implementing dataflow with threads (Q2377253) (← links)
- Domain science and engineering from computer science to the sciences of informatics. I: Engineering (Q2452758) (← links)
- Byzantizing Paxos by Refinement (Q3095328) (← links)
- The PlusCal Algorithm Language (Q3393398) (← links)
- A Reduction Theorem for the Verification of Round-Based Distributed Algorithms (Q3646255) (← links)
- Combinations of Theories for Decidable Fragments of First-Order Logic (Q3655205) (← links)
- Extracting Symbolic Transitions from TLA$$^{+}$$+ Specifications (Q5881447) (← links)
- Tasks in modular proofs of concurrent algorithms (Q6044466) (← links)
- Domain modelling: a foundation for software development (Q6535830) (← links)
