Interval Temporal Logic for Visibly Pushdown Systems
From MaRDI portal
Publication:6116361
DOI10.1145/3583756OpenAlexW2997017553MaRDI QIDQ6116361
Angelo Montanari, Laura Bozzelli, Adriano Peron
Publication date: 18 July 2023
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3583756
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maintaining knowledge about temporal intervals
- Checking interval properties of computations
- Interval temporal logics over strongly discrete linear orders: expressiveness and complexity
- Visibly linear temporal logic
- Pushdown module checking
- Intervals and tenses
- Model checking for fragments of Halpern and Shoham's interval temporal logic based on track representatives
- Decidability and complexity of the fragments of the modal logic of Allen's relations over the rationals
- Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy
- Model checking interval temporal logics with regular expressions
- The dark side of interval temporal logic: marking the undecidability border
- Expressiveness and completeness of an interval tense logic
- Temporal prepositions and their logic
- Optimal Tableau Systems for Propositional Neighborhood Logic over All, Dense, and Discrete Linear Orders
- Tableaux for Logics of Subinterval Structures over Dense Orderings
- Adding nesting structure to words
- A decidable weakening of Compass Logic based on cone-shaped cardinal directions
- Visibly pushdown languages
- “Sometimes” and “not never” revisited
- A propositional modal logic of time intervals
- Interval vs. Point Temporal Logic Model Checking
- Satisfiability and model checking for the logic of sub-intervals under the homogeneity assumption
- Tools and Algorithms for the Construction and Analysis of Systems
- A fixpoint calculus for local and global program flows
- The Undecidability of the Logic of Subintervals
- Reachability analysis of pushdown automata: Application to model-checking
