An arithmetic theory of consistency enforcement

Consistency enforcement starts from a given program specification S and a static invariant I and aims to replace S by a slightly modified program specification SI that is provably consistent with respect to I. One formalization which suggests itself is to define SI as the greatest consistent special...

Teljes leírás

Elmentve itt :
Bibliográfiai részletek
Szerzők: Link Sebastian
Schewe Klaus-Dieter
Dokumentumtípus: Cikk
Megjelent: 2002
Sorozat:Acta cybernetica 15 No. 3
Kulcsszavak:Számítástechnika, Kibernetika
Tárgyszavak:
Online Access:http://acta.bibl.u-szeged.hu/12686
Leíró adatok
Tartalmi kivonat:Consistency enforcement starts from a given program specification S and a static invariant I and aims to replace S by a slightly modified program specification SI that is provably consistent with respect to I. One formalization which suggests itself is to define SI as the greatest consistent specialization of S with respect to I, where specialization is a partial order on semantic equivalence classes of program specifications. In this paper we present such a theory on the basis of arithmetic logic. We show that with mild technical restrictions and mild restrictions concerning recursive program specifications it is possible to obtain the greatest consistent specialization gradually and independently from the order of given invariants as well as by replacing basic commands by their respective greatest consistent specialization. Furthermore, this approach allows to discuss computability and decidability aspects for the first time.
Terjedelem/Fizikai jellemzők:379-416
ISSN:0324-721X