Pages that link to "Item:Q2958531"
From MaRDI portal
The following pages link to The fixed-parameter tractability of model checking concurrent systems (Q2958531):
Displaying 9 items.
- Compact and efficiently verifiable models for concurrent systems (Q1620959) (← links)
- Model checking of concurrent software systems via heuristic-guided SAT solving (Q2093157) (← links)
- The complexity of model checking multi-stack systems (Q2398213) (← links)
- Concurrency makes simple theories hard (Q2904757) (← links)
- Model checking concurrent programs with nondeterminism and randomization (Q2908866) (← links)
- The Complexity of Model Checking Multi-stack Systems (Q5271053) (← links)
- On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems (Q5387903) (← links)
- (Q5690304) (← links)
- On the complexity of verifying concurrent transition systems (Q6044122) (← links)