A Branching Time Variant of CaRet
From MaRDI portal
Publication:5883579
DOI10.1007/978-3-319-94111-0_9OpenAlexW2808113425MaRDI QIDQ5883579FDOQ5883579
Authors: Jens Oliver Gutsfeld, Markus Müller-Olm, Benedikt Nordhoff
Publication date: 21 March 2023
Published in: Model Checking Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-94111-0_9
Recommendations
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Cites Work
- Visibly pushdown languages
- Adding nesting structure to words
- Pushdown processes: Games and model-checking
- Reachability analysis of pushdown automata: Application to model-checking
- Title not available (Why is that?)
- Tools and Algorithms for the Construction and Analysis of Systems
- A fixpoint calculus for local and global program flows
- Languages of Nested Trees
- Model checking LTL with regular valuations for pushdown systems
- Complexity results on branching-time pushdown model checking
- Efficient CTL model-checking for pushdown systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- First-Order and Temporal Logics for Nested Words
- A Temporal Logic for Multi-threaded Programs
- Visibly linear dynamic logic
- Model checking the full modal mu-calculus for infinite sequential processes
- Winning Regions of Pushdown Parity Games: A Saturation Method
- Visibly linear temporal logic
- Data flow analysis as model checking
- CaRet with forgettable past
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)