Abstract
The paper reports on a case study in which we have guessed properties of Qlock, a mutual exclusion (mutex) protocol, based on its graphical animations and confirmed them by model checking. Such properties guessed graphically and confirmed by model checking could be used as lemmas when theorem proving that Qlock enjoys desired properties, such as the mutex property and the lockout freedom property.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
