The following pages link to (Q4353636):
Displaying 15 items.
- Optimising the ProB model checker for B using partial order reduction (Q736463) (← links)
- Stubborn set reduction for timed reachability and safety games (Q832029) (← links)
- Optimistic synchronization-based state-space reduction (Q853724) (← links)
- Question-guided stubborn set methods for state properties (Q862861) (← links)
- On stubborn sets in the verification of linear time temporal properties (Q1774568) (← links)
- Exponential automatic amortized resource analysis (Q2200835) (← links)
- The inconsistent labelling problem of stutter-preserving partial-order reduction (Q2200842) (← links)
- On constructibility and unconstructibility of LTS operators from other LTS operators (Q2340256) (← links)
- A comparison of confluence and ample sets in probabilistic and non-probabilistic branching time (Q2453113) (← links)
- On the Origin of Events: Branching Cells as Stubborn Sets (Q3011891) (← links)
- Partial-Order Reduction (Q3176364) (← links)
- Stubborn Sets, Frozen Actions, and Fair Testing (Q4989170) (← links)
- Model Checking Linear-Time Properties of Probabilistic Systems (Q5072555) (← links)
- (Q5155669) (← links)
- Partial-Order Reduction for Parity Games with an Application on Parameterised Boolean Equation Systems (Q5164176) (← links)
