Round- and context-bounded control of dynamic pushdown systems
From MaRDI portal
Publication:6564172
DOI10.1007/S10703-023-00431-0MaRDI QIDQ6564172
Benedikt Bollig, Mathieu Lehaut, Nathalie Sznajder
Publication date: 28 June 2024
Published in: Formal Methods in System Design (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- On notions of regularity for data languages
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- On reachability-related games on vector addition systems with states
- Pushdown processes: Games and model-checking
- Solving Parity Games on Integer Vectors
- Concurrent Games on VASS with Inhibition
- Alternating Vector Addition Systems with States
- Parameterized Model Checking of Token-Passing Systems
- Two-variable logic on data words
- Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Invited Talk).
- Model Checking Games for Branching Time Logics
- Context-Bounded Analysis For Concurrent Programs With Dynamic Creation of Threads
- Playing with Repetitions in Data Words Using Energy Games
- Reachability Games on Extended Vector Addition Systems with States
- Games on Multi-stack Pushdown Systems
- An Algorithm for the General Petri Net Reachability Problem
- The Reachability Problem for Petri Nets Is Not Elementary
- Computer Science Logic
- Parameterized Synthesis
- Context-Bounded Analysis of Concurrent Queue Systems
- On Reasoning About Rings
- Tools and Algorithms for the Construction and Analysis of Systems
- Synthesis of Data Word Transducers
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Round-bounded control of parameterized systems
- Bounded synthesis of register transducers
This page was built for publication: Round- and context-bounded control of dynamic pushdown systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6564172)
