Link Sebastian and Schewe Klaus-Dieter: An arithmetic theory of consistency enforcement. In: Acta cybernetica, (15) 3. pp. 379-416. (2002)
Preview |
Cikk, tanulmány, mű
cybernetica_015_numb_003_379-416.pdf Download (1MB) | Preview |
Abstract
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.
| Item Type: | Article |
|---|---|
| Journal or Publication Title: | Acta cybernetica |
| Date: | 2002 |
| Volume: | 15 |
| Number: | 3 |
| ISSN: | 0324-721X |
| Page Range: | pp. 379-416 |
| Language: | English |
| Place of Publication: | Szeged |
| Related URLs: | http://acta.bibl.u-szeged.hu/38513/ |
| Uncontrolled Keywords: | Számítástechnika, Kibernetika |
| Additional Information: | Bibliogr.: p. 415-416. ; összefoglalás angol nyelven |
| Subjects: | 01. Natural sciences 01. Natural sciences > 01.02. Computer and information sciences |
| Date Deposited: | 2016. Oct. 15. 12:25 |
| Last Modified: | 2022. Jun. 14. 14:35 |
| URI: | http://acta.bibl.u-szeged.hu/id/eprint/12686 |
Actions (login required)
 |
View Item |
