Abstract
A syntax directed proof system which allows to prove liveness properties of while -programs is introduced. The proof system is proved to be arithmetically sound and complete in the sense of Harel (“Lecture Notes in Comput. Sci. Vol. 68,” Springer-Verlag, Berlin/New York, 1979) . The results of the paper generalize a corresponding result Pneuli (“Prc. 18th Sympos. FOCS” IEEE, Providence, R. I., 1977) proves for unstructured programs. The proof system decomposes into two parts. The first part allows to prove simple safety properties. These properties are used as axioms in the second proof system which deals with liveness properties. The completeness proof is constructive and provides a heuristic for proving specific liveness properties.
Sign-in/Register to access full text options 
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.
