A Branching Time Variant of CaRet
From MaRDI portal
Publication:5883579
Recommendations
Cites work
- scientific article; zbMATH DE number 1670780 (Why is no real title available?)
- scientific article; zbMATH DE number 1796143 (Why is no real title available?)
- scientific article; zbMATH DE number 2086664 (Why is no real title available?)
- A Temporal Logic for Multi-threaded Programs
- A fixpoint calculus for local and global program flows
- Adding nesting structure to words
- CaRet with forgettable past
- Complexity results on branching-time pushdown model checking
- Data flow analysis as model checking
- Efficient CTL model-checking for pushdown systems
- First-Order and Temporal Logics for Nested Words
- Languages of Nested Trees
- Model checking LTL with regular valuations for pushdown systems
- Model checking the full modal mu-calculus for infinite sequential processes
- Pushdown processes: Games and model-checking
- Reachability analysis of pushdown automata: Application to model-checking
- Tools and Algorithms for the Construction and Analysis of Systems
- Visibly linear dynamic logic
- Visibly linear temporal logic
- Visibly pushdown languages
- Winning Regions of Pushdown Parity Games: A Saturation Method
Cited in
(5)
This page was built for publication: A Branching Time Variant of CaRet
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5883579)