The following pages link to (Q4251060):
Displaying 12 items.
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols (Q880981) (← links)
- On minimal elements of upward-closed sets (Q1019726) (← links)
- Undecidable problems in unreliable computations. (Q1401309) (← links)
- A general approach to comparing infinite-state systems with their finite-state specifications (Q2503044) (← links)
- Expand, enlarge and check: new algorithms for the coverability problem of WSTS (Q2581762) (← links)
- (Q2842877) (← links)
- Narrowing and Rewriting Logic: from Foundations to Applications (Q2873786) (← links)
- An Assertional Language for the Verification of Systems Parametric in Several Dimensions (Q4921503) (← links)
- (Q5009453) (← links)
- (Q5111627) (← links)
- Decidability of model checking with the temporal logic EF (Q5941100) (← links)
- Well-structured transition systems everywhere! (Q5941101) (← links)
