Agentic data science with the Data Agent Kit
cloud.google.com·6h ago
AI Research
arXiv CS.AI·Jul 24·5 min read
Encoding Event-B Proof Rules in Prolog: An Interactive Sequent Prover for ProB
TL;DR
An interactive sequent prover for Event-B proof rules has been developed using Prolog, enhancing proof analysis and teaching. This tool integrates with ProB and Rodin, offering improved maintainability and extensibility over previous Java implementations.
✦ Why It Matters
Explore the new Prolog-based interactive prover to enhance your formal verification processes today.
Key Takeaways
- Utilize the Prolog-based prover for better proof analysis.
- Integrate with Rodin for seamless proof obligation management.
- Leverage proof tree visualization for teaching purposes.
- Consider future enhancements for faster automatic provers.
How It Works
The Prolog encoding of proof rules allows for a more compact and maintainable system compared to Java. By using Prolog's logical programming capabilities, the prover can systematically analyze and construct proofs, providing an interactive interface for users to visualize proof trees and select rules.