default search action
Emmanuel Haucourt
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j5]Pierre-Yves Coursolle, Emmanuel Haucourt:
Non-existing and ill-behaved coequalizers of locally ordered spaces. J. Appl. Comput. Topol. 8(4): 971-1021 (2024) - 2021
- [i3]Pierre-Yves Coursolle, Emmanuel Haucourt:
Non-existing and ill-behaved coequalizers of locally ordered spaces. CoRR abs/2110.08311 (2021)
2010 – 2019
- 2019
- [j4]Emmanuel Haucourt, Nicolas Ninin:
Unique decomposition of homogeneous languages and application to isothetic regions. Math. Struct. Comput. Sci. 29(5): 681-730 (2019) - 2018
- [j3]Emmanuel Haucourt:
The geometry of conservative programs. Math. Struct. Comput. Sci. 28(10): 1723-1769 (2018) - 2016
- [b3]Emmanuel Haucourt:
Some Invariants of Directed Topology towards a Theoretical Base for a Static Analyzer Dealing with Fine-Grain Concurrency. Paris Diderot University, France, 2016 - [b2]Lisbeth Fajstrup, Eric Goubault, Emmanuel Haucourt, Samuel Mimram, Martin Raussen:
Directed Algebraic Topology and Concurrency. Springer 2016, ISBN 978-3-319-15397-1, pp. 1-167 - 2014
- [c9]Nicolas Ninin, Emmanuel Haucourt:
The Boolean Algebra of Cubical Areas as a Tensor Product in the Category of Semilattices with Zero. ICE 2014: 60-66 - 2012
- [c8]Lisbeth Fajstrup, Eric Goubault, Emmanuel Haucourt, Samuel Mimram, Martin Raußen:
Trace Spaces: An Efficient New Technique for State-Space Reduction. ESOP 2012: 274-294 - [i2]Lisbeth Fajstrup, Eric Goubault, Emmanuel Haucourt, Samuel Mimram, Martin Raussen:
Trace Spaces: an Efficient New Technique for State-Space Reduction. CoRR abs/1204.0414 (2012) - 2011
- [c7]Richard Bonichon, Géraud Canet, Loïc Correnson, Eric Goubault, Emmanuel Haucourt, Michel Hirschowitz, Sébastien Labbé, Samuel Mimram:
Rigorous Evidence of Freedom from Concurrency Faults in Industrial Control Software. SAFECOMP 2011: 85-98 - 2010
- [c6]Thibaut Balabonski, Emmanuel Haucourt:
A Geometric Approach to the Problem of Unique Decomposition of Processes. CONCUR 2010: 132-146 - [c5]Emmanuel Haucourt:
Streams, d-Spaces and Their Fundamental Categories. GETCO 2010: 111-151 - [c4]Eric Goubault, Emmanuel Haucourt, Sanjeevi Krishnan:
Future Path-components in Directed Topology. MFPS 2010: 325-335 - [i1]Thibaut Balabonski, Emmanuel Haucourt:
A Geometric Approach to the Problem of Unique Decomposition of Processes. CoRR abs/1004.2780 (2010)
2000 – 2009
- 2007
- [j2]Eric Goubault, Emmanuel Haucourt:
Components of the Fundamental Category II. Appl. Categorical Struct. 15(4): 387-414 (2007) - 2005
- [b1]Emmanuel Haucourt:
Topologie Algébrique Dirigée et Concurrence. (Directed Algebraic Topology and Concurrency). Paris Diderot University, France, 2005 - [c3]Eric Goubault, Emmanuel Haucourt:
A Practical Application of Geometric Semantics to Static Analysis of Concurrent Programs. CONCUR 2005: 503-517 - [c2]Emmanuel Haucourt:
Comparing Topological Models for Concurrency. GETCO@CONCUR 2005: 111-127 - 2004
- [j1]Lisbeth Fajstrup, Martin Raußen, Eric Goubault, Emmanuel Haucourt:
Components of the Fundamental Category. Appl. Categorical Struct. 12(1): 81-108 (2004) - [c1]Emmanuel Haucourt:
A Framework for Component Categories. GETCO@DISC 2004: 39-69
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-10-16 20:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint