Sound and complete witnesses for template-based verification of LTL properties on polynomial programs
We study the classical problem of verifying programs with respect to formal specifications given in the linear temporal logic (LTL). We first present novel sound and complete witnesses for LTL verification over imperative programs. Our witnesses are applicable to both verification (proving) and refu...
Saved in:
Main Authors: | , , , , |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2024
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/9339 https://ink.library.smu.edu.sg/context/sis_research/article/10339/viewcontent/79208d93_630a_48bf_9e52_8661d8ae4751.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
id |
sg-smu-ink.sis_research-10339 |
---|---|
record_format |
dspace |
spelling |
sg-smu-ink.sis_research-103392024-10-08T06:56:08Z Sound and complete witnesses for template-based verification of LTL properties on polynomial programs CHATTERJEE, Krishnendu GOHARSHADY, Amir GOHARSHADY, Ehsan KARRABI, Mehrdad ZIKELIC, Dorde We study the classical problem of verifying programs with respect to formal specifications given in the linear temporal logic (LTL). We first present novel sound and complete witnesses for LTL verification over imperative programs. Our witnesses are applicable to both verification (proving) and refutation (finding bugs) settings. We then consider LTL formulas in which atomic propositions can be polynomial constraints and turn our focus to polynomial arithmetic programs, i.e. programs in which every assignment and guard consists only of polynomial expressions. For this setting, we provide an efficient algorithm to automatically synthesize such LTL witnesses. Our synthesis procedure is both sound and semi-complete. Finally, we present experimental results demonstrating the effectiveness of our approach and that it can handle programs which were beyond the reach of previous state-of-the-art tools. 2024-09-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/9339 info:doi/10.1007/978-3-031-71162-6_31 https://ink.library.smu.edu.sg/context/sis_research/article/10339/viewcontent/79208d93_630a_48bf_9e52_8661d8ae4751.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Artificial Intelligence and Robotics Programming Languages and Compilers |
institution |
Singapore Management University |
building |
SMU Libraries |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
SMU Libraries |
collection |
InK@SMU |
language |
English |
topic |
Artificial Intelligence and Robotics Programming Languages and Compilers |
spellingShingle |
Artificial Intelligence and Robotics Programming Languages and Compilers CHATTERJEE, Krishnendu GOHARSHADY, Amir GOHARSHADY, Ehsan KARRABI, Mehrdad ZIKELIC, Dorde Sound and complete witnesses for template-based verification of LTL properties on polynomial programs |
description |
We study the classical problem of verifying programs with respect to formal specifications given in the linear temporal logic (LTL). We first present novel sound and complete witnesses for LTL verification over imperative programs. Our witnesses are applicable to both verification (proving) and refutation (finding bugs) settings. We then consider LTL formulas in which atomic propositions can be polynomial constraints and turn our focus to polynomial arithmetic programs, i.e. programs in which every assignment and guard consists only of polynomial expressions. For this setting, we provide an efficient algorithm to automatically synthesize such LTL witnesses. Our synthesis procedure is both sound and semi-complete. Finally, we present experimental results demonstrating the effectiveness of our approach and that it can handle programs which were beyond the reach of previous state-of-the-art tools. |
format |
text |
author |
CHATTERJEE, Krishnendu GOHARSHADY, Amir GOHARSHADY, Ehsan KARRABI, Mehrdad ZIKELIC, Dorde |
author_facet |
CHATTERJEE, Krishnendu GOHARSHADY, Amir GOHARSHADY, Ehsan KARRABI, Mehrdad ZIKELIC, Dorde |
author_sort |
CHATTERJEE, Krishnendu |
title |
Sound and complete witnesses for template-based verification of LTL properties on polynomial programs |
title_short |
Sound and complete witnesses for template-based verification of LTL properties on polynomial programs |
title_full |
Sound and complete witnesses for template-based verification of LTL properties on polynomial programs |
title_fullStr |
Sound and complete witnesses for template-based verification of LTL properties on polynomial programs |
title_full_unstemmed |
Sound and complete witnesses for template-based verification of LTL properties on polynomial programs |
title_sort |
sound and complete witnesses for template-based verification of ltl properties on polynomial programs |
publisher |
Institutional Knowledge at Singapore Management University |
publishDate |
2024 |
url |
https://ink.library.smu.edu.sg/sis_research/9339 https://ink.library.smu.edu.sg/context/sis_research/article/10339/viewcontent/79208d93_630a_48bf_9e52_8661d8ae4751.pdf |
_version_ |
1814047914361618432 |