default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHenri Hansen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i1]Henri Hansen, Juho Kanniainen:
Detachment Problem - Application in Prevention of Information Leakage in Stock Markets. CoRR abs/2401.07074 (2024)
2010 – 2019
- 2018
- [c20]Antti Valmari
, Henri Hansen:
Progress Checking for Dummies. FMICS 2018: 115-130 - 2017
- [j5]Antti Valmari, Henri Hansen:
Stubborn Set Intuition Explained. Trans. Petri Nets Other Model. Concurr. 12: 140-165 (2017) - [c19]Henri Hansen:
Abstractions for Transition Systems with Applications to Stubborn Sets. Concurrency, Security, and Puzzles 2017: 104-123 - [c18]Shang-Wei Lin, Jun Sun, Hao Xiao, Yang Liu, David Sanán, Henri Hansen:
FiB: squeezing loop invariants by interpolation between Forward/Backward predicate transformers. ASE 2017: 793-803 - 2016
- [j4]Alfons Laarman, Elwin Pater, Jaco van de Pol, Henri Hansen:
Guard-based partial-order reduction. Int. J. Softw. Tools Technol. Transf. 18(4): 427-448 (2016) - [c17]Antti Valmari, Henri Hansen:
Stubborn Set Intuition Explained. PNSE @ Petri Nets 2016: 213-232 - [c16]Henri Hansen, Antti Valmari:
Safety Property-Driven Stubborn Sets. RP 2016: 90-103 - 2015
- [c15]Thomas Gibson-Robinson, Henri Hansen, A. W. Roscoe, Xu Wang:
Practical Partial Order Reduction for CSP. NFM 2015: 188-203 - 2014
- [j3]Antti Valmari, Henri Hansen:
Old and New Algorithms for Minimal Coverability Sets. Fundam. Informaticae 131(1): 1-25 (2014) - [j2]Henri Hansen, Mark Timmer:
A comparison of confluence and ample sets in probabilistic and non-probabilistic branching time. Theor. Comput. Sci. 538: 103-123 (2014) - [c14]Henri Hansen, Shang-Wei Lin, Yang Liu, Truong Khanh Nguyen, Jun Sun:
Diamonds Are a Girl's Best Friend: Partial Order Reduction for Timed Automata with Abstractions. CAV 2014: 391-406 - 2012
- [c13]Antti Valmari, Henri Hansen:
Old and New Algorithms for Minimal Coverability Sets. Petri Nets 2012: 208-227 - 2011
- [j1]Antti Valmari, Henri Hansen:
Can Stubborn Sets Be Optimal? Fundam. Informaticae 113(3-4): 377-397 (2011) - [c12]Henri Hansen, Xu Wang:
Compositional Analysis for Weak Stubborn Sets. ACSD 2011: 36-43 - [c11]Henri Hansen, Xu Wang:
On the Origin of Events: Branching Cells as Stubborn Sets. Petri Nets 2011: 248-267 - [c10]Henri Hansen, Marta Z. Kwiatkowska, Hongyang Qu:
Partial Order Reduction for Model Checking Markov Decision Processes under Unconditional Fairness. QEST 2011: 203-212 - 2010
- [c9]Antti Valmari, Henri Hansen:
Can Stubborn Sets Be Optimal? Petri Nets 2010: 43-62
2000 – 2009
- 2009
- [c8]Jaco Geldenhuys, Henri Hansen, Antti Valmari:
Exploring the Scope for Partial Order Reduction. ATVA 2009: 39-53 - 2008
- [c7]Henri Hansen, Jaco Geldenhuys:
Cheap and Small Counterexamples. SEFM 2008: 53-62 - 2006
- [c6]Henri Hansen, Antti Kervinen:
Minimal Counterexamples in O(n log n) Memory and O(n^2) Time. ACSD 2006: 133-142 - [c5]Henri Hansen, Antti Valmari:
Operational Determinism and Fast Algorithms. CONCUR 2006: 188-202 - [c4]Jaco Geldenhuys, Henri Hansen:
Larger Automata and Less Work for LTL Model Checking. SPIN 2006: 53-70 - 2004
- [c3]Heikki Virtanen, Henri Hansen, Antti Valmari, Juha Nieminen, Timo Erkkilä:
Tampere Verification Tool. TACAS 2004: 153-157 - 2003
- [c2]Henri Hansen, Heikki Virtanen, Antti Valmari:
Merging State-Based and Action-Based Verification. ACSD 2003: 150-156 - 2002
- [c1]Henri Hansen, Wojciech Penczek, Antti Valmari:
Stuttering-Insensitive Automata for On-the-fly Detection of Livelock Properties. FMICS 2002: 178-193
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
