Branching Temporal Logic of Calls and Returns for Pushdown Systems
From MaRDI portal
Publication:6162219
DOI10.1007/978-3-319-98938-9_19zbMath1514.68035arXiv1805.04580OpenAlexW2800629568MaRDI QIDQ6162219
Unnamed Author, Tayssir Touili
Publication date: 28 June 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.04580
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cites Work
- Unnamed Item
- Model checking LTL with regular valuations for pushdown systems
- Efficient CTL Model-Checking for Pushdown Systems
- An Automata-Theoretic Approach to Infinite-State Systems
- Model checking the full modal mu-calculus for infinite sequential processes
- Efficient Malware Detection Using Model-Checking
- Tools and Algorithms for the Construction and Analysis of Systems
- LTL Model-Checking for Malware Detection
- Languages of Nested Trees
- Verification, Model Checking, and Abstract Interpretation
- Reachability analysis of pushdown automata: Application to model-checking
This page was built for publication: Branching Temporal Logic of Calls and Returns for Pushdown Systems
