The University of Southampton
University of Southampton Institutional Repository

Dynamic aspects of retrenchments through temporal logic

Dynamic aspects of retrenchments through temporal logic
Dynamic aspects of retrenchments through temporal logic
Refinement is used as a way to verify an implementation with respect to a specification. States of related systems are linked through a so called gluing invariant which remains always true during the synchronous execution of both systems. Refinement is a sufficient condition for this property. Retrenchment is a generalization of refinement which relax the constraints between both systems. This paper proposes a temporal logic counterpart for some specific forms of retrenchment.
Terms—refinement, retrenchment, temporal logics, TLA
1109-9305
18-26
Banach, Richard
3c9a2946-4d86-428e-bce2-6dfdde219ff3
Bodeveix, Jean-Paul
b0fc86a1-c31e-4d89-ba23-37c41b643593
Filali, Mamoun
52deb579-0c56-40bd-bcbb-62e1154c4dcb
Poppleton, Michael
00f3ffec-b4ff-4dd3-89a4-7a9aaff1c9f1
Soutsas, K
ece8866a-2a01-46a3-87dc-b50dd8a32144
Hartonas, C
97c64521-624d-4ccf-8ce1-fa87b1915477
Banach, Richard
3c9a2946-4d86-428e-bce2-6dfdde219ff3
Bodeveix, Jean-Paul
b0fc86a1-c31e-4d89-ba23-37c41b643593
Filali, Mamoun
52deb579-0c56-40bd-bcbb-62e1154c4dcb
Poppleton, Michael
00f3ffec-b4ff-4dd3-89a4-7a9aaff1c9f1
Soutsas, K
ece8866a-2a01-46a3-87dc-b50dd8a32144
Hartonas, C
97c64521-624d-4ccf-8ce1-fa87b1915477

Banach, Richard, Bodeveix, Jean-Paul, Filali, Mamoun and Poppleton, Michael , Soutsas, K and Hartonas, C (eds.) (2005) Dynamic aspects of retrenchments through temporal logic. ANNALS OF MATHEMATICS, COMPUTING & TELEINFORMATICS, 1 (3), 18-26.

Record type: Article

Abstract

Refinement is used as a way to verify an implementation with respect to a specification. States of related systems are linked through a so called gluing invariant which remains always true during the synchronous execution of both systems. Refinement is a sufficient condition for this property. Retrenchment is a generalization of refinement which relax the constraints between both systems. This paper proposes a temporal logic counterpart for some specific forms of retrenchment.

PDF
Retrench.Dyn.Asp.TL.ACMT.pdf - Other
Download (145kB)

More information

Published date: 2005
Keywords: Terms—refinement, retrenchment, temporal logics, TLA
Organisations: Electronics & Computer Science

Identifiers

Local EPrints ID: 262795
URI: https://eprints.soton.ac.uk/id/eprint/262795
ISSN: 1109-9305
PURE UUID: cf6096aa-faa1-43e8-855e-d8e89ee01992

Catalogue record

Date deposited: 05 Jul 2006
Last modified: 18 Jul 2017 08:47

Export record

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×