Henri Hansen

Orcid: 0000-0003-4052-6173

According to our database1, Henri Hansen authored at least 23 papers between 2002 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Detachment Problem - Application in Prevention of Information Leakage in Stock Markets.
CoRR, 2024

2018
Progress Checking for Dummies.
Proceedings of the Formal Methods for Industrial Critical Systems, 2018

2017
Stubborn Set Intuition Explained.
Trans. Petri Nets Other Model. Concurr., 2017

FiB: squeezing loop invariants by interpolation between Forward/Backward predicate transformers.
Proceedings of the 32nd IEEE/ACM International Conference on Automated Software Engineering, 2017

Abstractions for Transition Systems with Applications to Stubborn Sets.
Proceedings of the Concurrency, Security, and Puzzles, 2017

2016
Guard-based partial-order reduction.
Int. J. Softw. Tools Technol. Transf., 2016

Safety Property-Driven Stubborn Sets.
Proceedings of the Reachability Problems - 10th International Workshop, 2016

2015
Practical Partial Order Reduction for CSP.
Proceedings of the NASA Formal Methods - 7th International Symposium, 2015

2014
A comparison of confluence and ample sets in probabilistic and non-probabilistic branching time.
Theor. Comput. Sci., 2014

Old and New Algorithms for Minimal Coverability Sets.
Fundam. Informaticae, 2014

Diamonds Are a Girl's Best Friend: Partial Order Reduction for Timed Automata with Abstractions.
Proceedings of the Computer Aided Verification - 26th International Conference, 2014

2011
Can Stubborn Sets Be Optimal?
Fundam. Informaticae, 2011

Partial Order Reduction for Model Checking Markov Decision Processes under Unconditional Fairness.
Proceedings of the Eighth International Conference on Quantitative Evaluation of Systems, 2011

On the Origin of Events: Branching Cells as Stubborn Sets.
Proceedings of the Applications and Theory of Petri Nets - 32nd International Conference, 2011

Compositional Analysis for Weak Stubborn Sets.
Proceedings of the 11th International Conference on Application of Concurrency to System Design, 2011

2009
Exploring the Scope for Partial Order Reduction.
Proceedings of the Automated Technology for Verification and Analysis, 2009

2008
Cheap and Small Counterexamples.
Proceedings of the Sixth IEEE International Conference on Software Engineering and Formal Methods, 2008

2006
Larger Automata and Less Work for LTL Model Checking.
Proceedings of the Model Checking Software, 13th International SPIN Workshop, Vienna, Austria, March 30, 2006

Operational Determinism and Fast Algorithms.
Proceedings of the CONCUR 2006 - Concurrency Theory, 17th International Conference, 2006

Minimal Counterexamples in O(n log n) Memory and O(n^2) Time.
Proceedings of the Sixth International Conference on Application of Concurrency to System Design (ACSD 2006), 2006

2004
Tampere Verification Tool.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2004

2003
Merging State-Based and Action-Based Verification.
Proceedings of the 3rd International Conference on Application of Concurrency to System Design (ACSD 2003), 2003

2002
Stuttering-Insensitive Automata for On-the-fly Detection of Livelock Properties.
Proceedings of the 7th International ERCIM Workshop in Formal Methods for Industrial Critical Systems, 2002


  Loading...