default search action
Romain Demangeon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j4]Romain Demangeon, Nobuko Yoshida
:
Causal computational complexity of distributed processes. Inf. Comput. 290: 104998 (2023) - [c16]Romain Demangeon, Catalin Dima, Daniele Varacca:
Observational Preorders for Alternating Transition Systems. EUMAS 2023: 312-327
2010 – 2019
- 2018
- [c15]Romain Demangeon, Nobuko Yoshida
Causal Computational Complexity of Distributed Processes. LICS 2018: 344-353 - 2017
- [j3]Laura Bocchi, Tzu-Chun Chen
Monitoring networks through multiparty session types. Theor. Comput. Sci. 669: 33-58 (2017) - 2015
- [j2]Romain Demangeon, Kohei Honda, Raymond Hu
Practical interruptible conversations: distributed dynamic verification with multiparty session types and Python. Formal Methods Syst. Des. 46(3): 197-225 (2015) - [c14]Romain Demangeon, Nobuko Yoshida
On the Expressiveness of Multiparty Sessions. FSTTCS 2015: 560-574 - 2014
- [c13]Kohei Honda, Raymond Hu
Structuring Communication with Session Types. Concurrent Objects and Beyond 2014: 105-127 - 2013
- [c12]Laura Bocchi, Tzu-Chun Chen
Monitoring Networks through Multiparty Session Types. FMOODS/FORTE 2013: 50-65 - [c11]Raymond Hu
Practical Interruptible Conversations - Distributed Dynamic Verification with Session Types and Python. RV 2013: 130-148 - [c10]Laura Bocchi, Romain Demangeon:
Embedding Session Types in HML. PLACES 2013: 53-62 - 2012
- [c9]Romain Demangeon, Kohei Honda:
Nested Protocols in Session Types. CONCUR 2012: 272-286 - [c8]Laura Bocchi, Romain Demangeon, Nobuko Yoshida
A Multiparty Multi-session Logic. TGC 2012: 97-111 - 2011
- [c7]Romain Demangeon, Kohei Honda:
Full Abstraction in a Subtyped pi-Calculus with Linear Types. CONCUR 2011: 280-296 - [c6]Romain Demangeon, Daniel Hirschkoff, Davide Sangiorgi:
Strong Normalisation in λ-Calculi with References. FSEN 2011: 128-142 - 2010
- [j1]Romain Demangeon, Daniel Hirschkoff, Davide Sangiorgi:
Termination in higher-order concurrent calculi. J. Log. Algebraic Methods Program. 79(7): 550-577 (2010) - [c5]Romain Demangeon, Daniel Hirschkoff, Davide Sangiorgi:
Termination in Impure Concurrent Languages. CONCUR 2010: 328-342
2000 – 2009
- 2009
- [c4]Romain Demangeon, Daniel Hirschkoff, Davide Sangiorgi:
Mobile Processes and Termination. Semantics and Algebraic Specification 2009: 250-273 - [c3]Romain Demangeon, Daniel Hirschkoff, Davide Sangiorgi:
Termination in Higher-Order Concurrent Calculi. FSEN 2009: 81-96 - 2008
- [c2]Romain Demangeon, Daniel Hirschkoff, Davide Sangiorgi:
Static and dynamic typing for the termination of mobile processes. IFIP TCS 2008: 413-427 - 2007
- [c1]Romain Demangeon, Daniel Hirschkoff, Naoki Kobayashi
On the Complexity of Termination Inference for Processes. TGC 2007: 140-155
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 22:50 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: