Runtime verification by convergent formula progression

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

Runtime verification is a dynamic verification technique widely used in practice. In this paper we revisit the runtime verification technique with formula progression, which verifies the execution trace step by step by progressing the desired property written in temporal logic. The previous work did not discuss explicitly the bound for the sizes of expanded formulas, while the successive invoking of formula progression is likely to cause divergence. In this paper1, we present the convergent formula progression by introducing a novel fixpoint reduction technique, and prove it guarantees the sizes of expanded formulas be always convergent. To the best of our knowledge, this is the first work discussing the convergence of formula progression. Furthermore, we implement the new runtime verification framework, and experiments show the efficiency of our proposed strategy.

Original languageEnglish
Title of host publicationProceedings - 21st Asia-Pacific Software Engineering Conference, APSEC 2014
EditorsYann-Gael Gueheneuc, Gihwon Kwon, Sungdeok Cha
PublisherIEEE Computer Society
Pages255-262
Number of pages8
ISBN (Electronic)9781479974252
DOIs
StatePublished - 2014
Event21st Asia-Pacific Software Engineering Conference, APSEC 2014 - Jeju Island, Korea, Republic of
Duration: 1 Dec 20144 Dec 2014

Publication series

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

Conference

Conference21st Asia-Pacific Software Engineering Conference, APSEC 2014
Country/TerritoryKorea, Republic of
CityJeju Island
Period1/12/144/12/14

Fingerprint

Dive into the research topics of 'Runtime verification by convergent formula progression'. Together they form a unique fingerprint.

Cite this