Temporal Deductive Verification of Basic ASM Models
Autor(a) principal: | |
---|---|
Data de Publicação: | 2010 |
Outros Autores: | |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | INFOCOMP: Jornal de Ciência da Computação |
Texto Completo: | https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/286 |
Resumo: | Abstract State Machines (ASMs, for short) provide a practical new computational model which has been applied in the area of software engineering for systems design and analysis. However, reasoning about ASM models occurs, not within a formal deductive system, but basically in the classical informal proofs style of mathematics. Several formal verification approaches for proving correctness of ASM models have been investigated. In this paper we consider the use of the TLA+logic for the deductive verification of a certain class of ASMs, namely basic ASMs which have successfully been applied in describing the dynamic behavior of systems at various levels of abstraction. In particular, we base our verification purpose on a translation of basic ASMs to the Temporal Logic of Actions (TLA) used as a formal basis to formally specify and reason about temporal behaviors of basic ASM models. The temporal deductive approach is illustrated by the formal correctness proof of a producer-consumer system formalized in terms of basic ASMs. |
id |
UFLA-5_3ac10083759f3ec93bc98f7483236da1 |
---|---|
oai_identifier_str |
oai:infocomp.dcc.ufla.br:article/286 |
network_acronym_str |
UFLA-5 |
network_name_str |
INFOCOMP: Jornal de Ciência da Computação |
repository_id_str |
|
spelling |
Temporal Deductive Verification of Basic ASM ModelsAbstract State Machines (ASMs)Temporal Logic of Actions (TLA)Deductive Verification.Abstract State Machines (ASMs, for short) provide a practical new computational model which has been applied in the area of software engineering for systems design and analysis. However, reasoning about ASM models occurs, not within a formal deductive system, but basically in the classical informal proofs style of mathematics. Several formal verification approaches for proving correctness of ASM models have been investigated. In this paper we consider the use of the TLA+logic for the deductive verification of a certain class of ASMs, namely basic ASMs which have successfully been applied in describing the dynamic behavior of systems at various levels of abstraction. In particular, we base our verification purpose on a translation of basic ASMs to the Temporal Logic of Actions (TLA) used as a formal basis to formally specify and reason about temporal behaviors of basic ASM models. The temporal deductive approach is illustrated by the formal correctness proof of a producer-consumer system formalized in terms of basic ASMs.Editora da UFLA2010-03-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfhttps://infocomp.dcc.ufla.br/index.php/infocomp/article/view/286INFOCOMP Journal of Computer Science; Vol. 9 No. 1 (2010): March, 2010; 12-211982-33631807-4545reponame:INFOCOMP: Jornal de Ciência da Computaçãoinstname:Universidade Federal de Lavras (UFLA)instacron:UFLAenghttps://infocomp.dcc.ufla.br/index.php/infocomp/article/view/286/271Copyright (c) 2016 INFOCOMP Journal of Computer Scienceinfo:eu-repo/semantics/openAccessDaho, Hocine El-HabibBenhamamouch, Djillali2014-12-09T13:05:17Zoai:infocomp.dcc.ufla.br:article/286Revistahttps://infocomp.dcc.ufla.br/index.php/infocompPUBhttps://infocomp.dcc.ufla.br/index.php/infocomp/oaiinfocomp@dcc.ufla.br||apfreire@dcc.ufla.br1982-33631807-4545opendoar:2024-05-21T19:54:29.805532INFOCOMP: Jornal de Ciência da Computação - Universidade Federal de Lavras (UFLA)true |
dc.title.none.fl_str_mv |
Temporal Deductive Verification of Basic ASM Models |
title |
Temporal Deductive Verification of Basic ASM Models |
spellingShingle |
Temporal Deductive Verification of Basic ASM Models Daho, Hocine El-Habib Abstract State Machines (ASMs) Temporal Logic of Actions (TLA) Deductive Verification. |
title_short |
Temporal Deductive Verification of Basic ASM Models |
title_full |
Temporal Deductive Verification of Basic ASM Models |
title_fullStr |
Temporal Deductive Verification of Basic ASM Models |
title_full_unstemmed |
Temporal Deductive Verification of Basic ASM Models |
title_sort |
Temporal Deductive Verification of Basic ASM Models |
author |
Daho, Hocine El-Habib |
author_facet |
Daho, Hocine El-Habib Benhamamouch, Djillali |
author_role |
author |
author2 |
Benhamamouch, Djillali |
author2_role |
author |
dc.contributor.author.fl_str_mv |
Daho, Hocine El-Habib Benhamamouch, Djillali |
dc.subject.por.fl_str_mv |
Abstract State Machines (ASMs) Temporal Logic of Actions (TLA) Deductive Verification. |
topic |
Abstract State Machines (ASMs) Temporal Logic of Actions (TLA) Deductive Verification. |
description |
Abstract State Machines (ASMs, for short) provide a practical new computational model which has been applied in the area of software engineering for systems design and analysis. However, reasoning about ASM models occurs, not within a formal deductive system, but basically in the classical informal proofs style of mathematics. Several formal verification approaches for proving correctness of ASM models have been investigated. In this paper we consider the use of the TLA+logic for the deductive verification of a certain class of ASMs, namely basic ASMs which have successfully been applied in describing the dynamic behavior of systems at various levels of abstraction. In particular, we base our verification purpose on a translation of basic ASMs to the Temporal Logic of Actions (TLA) used as a formal basis to formally specify and reason about temporal behaviors of basic ASM models. The temporal deductive approach is illustrated by the formal correctness proof of a producer-consumer system formalized in terms of basic ASMs. |
publishDate |
2010 |
dc.date.none.fl_str_mv |
2010-03-01 |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/286 |
url |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/286 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/286/271 |
dc.rights.driver.fl_str_mv |
Copyright (c) 2016 INFOCOMP Journal of Computer Science info:eu-repo/semantics/openAccess |
rights_invalid_str_mv |
Copyright (c) 2016 INFOCOMP Journal of Computer Science |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Editora da UFLA |
publisher.none.fl_str_mv |
Editora da UFLA |
dc.source.none.fl_str_mv |
INFOCOMP Journal of Computer Science; Vol. 9 No. 1 (2010): March, 2010; 12-21 1982-3363 1807-4545 reponame:INFOCOMP: Jornal de Ciência da Computação instname:Universidade Federal de Lavras (UFLA) instacron:UFLA |
instname_str |
Universidade Federal de Lavras (UFLA) |
instacron_str |
UFLA |
institution |
UFLA |
reponame_str |
INFOCOMP: Jornal de Ciência da Computação |
collection |
INFOCOMP: Jornal de Ciência da Computação |
repository.name.fl_str_mv |
INFOCOMP: Jornal de Ciência da Computação - Universidade Federal de Lavras (UFLA) |
repository.mail.fl_str_mv |
infocomp@dcc.ufla.br||apfreire@dcc.ufla.br |
_version_ |
1799874740922351616 |