Treffer: EXPERIENCE WITH VERIFICATION OF PARALLEL MODULA PROGRAMS.

This paper describes the application of Hoare-style proof rules for the programming language Modula in the verification of two concurrent programs, In particular, a reasonably large (350 line) system program was verified. [ABSTRACT FROM AUTHOR]

Cet article décrit l'application des règles de preuve du style de Hoare, pour le langage de programmation Modula, à la vérification de deux programmes simultanés. En particulier, un programme de système raisonablement long (350 lignes) a été vérifié. [ABSTRACT FROM AUTHOR]

Copyright of INFOR is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)