Formally Verifying a Transformation from MLTL Formulas to Regular Expressions
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915126974611456 |
|---|---|
| author | Wang, Zili Kosaian, Katherine Rozier, Kristin Yvonne |
| author_facet | Wang, Zili Kosaian, Katherine Rozier, Kristin Yvonne |
| contents | Mission-time Linear Temporal Logic (MLTL), a widely used subset of popular specification logics like STL and MTL, is often used to model and verify real world systems in safety-critical contexts. As the results of formal verification are only as trustworthy as their input specifications, the WEST tool was created to facilitate writing MLTL specifications. Accordingly, it is vital to demonstrate that WEST itself works correctly. To that end, we verify the WEST algorithm, which converts MLTL formulas to (logically equivalent) regular expressions, in the theorem prover Isabelle/HOL. Our top-level result establishes the correctness of the regular expression transformation; we then generate a code export from our verified development and use this to experimentally validate the existing WEST tool. To facilitate this, we develop some verified support for checking the equivalence of two regular expressions. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_17444 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Formally Verifying a Transformation from MLTL Formulas to Regular Expressions Wang, Zili Kosaian, Katherine Rozier, Kristin Yvonne Logic in Computer Science 68V15, 68V20, 03B35, 03B44, 03B70 F.3.1; F.4.1 Mission-time Linear Temporal Logic (MLTL), a widely used subset of popular specification logics like STL and MTL, is often used to model and verify real world systems in safety-critical contexts. As the results of formal verification are only as trustworthy as their input specifications, the WEST tool was created to facilitate writing MLTL specifications. Accordingly, it is vital to demonstrate that WEST itself works correctly. To that end, we verify the WEST algorithm, which converts MLTL formulas to (logically equivalent) regular expressions, in the theorem prover Isabelle/HOL. Our top-level result establishes the correctness of the regular expression transformation; we then generate a code export from our verified development and use this to experimentally validate the existing WEST tool. To facilitate this, we develop some verified support for checking the equivalence of two regular expressions. |
| title | Formally Verifying a Transformation from MLTL Formulas to Regular Expressions |
| topic | Logic in Computer Science 68V15, 68V20, 03B35, 03B44, 03B70 F.3.1; F.4.1 |
| url | https://arxiv.org/abs/2501.17444 |