| Larger automata and less work for LTL model checking J Geldenhuys, H Hansen International SPIN Workshop on Model Checking of Software, 53-70, 2006 | 51 | 2006 |
| Guard-based partial-order reduction A Laarman, E Pater, J Van de Pol, H Hansen International journal on software tools for technology transfer 18 (4), 427-448, 2016 | 47 | 2016 |
| Old and new algorithms for minimal coverability sets A Valmari, H Hansen Fundamenta Informaticae 131 (1), 1-25, 2014 | 41 | 2014 |
| Stubborn set intuition explained A Valmari, H Hansen Transactions on Petri Nets and Other Models of Concurrency XII, 140-165, 2017 | 40 | 2017 |
| Stuttering-insensitive automata for on-the-fly detection of livelock properties H Hansen, W Penczek, A Valmari Electronic Notes in Theoretical Computer Science 66 (2), 178-193, 2002 | 38 | 2002 |
| Fib: Squeezing loop invariants by interpolation between forward/backward predicate transformers SW Lin, J Sun, H Xiao, Y Liu, D Sanán, H Hansen 2017 32nd IEEE/ACM International Conference on Automated Software …, 2017 | 32 | 2017 |
| Diamonds are a girl’s best friend: Partial order reduction for timed automata with abstractions H Hansen, SW Lin, Y Liu, TK Nguyen, J Sun International Conference on Computer Aided Verification, 391-406, 2014 | 30 | 2014 |
| Can stubborn sets be optimal? A Valmari, H Hansen International Conference on Applications and Theory of Petri Nets, 43-62, 2010 | 29 | 2010 |
| Practical partial order reduction for CSP T Gibson-Robinson, H Hansen, AW Roscoe, X Wang NASA Formal Methods Symposium, 188-203, 2015 | 28 | 2015 |
| Exploring the scope for partial order reduction J Geldenhuys, H Hansen, A Valmari International Symposium on Automated Technology for Verification and …, 2009 | 28 | 2009 |
| Partial order reduction for model checking Markov decision processes under unconditional fairness H Hansen, M Kwiatkowska, H Qu 2011 Eighth International Conference on Quantitative Evaluation of SysTems …, 2011 | 25 | 2011 |
| Merging state-based and action-based verification H Hansen, H Virtanen, A Valmari Third International Conference on Application of Concurrency to System …, 2003 | 20 | 2003 |
| Can stubborn sets be optimal? A Valmari, H Hansen Fundamenta Informaticae 113 (3-4), 377-397, 2011 | 18 | 2011 |
| Cheap and small counterexamples H Hansen, J Geldenhuys 2008 Sixth IEEE International Conference on Software Engineering and Formal …, 2008 | 18 | 2008 |
| A comparison of confluence and ample sets in probabilistic and non-probabilistic branching time H Hansen, M Timmer Theoretical Computer Science 538, 103-123, 2014 | 13 | 2014 |
| Minimal Counterexamples in O (n log n) Memory and O (n^ 2) Time H Hansen, A Kervinen Sixth International Conference on Application of Concurrency to System …, 2006 | 13 | 2006 |
| Compositional analysis for weak stubborn sets H Hansen, X Wang 2011 Eleventh International Conference on Application of Concurrency to …, 2011 | 12 | 2011 |
| Tampere verification tool H Virtanen, H Hansen, A Valmari, J Nieminen, T Erkkilä International Conference on Tools and Algorithms for the Construction and …, 2004 | 11 | 2004 |
| Operational determinism and fast algorithms H Hansen, A Valmari International Conference on Concurrency Theory, 188-202, 2006 | 8 | 2006 |
| Assessing time-efficiency in a course on data structures and algorithms H Hansen, M Ruuska Proceedings of the Third Finnish/Baltic Sea Conference on Computer Science …, 2003 | 5 | 2003 |
Antti ValmariUniversity of JyväskyläVerified email at jyu.fi
