default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRasmus Lerchedahl Petersen
Person information
- affiliation: Microsoft Research, Cambridge, UK
- affiliation (former): IT University of Copenhagen, Denmark
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j4]Rasmus L. Petersen, Matthew R. Lakin, Andrew Phillips:
A strand graph semantics for DNA-based computation. Theor. Comput. Sci. 632: 43-73 (2016)- 2015
- [j3]Peter W. O'Hearn, Rasmus Lerchedahl Petersen, Jules Villard
, Akbar Hussain:
On the relation between Concurrent Separation Logic and Concurrent Kleene Algebra. J. Log. Algebraic Methods Program. 84(3): 285-302 (2015) - [c9]Neil Dalchau, Niall Murphy, Rasmus L. Petersen, Boyan Yordanov:
Synthesizing and Tuning Chemical Reaction Networks with Specified Behaviours. DNA 2015: 16-33 - [i3]Neil Dalchau, Niall Murphy, Rasmus L. Petersen, Boyan Yordanov:
Synthesizing and tuning chemical reaction networks with specified behaviours. CoRR abs/1508.04403 (2015) - 2014
- [c8]Matthew R. Lakin, Rasmus L. Petersen, Kathryn E. Gray, Andrew Phillips:
Abstract Modelling of Tethered DNA Circuits. DNA 2014: 132-147 - 2013
- [c7]Radu Grigore, Dino Distefano, Rasmus Lerchedahl Petersen, Nikos Tzevelekos:
Runtime Verification Based on Register Automata. TACAS 2013: 260-276 - [c6]Nicolas Oury, Michael Pedersen, Rasmus L. Petersen:
Canonical Labelling of Site Graphs. CompMod 2013: 13-28 - 2012
- [c5]James Brotherston, Nikos Gorogiannis, Rasmus Lerchedahl Petersen:
A Generic Cyclic Theorem Prover. APLAS 2012: 350-367 - [i2]Dino Distefano, Radu Grigore, Rasmus Lerchedahl Petersen, Nikos Tzevelekos:
Runtime Verification Based on Register Automata. CoRR abs/1209.5325 (2012) - 2011
- [c4]James Brotherston, Dino Distefano, Rasmus Lerchedahl Petersen:
Automated Cyclic Entailment Proofs in Separation Logic. CADE 2011: 131-146 - [c3]C. A. R. Hoare, Akbar Hussain, Bernhard Möller, Peter W. O'Hearn, Rasmus Lerchedahl Petersen, Georg Struth:
On Locality and the Exchange Law for Concurrent Processes. CONCUR 2011: 250-264
2000 – 2009
- 2008
- [c2]Rasmus Lerchedahl Petersen, Lars Birkedal, Aleksandar Nanevski, Greg Morrisett:
A Realizability Model for Impredicative Hoare Type Theory. ESOP 2008: 337-352 - 2007
- [j2]Lars Birkedal, Rasmus Ejlers Møgelberg, Rasmus Lerchedahl Petersen:
Domain-theoretical models of parametric polymorphism. Theor. Comput. Sci. 388(1-3): 152-172 (2007) - 2006
- [j1]Lars Birkedal, Rasmus Ejlers Møgelberg, Rasmus Lerchedahl Petersen:
Linear Abadi and Plotkin Logic. Log. Methods Comput. Sci. 2(5) (2006) - [i1]Lars Birkedal, Rasmus Ejlers Møgelberg, Rasmus Lerchedahl Petersen:
Linear Abadi and Plotkin Logic. CoRR abs/cs/0611004 (2006) - 2005
- [c1]Lars Birkedal, Rasmus Ejlers Møgelberg, Rasmus Lerchedahl Petersen:
Parametric Domain-theoretic Models of Polymorphic Intuitionistic / Linear Lambda Calculus. MFPS 2005: 191-217
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:20 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:
