Title | Journal | Journal Categories | Citations | Publication Date |
---|---|---|---|---|
Computable fixpoints in well-structured symbolic model checking | Formal Methods in System Design |
| 7 | 2013 |
On deterministic finite automata and syntactic monoid size | Theoretical Computer Science |
| 15 | 2004 |
10.1023/B:FORM.0000033962.51898.1a | 2004 | |||
10.1016/S0304-3975(00)00102-X | 2001 | |||
Verifying Programs with Unreliable Channels | Information and Computation |
| 61 | 1996 |