Broy-Lamport Specification Problem: A Gurevich Abstract State Machine Solution
James K. Huggins
TL;DR
This paper demonstrates how the Gurevich Abstract State Machine methodology can be applied to solve the Broy-Lamport specification problem, showcasing its effectiveness in formal specification tasks.
Contribution
It introduces a novel application of Abstract State Machines to a benchmark specification problem, bridging formal methods and practical problem-solving.
Findings
Successful application of ASM to Broy-Lamport problem
Validation of ASM methodology for formal specifications
Potential for ASM in other specification challenges
Abstract
We apply the Gurevich Abstract State Machine methodology to a benchmark specification problem of Broy and Lamport.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFormal Methods in Verification · Machine Learning and Algorithms · semigroups and automata theory