Abstract
This paper proposes an approach to verifying context free properties of programs. In this approach, the system to be verified is modeled as a program m in Modeling, Simulation and Verification Language (MSVL), and the desired property is also specified by an MSVL program m′. Then program m and formula ¬m′ are interpreted by means of executing programs m and m′. If an acceptable execution path is generated, a counterexample is found, otherwise the property is valid. To show how the proposed approach works, an example is given.
| Original language | English |
|---|---|
| Pages (from-to) | 519-530 |
| Number of pages | 12 |
| Journal | Theoretical Computer Science |
| Volume | 809 |
| DOIs | |
| State | Published - 24 Feb 2020 |
| Externally published | Yes |
Keywords
- Algorithm
- Automata
- Model Checking
- Runtime Verification
- Temporal Logic
Fingerprint
Dive into the research topics of 'A novel approach to verifying context free properties of programs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver