Abstract
Two approaches to the correctness verification of real-time programs are presented. The first approach, static verification, corresponds to the correctness notion in systems programming, that is informally described by the software standard (ANSI/IEEE, 1983). The second one, dynamic correction, is a generalization of the exceptions handling idea (Anderson, 1981). The formal construction is based on the coupled process notion and the so-called local testability theorem. Automatic correctness verification system and a structure of dynamic correction module result from the formal investigations.
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 callSimilar Papers
More From: Annual Review in Automatic Programming
Disclaimer: 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.
