Henri Hansen
Henri Hansen
Docent, University Lecturer, Mathematics, Tampere University
Verified email at
Cited by
Cited by
Guard-based partial-order reduction
A Laarman, E Pater, J Van de Pol, H Hansen
International journal on software tools for technology transfer 18, 427-448, 2016
Larger automata and less work for LTL model checking
J Geldenhuys, H Hansen
Model Checking Software: 13th International SPIN Workshop, Vienna, Austria …, 2006
Old and new algorithms for minimal coverability sets
A Valmari, H Hansen
Fundamenta Informaticae 131 (1), 1-25, 2014
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
Stubborn set intuition explained
A Valmari, H Hansen
Transactions on Petri Nets and Other Models of Concurrency XII, 140-165, 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
Computer Aided Verification: 26th International Conference, CAV 2014, Held …, 2014
Can stubborn sets be optimal?
A Valmari, H Hansen
Applications and Theory of Petri Nets: 31st International Conference, PETRI …, 2010
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
Practical partial order reduction for CSP
T Gibson-Robinson, H Hansen, AW Roscoe, X Wang
NASA Formal Methods: 7th International Symposium, NFM 2015, Pasadena, CA …, 2015
Exploring the scope for partial order reduction
J Geldenhuys, H Hansen, A Valmari
Automated Technology for Verification and Analysis: 7th International …, 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
Merging state-based and action-based verification
H Hansen, H Virtanen, A Valmari
Third International Conference on Application of Concurrency to System …, 2003
Can stubborn sets be optimal?
A Valmari, H Hansen
Fundamenta Informaticae 113 (3-4), 377-397, 2011
Cheap and small counterexamples
H Hansen, J Geldenhuys
2008 Sixth IEEE International Conference on Software Engineering and Formal …, 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
Compositional analysis for weak stubborn sets
H Hansen, X Wang
2011 Eleventh International Conference on Application of Concurrency to …, 2011
Stubborn set intuition explained
A Valmari, H Hansen
International Workshop on Petri Nets and Software Engineering, PNSE 2016 …, 2016
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
Tampere verification tool
H Virtanen, H Hansen, A Valmari, J Nieminen, T Erkkilä
Tools and Algorithms for the Construction and Analysis of Systems: 10th …, 2004
Operational determinism and fast algorithms
H Hansen, A Valmari
International Conference on Concurrency Theory, 188-202, 2006
The system can't perform the operation now. Try again later.
Articles 1–20