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: | CHATTERJEE, Krishnendu, GOHARSHADY, Amir, GOHARSHADY, Ehsan, KARRABI, Mehrdad, ZIKELIC, Dorde |
---|---|
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 |
Similar Items
-
Sound and complete certificates for quantitative termination analysis of probabilistic programs
by: CHATTERJEE, Krishnendu, et al.
Published: (2022) -
Solving long-run average reward robust MDPs via stochastic games
by: CHATTERJEE, Krishnendu, et al.
Published: (2024) -
Proving non-termination by program reversal
by: CHATTERJEE, Krishnendu, et al.
Published: (2021) -
Equivalence and similarity refutation for probabilistic programs
by: CHATTERJEE, Krishnendu, et al.
Published: (2025) -
Quantitative bounds on resource usage of probabilistic programs
by: CHATTERJEE, Krishnendu, et al.
Published: (2026)