Abstract
Systems in hard real-time environments must be highly dependable. We state that this can be achieved by developing real-time systems using formal methods.To prove this statement we construct an important part of a real-time system, viz., an operating system kernel, using formal methods. The operating system kernel is specified and verified using Hoare-style logic and the Boyer-Moore theorem prover.At the moment, part of the verification process has been completed, i.e., a number of kernel routines has been manually verified using Hoaretriples, and a stripped-down version of the kernel has been mechanically proven correct using the Boyer-Moore theorem prover. We expect to have the kernel completely mechanically verified within the next two years.KeywordsFormal MethodTemporal LogicApplication ProgramAutomate ReasoningVerification ProcessThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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.
