The following pages link to (Q4133096):
Displaying 5 items.
- Slicing communicating automata specifications: Polynomial algorithms for model reduction (Q1019005) (← links)
- A strong-connectivity algorithm and its applications in data flow analysis (Q1144380) (← links)
- Pathlistings applied to data flow analysis (Q1155957) (← links)
- Lower bounds on the lengths of node sequences in directed graphs (Q1233875) (← links)
- Node listings for reducible flow graphs (Q1236887) (← links)