Abstract
Hanoi Tower problem is an ancient and interesting puzzle and Isabelle is one of famous proof assistants. We have put forward a method to verify the correctness of algorithmic programs based on Isabelle, and have presented formal derivation and proof about the non-recursive algorithm of Hanoi Tower problem in our previous work. The focus of this paper is to turn the former manual verification to automatic verification by using Isabelle Theorem Prover. On the other hand, we originally find a boundary function, which used to proof termination of our non-recursive algorithm of Hanoi Tower problem. This work realizes mechanically automatic-verifying the complete correctness of our non-recursive algorithm of Hanoi Tower Problem, and overcomes the intricacies of manual verification, improves the verification efficiency, and ensures the trustworthiness and reliability of the algorithm program.
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.
