Specification and Verification of Invariant Properties of Transition Systems

Daniel Mircea Gaina, Ionut Tutu, Adrian Riesco

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Transition systems provide a natural way to specify and reason about the behaviour of discrete systems, and in particular about the computations that they may perform. This paper advances a verification method for transition systems whose reachable states are described explicitly by membership axioms. The proof technique is implemented in the Constructor-based Inductive Theorem Prover (CITP), a proof management tool built on top of a variation of conditional equational logic enhanced with many modern features. This approach complements the so-called OTS method, a verification procedure for observational transition systems that is already implemented in CITP.

Original languageEnglish
Title of host publicationProceedings - 25th Asia-Pacific Software Engineering Conference, APSEC 2018
PublisherIEEE Computer Society
Pages99-108
Number of pages10
ISBN (Electronic)9781728119700
DOIs
Publication statusPublished - May 21 2019
Event25th Asia-Pacific Software Engineering Conference, APSEC 2018 - Nara, Japan
Duration: Dec 4 2018Dec 7 2018

Publication series

NameProceedings - Asia-Pacific Software Engineering Conference, APSEC
Volume2018-December
ISSN (Print)1530-1362

Conference

Conference25th Asia-Pacific Software Engineering Conference, APSEC 2018
CountryJapan
CityNara
Period12/4/1812/7/18

Fingerprint

Specifications

All Science Journal Classification (ASJC) codes

  • Software

Cite this

Gaina, D. M., Tutu, I., & Riesco, A. (2019). Specification and Verification of Invariant Properties of Transition Systems. In Proceedings - 25th Asia-Pacific Software Engineering Conference, APSEC 2018 (pp. 99-108). [8719485] (Proceedings - Asia-Pacific Software Engineering Conference, APSEC; Vol. 2018-December). IEEE Computer Society. https://doi.org/10.1109/APSEC.2018.00024

Specification and Verification of Invariant Properties of Transition Systems. / Gaina, Daniel Mircea; Tutu, Ionut; Riesco, Adrian.

Proceedings - 25th Asia-Pacific Software Engineering Conference, APSEC 2018. IEEE Computer Society, 2019. p. 99-108 8719485 (Proceedings - Asia-Pacific Software Engineering Conference, APSEC; Vol. 2018-December).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Gaina, DM, Tutu, I & Riesco, A 2019, Specification and Verification of Invariant Properties of Transition Systems. in Proceedings - 25th Asia-Pacific Software Engineering Conference, APSEC 2018., 8719485, Proceedings - Asia-Pacific Software Engineering Conference, APSEC, vol. 2018-December, IEEE Computer Society, pp. 99-108, 25th Asia-Pacific Software Engineering Conference, APSEC 2018, Nara, Japan, 12/4/18. https://doi.org/10.1109/APSEC.2018.00024
Gaina DM, Tutu I, Riesco A. Specification and Verification of Invariant Properties of Transition Systems. In Proceedings - 25th Asia-Pacific Software Engineering Conference, APSEC 2018. IEEE Computer Society. 2019. p. 99-108. 8719485. (Proceedings - Asia-Pacific Software Engineering Conference, APSEC). https://doi.org/10.1109/APSEC.2018.00024
Gaina, Daniel Mircea ; Tutu, Ionut ; Riesco, Adrian. / Specification and Verification of Invariant Properties of Transition Systems. Proceedings - 25th Asia-Pacific Software Engineering Conference, APSEC 2018. IEEE Computer Society, 2019. pp. 99-108 (Proceedings - Asia-Pacific Software Engineering Conference, APSEC).
@inproceedings{c68bc696df80430d819c81cfcc7a7a46,
title = "Specification and Verification of Invariant Properties of Transition Systems",
abstract = "Transition systems provide a natural way to specify and reason about the behaviour of discrete systems, and in particular about the computations that they may perform. This paper advances a verification method for transition systems whose reachable states are described explicitly by membership axioms. The proof technique is implemented in the Constructor-based Inductive Theorem Prover (CITP), a proof management tool built on top of a variation of conditional equational logic enhanced with many modern features. This approach complements the so-called OTS method, a verification procedure for observational transition systems that is already implemented in CITP.",
author = "Gaina, {Daniel Mircea} and Ionut Tutu and Adrian Riesco",
year = "2019",
month = "5",
day = "21",
doi = "10.1109/APSEC.2018.00024",
language = "English",
series = "Proceedings - Asia-Pacific Software Engineering Conference, APSEC",
publisher = "IEEE Computer Society",
pages = "99--108",
booktitle = "Proceedings - 25th Asia-Pacific Software Engineering Conference, APSEC 2018",
address = "United States",

}

TY - GEN

T1 - Specification and Verification of Invariant Properties of Transition Systems

AU - Gaina, Daniel Mircea

AU - Tutu, Ionut

AU - Riesco, Adrian

PY - 2019/5/21

Y1 - 2019/5/21

N2 - Transition systems provide a natural way to specify and reason about the behaviour of discrete systems, and in particular about the computations that they may perform. This paper advances a verification method for transition systems whose reachable states are described explicitly by membership axioms. The proof technique is implemented in the Constructor-based Inductive Theorem Prover (CITP), a proof management tool built on top of a variation of conditional equational logic enhanced with many modern features. This approach complements the so-called OTS method, a verification procedure for observational transition systems that is already implemented in CITP.

AB - Transition systems provide a natural way to specify and reason about the behaviour of discrete systems, and in particular about the computations that they may perform. This paper advances a verification method for transition systems whose reachable states are described explicitly by membership axioms. The proof technique is implemented in the Constructor-based Inductive Theorem Prover (CITP), a proof management tool built on top of a variation of conditional equational logic enhanced with many modern features. This approach complements the so-called OTS method, a verification procedure for observational transition systems that is already implemented in CITP.

UR - http://www.scopus.com/inward/record.url?scp=85066784694&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85066784694&partnerID=8YFLogxK

U2 - 10.1109/APSEC.2018.00024

DO - 10.1109/APSEC.2018.00024

M3 - Conference contribution

AN - SCOPUS:85066784694

T3 - Proceedings - Asia-Pacific Software Engineering Conference, APSEC

SP - 99

EP - 108

BT - Proceedings - 25th Asia-Pacific Software Engineering Conference, APSEC 2018

PB - IEEE Computer Society

ER -