A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Visibly Linear Dynamic Logic
[article]
2017
arXiv
pre-print
We introduce Visibly Linear Dynamic Logic (VLDL), which extends Linear Temporal Logic (LTL) by temporal operators that are guarded by visibly pushdown languages over finite words. In VLDL one can, e.g., express that a function resets a variable to its original value after its execution, even in the presence of an unbounded number of intermediate recursive calls. We prove that VLDL describes exactly the ω-visibly pushdown languages. Thus it is strictly more expressive than LTL and able to
arXiv:1512.05177v2
fatcat:f6uldf5zcvcc5craj7nos4s4pm