The following pages link to (Q4790352):
Displaying 7 items.
- Event-based proof of the mutual exclusion property of Peterson's algorithm (Q271900) (← links)
- Automated analysis of mutual exclusion algorithms using CCS (Q911263) (← links)
- Reducibility of operation symbols in term rewriting systems and its application to behavioral specifications (Q968529) (← links)
- On the correctness of Goscinski's algorithm (Q1898231) (← links)
- Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos (Q2377304) (← links)
- Rewriting-based verification of authentication protocols (Q2851055) (← links)
- Theorem Proving Based on Proof Scores for Rewrite Theory Specifications of OTSs (Q5403086) (← links)