Pages that link to "Item:Q5191527"
From MaRDI portal
The following pages link to FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science (Q5191527):
Displaying 21 items.
- On the almighty wand (Q418137) (← links)
- Moving in a network under random failures: a complexity analysis (Q433350) (← links)
- \(\mathsf{QCTL}\) model-checking with \(\mathsf{QBF}\) solvers (Q821566) (← links)
- Computation as social agency: what, how and who (Q1641025) (← links)
- Model checking properties on reduced trace systems (Q1736621) (← links)
- Verification of dynamic bisimulation theorems in Coq (Q2035655) (← links)
- The modal logic of copy and remove (Q2401633) (← links)
- A game theoretic approach to the analysis of dynamic networks (Q2864354) (← links)
- Reasoning About Substructures and Games (Q2957764) (← links)
- Sabotage Modal Logic: Some Model and Proof Theoretic Aspects (Q3457681) (← links)
- On the Almighty Wand (Q3540188) (← links)
- Branching-Time Temporal Logics with Minimal Model Quantifiers (Q3637242) (← links)
- Separation logics and modalities: a survey (Q4586138) (← links)
- Global and Local Graph Modifiers (Q4982127) (← links)
- (Q5015266) (← links)
- Copy and remove as dynamic operators (Q5861999) (← links)
- A simple logic of the hide and seek game (Q6057624) (← links)
- Axiomatization of hybrid logic of link variations (Q6546612) (← links)
- The modal logics of the poison game (Q6601761) (← links)
- Solution complexity of local variants of sabotage game (Q6601766) (← links)
- Graph games and logic design (Q6601767) (← links)
