default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEmmanuel Beffara
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i8]Emmanuel Beffara:
L'algorithme: pourquoi et comment le définir pour l'enseigner. CoRR abs/2406.04385 (2024)- 2023
- [c7]Emmanuel Beffara, Félix Castro, Mauricio Guillermo, Étienne Miquey:
Concurrent Realizability on Conjunctive Structures. FSCD 2023: 28:1-28:21 - 2021
- [i7]Emmanuel Beffara, Félix Castro, Mauricio Guillermo:
Concurrent Realizability on Conjunctive Structures. CoRR abs/2112.14606 (2021)
2010 – 2019
- 2018
- [j2]Emmanuel Beffara:
Order algebras: a quantitative model of interaction. Math. Struct. Comput. Sci. 28(7): 1126-1168 (2018) - 2015
- [i6]Emmanuel Beffara:
Unifying type systems for mobile processes. CoRR abs/1505.07794 (2015) - 2014
- [c6]Emmanuel Beffara:
A logical view on scheduling in concurrency. CL&C 2014: 78-92 - 2012
- [c5]Emmanuel Beffara, Virgile Mogbil:
Proofs as Executions. IFIP TCS 2012: 280-294 - 2011
- [i5]Emmanuel Beffara:
Functions as proofs as processes. CoRR abs/1107.4160 (2011)
2000 – 2009
- 2009
- [i4]Emmanuel Beffara:
Quantitative testing semantics for non-interleaving. CoRR abs/0906.3994 (2009) - [i3]Emmanuel Beffara, Olivier Bournez, Hassen Kacem, Claude Kirchner:
Verification of Timed Automata Using Rewrite Rules and Strategies. CoRR abs/0907.3123 (2009) - [i2]Emmanuel Beffara:
Linear combinations of orders. CoRR abs/0911.0630 (2009) - 2008
- [c4]Emmanuel Beffara:
An Algebraic Process Calculus. LICS 2008: 130-141 - 2006
- [j1]Emmanuel Beffara, François Maurel:
Concurrent nets: A study of prefixing in process calculi. Theor. Comput. Sci. 356(3): 356-373 (2006) - 2005
- [b1]Emmanuel Beffara:
Logique, Réalisabilité et Concurrence. (Logic, Realisability and Concurrency). Paris Diderot University, France, 2005 - [c3]Emmanuel Beffara:
A Concurrent Model for Linear Logic. MFPS 2005: 147-168 - 2004
- [c2]Emmanuel Beffara, François Maurel:
Concurrent Nets: A Study of Prefixing in Process Calculi. EXPRESS 2004: 67-86 - 2003
- [c1]Emmanuel Beffara, Vincent Danos:
Disjunctive normal forms and local exceptions. ICFP 2003: 203-211 - 2001
- [i1]Emmanuel Beffara, Olivier Bournez, Hassen Kacem, Claude Kirchner:
Verification of Timed Automata Using Rewrite Rules and Strategies. CoRR cs.PL/0109024 (2001)
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-07-15 01:02 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:
