forked from pcminer-tools/pcminer
-
Notifications
You must be signed in to change notification settings - Fork 0
/
pacmpl5.html
29 lines (29 loc) · 457 KB
/
pacmpl5.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
<!DOCTYPE html>
<html lang="en">
<head><meta charset="UTF-8" /><title>dblp: Proceedings of the ACM on Programming Languages, Volume 5</title><link rel="home" href="https://dblp.org" /><link rel="search" type="application/opensearchdescription+xml" href="https://dblp.org/xml/osd.xml" title="dblp search" /><link rel="apple-touch-icon" type="image/png" sizes="192x192" href="https://dblp.org/img/dblp.icon.192x192.png"><link rel="icon" type="image/png" sizes="192x192" href="https://dblp.org/img/dblp.icon.192x192.png"><link rel="icon" type="image/png" sizes="152x152" href="https://dblp.org/img/dblp.icon.152x152.png"><link rel="icon" type="image/png" sizes="120x120" href="https://dblp.org/img/dblp.icon.120x120.png"><link id="favicon" rel="shortcut icon" type="image/x-icon" sizes="16x16 24x24 32x32 64x64" href="https://dblp.org/img/favicon.ico" /><link rel="stylesheet" type="text/css" href="https://dblp.org/css/dblp-2020-12-11.css" /><link href="https://dblp.org/css/open-sans.css" rel="stylesheet" type="text/css" /><link rel="canonical" href="https://dblp.org/db/journals/pacmpl/pacmpl5"/><meta name="description" content="Bibliographic content of Proceedings of the ACM on Programming Languages, Volume 5" /><meta name="keywords" content="Proceedings of the ACM on Programming Languages, Volume 5, dblp, computer science, bibliography, author, editor, publication, conference, journal, book, thesis, collection, open data, bibtex" /><script type="application/ld+json">{"@context": "http://schema.org","@type": "WebSite","url": "https://dblp.org","sameAs": ["https://dblp.uni-trier.de","https://dblp.dagstuhl.de","https://www.wikidata.org/entity/Q1224715","https://en.wikipedia.org/wiki/DBLP","https://twitter.com/dblp_org","https://facebook.com/dblp.org"],"name": "dblp computer science bibliography","alternateName": "DBLP","description": "The dblp computer science bibliography is the online reference for open bibliographic information on major computer science journals and proceedings.","image": "https://dblp.org/img/logo.320x120.png","thumbnailUrl": "https://dblp.org/img/dblp.icon.192x192.png","creator": {"@context": "http://schema.org","@type": "Organization","name": "Schloss Dagstuhl - Leibniz Center for Informatics","url": "https://www.dagstuhl.de","logo": "https://www.dagstuhl.de/fileadmin/assets/images/lzi_logo.gif","contactPoint": {"@context": "http://schema.org","@type": "ContactPoint","contactType": "customer support","url": "https://dblp.org/db/about/team","email": "dblp@dagstuhl.de"},"sameAs": ["https://www.wikidata.org/entity/Q879857","https://en.wikipedia.org/wiki/Dagstuhl"]},"dateCreated": "1993","datePublished": "1993","dateModified": "2021-08-12","locationCreated": "Trier, Germany","funder": [{"@context": "http://schema.org","@type": "Organization","name": "Leibniz Association","url": "https://www.leibniz-gemeinschaft.de/","logo": "https://www.leibniz-gemeinschaft.de/fileadmin/portal/logo-black.svg","sameAs": ["https://www.wikidata.org/entity/Q680090","https://en.wikipedia.org/wiki/Leibniz_Association"]},{"@context": "http://schema.org","@type": "Organization","name": "Federal Ministry of Education and Research of Germany","url": "https://www.bmbf.de/","logo": "https://www.bmbf.de/site/img/logo.png","sameAs": ["https://www.wikidata.org/entity/Q492234","https://en.wikipedia.org/wiki/Federal_Ministry_of_Education_and_Research_(Germany)"]},{"@context": "http://schema.org","@type": "Organization","name": "Saarland State Chancellery","url": "https://www.saarland.de/stk/DE/home/home_node.html","logo": "https://www.saarland.de/bilder/res_stk/stk.png","sameAs": ["https://www.wikidata.org/entity/Q15848758","https://de.wikipedia.org/wiki/Saarl%C3%A4ndische_Staatskanzlei"]},{"@context": "http://schema.org","@type": "Organization","name": "Ministry of Science, Education and Culture of the State of Rhineland-Palatinate","url": "https://mwwk.rlp.de/de/startseite//","logo": "https://mwwk.rlp.de/fileadmin/_logos/rlp-logos-MWWK.png","sameAs": ["https://www.wikidata.org/entity/Q15835282","https://de.wikipedia.org/wiki/Ministerium_f%C3%BCr_Wissenschaft,_Weiterbildung_und_Kultur"]}],"genre": "computer science","inLanguage": "en-US","license": "https://creativecommons.org/publicdomain/zero/1.0/","isAccessibleForFree": "true","potentialAction": [{"@type": "SearchAction","target": "https://dblp.org/search?q={search_term_string}","query-input": "required name=search_term_string"}]}</script><script type="application/ld+json">{"@context": "http://schema.org","@type": "Dataset","url": "https://dblp.org/xml/release","sameAs": ["https://dblp.uni-trier.de/xml/release","https://dblp.dagstuhl.de/xml/release"],"name": "dblp XML data dump","description": "The raw dblp metadata in XML files as stable, persistent releases.","keywords": "dblp, XML, computer science, scholarly publications, metadata","temporalCoverage": "1936/..","thumbnailUrl": "https://dblp.org/img/dblp.icon.192x192.png","creator": {"@context": "http://schema.org","@type": "Organization","name": "Schloss Dagstuhl - Leibniz Center for Informatics","url": "https://www.dagstuhl.de","logo": "https://www.dagstuhl.de/fileadmin/assets/images/lzi_logo.gif","contactPoint": {"@context": "http://schema.org","@type": "ContactPoint","contactType": "customer support","url": "https://dblp.org/db/about/team","email": "dblp@dagstuhl.de"},"sameAs": ["https://www.wikidata.org/entity/Q879857","https://en.wikipedia.org/wiki/Dagstuhl"]},"dateCreated": "1993","datePublished": "1993","dateModified": "2021-08-12","locationCreated": "Trier, Germany","funder": [{"@context": "http://schema.org","@type": "Organization","name": "Leibniz Association","url": "https://www.leibniz-gemeinschaft.de/","logo": "https://www.leibniz-gemeinschaft.de/fileadmin/portal/logo-black.svg","sameAs": ["https://www.wikidata.org/entity/Q680090","https://en.wikipedia.org/wiki/Leibniz_Association"]},{"@context": "http://schema.org","@type": "Organization","name": "Federal Ministry of Education and Research of Germany","url": "https://www.bmbf.de/","logo": "https://www.bmbf.de/site/img/logo.png","sameAs": ["https://www.wikidata.org/entity/Q492234","https://en.wikipedia.org/wiki/Federal_Ministry_of_Education_and_Research_(Germany)"]},{"@context": "http://schema.org","@type": "Organization","name": "Saarland State Chancellery","url": "https://www.saarland.de/staatskanzlei.htm","logo": "https://www.saarland.de/bilder/res_stk/stk.png","sameAs": ["https://www.wikidata.org/entity/Q15848758","https://de.wikipedia.org/wiki/Saarl%C3%A4ndische_Staatskanzlei"]},{"@context": "http://schema.org","@type": "Organization","name": "Ministry of Science, Education and Culture of the State of Rhineland-Palatinate","url": "https://mwwk.rlp.de/de/startseite//","logo": "https://mwwk.rlp.de/fileadmin/_logos/rlp-logos-MWWK.png","sameAs": ["https://www.wikidata.org/entity/Q15835282","https://de.wikipedia.org/wiki/Ministerium_f%C3%BCr_Wissenschaft,_Weiterbildung_und_Kultur"]}],"genre": "computer science","inLanguage": "en-US","license": "https://creativecommons.org/publicdomain/zero/1.0/","isAccessibleForFree": "true","distribution": [{"@type": "DataDownload","encodingFormat": "application/gzip","contentUrl": "https://dblp.org/xml/release/"}]}</script></head>
<body class="no-js bhx-page db-page" data-dblp-path="ht/db/journals/pacmpl/pacmpl5.bht">
<script>var el = document.getElementsByTagName("body")[0];el.classList.remove('no-js');el.classList.add('js');</script>
<script src="https://dblp.org/js/jquery-3.1.1.min.js"></script>
<script src="https://dblp.org/js/jquery.dblp-2014-08-07.min.js"></script>
<script src="https://dblp.org/js/jquery.cookie-1.4.1.min.js"></script>
<script src="https://dblp.org/js/jquery.mark-9.0.0-edited.min.js"></script>
<script src="https://dblp.org/js/encoder-2012-09-23.min.js"></script>
<script src="https://dblp.org/js/buckets-1.0.min.js"></script>
<!-- banner --><div id="banner"><!-- div class="message modest" data-version="2016-02-19">We would like to express our heartfelt thanks to the many users who have sent us their remarks and constructive critizisms during the past weeks. Your detailed comments have been very informative and extremely helpful. Of course, you may keep <a href="http://dblp.org/db/about/team.html">contacting us to send us your feedback.</a></div -->
<!-- div class="message fancy" data-version="2021-08-02">Due to a <b>planned maintenance</b>, this server will become temporarily unavailable <b>on August 3rd, 2021</b>. In the mean time, please use server <a href="https://dblp.uni-trier.de">Trier 1</a> instead.</div -->
<div class="message fancy" data-version="2021-08-06"><b>We are hiring!</b> We are looking for three additional members to join the dblp team. <a href="https://www.dagstuhl.de/en/about-dagstuhl/organization/job-offers/">(more information)</a></div>
</div><div id="main">
<!-- logo --><div id="logo"><img class="logo" usemap="#logo-map" src="https://dblp.org/img/logo.320x120.png" /><map name="logo-map"><area href="https://dblp.org" shape="poly" coords="5,0,14,92,103,118,111,95,319,90,316,61,192,63,190,26,99,26" alt="dblp computer science bibliography" title="dblp computer science bibliography" ></map></div>
<!-- search form --><div id="search"><img src="https://dblp.org/img/search.dark.16x16.png" class="icon no-js-only" title="search dblp" alt="search dblp"/><div id="search-mode-selector" class="drop-down js-only" style="vertical-align:-6px; margin-right:1px;"><div class="head"><img src="https://dblp.org/img/search.dark.16x16.png" class="icon" alt="search dblp"/></div><div class="body"><p><b>default search action</b></p><ul><li><input id="search-mode-combined" type="radio" name="search-mode" value="c" checked="checked" /><label for="search-mode-combined">combined dblp search</label></li><li><input id="search-mode-author" type="radio" name="search-mode" value="a" /><label for="search-mode-author">author search</label></li><li><input id="search-mode-venue" type="radio" name="search-mode" value="v" /><label for="search-mode-venue">venue search</label></li><li><input id="search-mode-publ" type="radio" name="search-mode" value="p" /><label for="search-mode-publ">publication search</label></li></ul></div></div><form method="get" action="https://dblp.org/search"><input type="search" name="q" maxlength="127" placeholder="search dblp" /><div class="results js-only"><div class="authors"><b>Authors:</b><ul class="matches"><li><i>no matches</i></li></ul><ul class="waiting"><li><img src="https://dblp.org/img/waiting.anim.gif" alt="waiting..." /></li></ul></div><div class="venues"><b>Venues:</b><ul class="matches"><li><i>no matches</i></li></ul><ul class="waiting"><li><img src="https://dblp.org/img/waiting.anim.gif" alt="waiting..." /></li></ul></div><div class="publs"><b>Publications:</b><ul class="matches"><li><i>no matches</i></li></ul><ul class="waiting"><li><img src="https://dblp.org/img/waiting.anim.gif" alt="waiting..." /></li></ul></div></div><img class="clear js-only" src="https://dblp.org/img/clear-mark.medium.16x16.png" alt="clear" title="clear" /></form><div id="search-external" class="drop-down js-only"><div class="head"><a href="https://google.com/search?q="><img src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" alt="ask others" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q="><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q="><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q="><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q="><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q="><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li><li><a href="https://orcid.org/orcid-search/search?searchQuery="><img alt="" src="https://dblp.org/img/orcid.dark.16x16.png" class="icon" />ORCID</a></li></ul></div>
</div>
</div>
<!-- head line --><header id="headline" class="headline noline" data-bhtkey="db/journals/pacmpl/pacmpl5"><h1>Proceedings of the ACM on Programming Languages, Volume 5</h1> <nav class="head"><ul><li class="export drop-down"><div class="head"><a href="https://dblp.org/search/publ/api?q=toc%3Adb/journals/pacmpl/pacmpl5.bht%3A&h=1000&format=xml"><img alt="" src="https://dblp.org/img/download.light.16x16.png" class="icon" /></a></div><div class="body"><p><b>export records of this page</b></p><p><em>first 1000 hits only:</em></p><ul><li><a href="https://dblp.org/search/publ/api?q=toc%3Adb/journals/pacmpl/pacmpl5.bht%3A&h=1000&format=xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li><li><a href="https://dblp.org/search/publ/api?q=toc%3Adb/journals/pacmpl/pacmpl5.bht%3A&h=1000&format=json"><img alt="" src="https://dblp.org/img/json.dark.16x16.png" class="icon" />JSON</a></li><li><a href="https://dblp.org/search/publ/api?q=toc%3Adb/journals/pacmpl/pacmpl5.bht%3A&h=1000&format=jsonp"><img alt="" src="https://dblp.org/img/json.dark.16x16.png" class="icon" />JSONP</a></li><li><a href="https://dblp.org/search/publ/bibtex/?q=toc%3Adb/journals/pacmpl/pacmpl5.bht%3A"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li></ul><p><em>see FAQ:</em></p><ul><li><a href="https://dblp.org/faq/13501473"><img alt="" src="https://dblp.org/img/faq-mark.dark.16x16.png" class="icon" />How to use the dblp search API?</a></li></ul><p><em>BHT key:</em></p><ul class="bullets"><li class="select-on-click"><small>db/journals/pacmpl/pacmpl5.bht</small></li></ul></div></li><li class="search drop-down"><div class="head"><a href="https://google.com/search?q=Proceedings+of+the+ACM+on+Programming+Languages%2C+Volume+5"><img alt="" src="https://dblp.org/img/search-external.light.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Proceedings+of+the+ACM+on+Programming+Languages%2C+Volume+5"><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Proceedings+of+the+ACM+on+Programming+Languages%2C+Volume+5"><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Proceedings+of+the+ACM+on+Programming+Languages%2C+Volume+5"><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Proceedings+of+the+ACM+on+Programming+Languages%2C+Volume+5"><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Proceedings+of+the+ACM+on+Programming+Languages%2C+Volume+5"><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul><p><em>view this toc in</em></p><ul><li><a href="https://dblp.org/search?q=toc:db%2Fjournals%2Fpacmpl%2Fpacmpl5.bht:"><img alt="" src="https://dblp.org/img/dblp.dark.16x16.png" class="icon" />dblp search</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/db/about/team.html"><img alt="" src="https://dblp.org/img/talk.light.16x16.png" class="icon" /></a></div><div class="body"><p><b>help us</b></p><ul><li><a href="https://dblp.org/faq/1474623"><img alt="" src="https://dblp.org/img/faq-mark.dark.16x16.png" class="icon" />How can I correct errors in dblp?</a></li><li><a href="https://dblp.org/db/about/team.html"><img alt="" src="https://dblp.org/img/mail.dark.16x16.png" class="icon" />contact dblp</a></li></ul></div></li></ul></nav></header>
<!-- inpage navigation menu --><nav class="side"><ul><li><a href="#" title="jump to top"><img alt="top" src="https://dblp.org/img/top.dark.16x16.png" class="icon" /></a></li><li><a href="#footer" title="jump to bottom"><img alt="bottom" src="https://dblp.org/img/bottom.dark.16x16.png" class="icon" /></a></li></ul></nav>
<!-- mirror selector --><nav id="mirror-selector" class="selector-box"><img src="https://dblp.org/img/datastock.dark.16x16.png" alt="mirror" title="use mirror server" /><div class="drop-down selector"><div class="head">Dagstuhl</div><div class="body"><ul class="options"><li><a href="https://dblp.uni-trier.de/db/journals/pacmpl/pacmpl5.html">Trier 1</a></li><li><a href="https://dblp2.uni-trier.de/db/journals/pacmpl/pacmpl5.html">Trier 2</a></li></ul></div></div></nav>
<!-- breadcrumbs --><div id="breadcrumbs" class="section"><ul><li itemscope itemtype="http://schema.org/BreadcrumbList"><span itemprop="itemListElement" itemscope itemtype="http://schema.org/ListItem">> <a itemprop="item" href="https://dblp.org"><span itemprop="name">Home</span></a><meta itemprop="position" content="1" /></span> <span itemprop="itemListElement" itemscope itemtype="http://schema.org/ListItem">> <a itemprop="item" href="https://dblp.org/db/journals"><span itemprop="name">Journals</span></a><meta itemprop="position" content="2" /></span> <span itemprop="itemListElement" itemscope itemtype="http://schema.org/ListItem">> <a itemprop="item" href="https://dblp.org/db/journals/pacmpl/index.html"><span itemprop="name">Proceedings of the ACM on Programming Languages</span></a><meta itemprop="position" content="3" /></span> </li></ul></div>
<div class="clear-both"></div>
<header><h2 id="nrPOPL">Volume 5, Number POPL, January 2021</h2></header><ul class="publ-list"><li class="entry article" id="journals/pacmpl/KuperbergPP21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434282"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434282" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/KuperbergPP21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/KuperbergPP21&rft.au=Denis+Kuperberg&rft.atitle=Cyclic+proofs%2C+system+t%2C+and+the+power+of+contraction.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-28&rft_id=info%3Adoi%2F10.1145%2F3434282&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/KuperbergPP21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/KuperbergPP21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/KuperbergPP21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/KuperbergPP21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/KuperbergPP21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/KuperbergPP21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/KuperbergPP21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Cyclic+proofs%2C+system+t%2C+and+the+power+of+contraction."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Cyclic+proofs%2C+system+t%2C+and+the+power+of+contraction."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Cyclic+proofs%2C+system+t%2C+and+the+power+of+contraction."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Cyclic+proofs%2C+system+t%2C+and+the+power+of+contraction."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Cyclic+proofs%2C+system+t%2C+and+the+power+of+contraction."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Cyclic+proofs%2C+system+t%2C+and+the+power+of+contraction."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434282&text=%22Cyclic+proofs%2C+system+t%2C+and+the+power+of+contraction.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434282&text=%22Cyclic+proofs%2C+system+t%2C+and+the+power+of+contraction.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434282&title=%22Cyclic+proofs%2C+system+t%2C+and+the+power+of+contraction.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434282&title=%22Cyclic+proofs%2C+system+t%2C+and+the+power+of+contraction.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434282"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434282&title=%22Cyclic+proofs%2C+system+t%2C+and+the+power+of+contraction.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434282"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/KuperbergPP21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/21/8279.html" itemprop="url"><span itemprop="name" title="Denis Kuperberg">Denis Kuperberg</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/234/8043.html" itemprop="url"><span itemprop="name" title="Laureline Pinault">Laureline Pinault</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/47/1298.html" itemprop="url"><span itemprop="name" title="Damien Pous">Damien Pous</span></a></span>:<br /> <span class="title" itemprop="name">Cyclic proofs, system t, and the power of contraction.</span> <span itemprop="pagination">1-28</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/BahrGM21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434283"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434283" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/BahrGM21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/BahrGM21&rft.au=Patrick+Bahr&rft.atitle=Diamonds+are+not+forever%3A+liveness+in+reactive+programming+with+guarded+recursion.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-28&rft_id=info%3Adoi%2F10.1145%2F3434283&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/BahrGM21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/BahrGM21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/BahrGM21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/BahrGM21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/BahrGM21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/BahrGM21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/BahrGM21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Diamonds+are+not+forever%3A+liveness+in+reactive+programming+with+guarded+recursion."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Diamonds+are+not+forever%3A+liveness+in+reactive+programming+with+guarded+recursion."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Diamonds+are+not+forever%3A+liveness+in+reactive+programming+with+guarded+recursion."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Diamonds+are+not+forever%3A+liveness+in+reactive+programming+with+guarded+recursion."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Diamonds+are+not+forever%3A+liveness+in+reactive+programming+with+guarded+recursion."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Diamonds+are+not+forever%3A+liveness+in+reactive+programming+with+guarded+recursion."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434283&text=%22Diamonds+are+not+forever%3A+liveness+in+reactive+programming+with+guarded+recursion.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434283&text=%22Diamonds+are+not+forever%3A+liveness+in+reactive+programming+with+guarded+recursion.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434283&title=%22Diamonds+are+not+forever%3A+liveness+in+reactive+programming+with+guarded+recursion.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434283&title=%22Diamonds+are+not+forever%3A+liveness+in+reactive+programming+with+guarded+recursion.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434283"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434283&title=%22Diamonds+are+not+forever%3A+liveness+in+reactive+programming+with+guarded+recursion.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434283"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/BahrGM21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/67/8292.html" itemprop="url"><span itemprop="name" title="Patrick Bahr">Patrick Bahr</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/237/9909.html" itemprop="url"><span itemprop="name" title="Christian Uldal Graulund">Christian Uldal Graulund</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/64/6368.html" itemprop="url"><span itemprop="name" title="Rasmus Ejlers Møgelberg">Rasmus Ejlers Møgelberg</span></a></span>:<br /> <span class="title" itemprop="name">Diamonds are not forever: liveness in reactive programming with guarded recursion.</span> <span itemprop="pagination">1-28</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/ShermanMC21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434284"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434284" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/ShermanMC21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/ShermanMC21&rft.au=Benjamin+Sherman&rft.atitle=%F0%9D%9C%86%E2%82%9B%3A+computable+semantics+for+differentiable+programming+with+higher-order+functions+and+datatypes.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-31&rft_id=info%3Adoi%2F10.1145%2F3434284&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/ShermanMC21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/ShermanMC21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/ShermanMC21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/ShermanMC21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/ShermanMC21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/ShermanMC21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/ShermanMC21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=%F0%9D%9C%86%E2%82%9B%3A+computable+semantics+for+differentiable+programming+with+higher-order+functions+and+datatypes."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=%F0%9D%9C%86%E2%82%9B%3A+computable+semantics+for+differentiable+programming+with+higher-order+functions+and+datatypes."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=%F0%9D%9C%86%E2%82%9B%3A+computable+semantics+for+differentiable+programming+with+higher-order+functions+and+datatypes."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=%F0%9D%9C%86%E2%82%9B%3A+computable+semantics+for+differentiable+programming+with+higher-order+functions+and+datatypes."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=%F0%9D%9C%86%E2%82%9B%3A+computable+semantics+for+differentiable+programming+with+higher-order+functions+and+datatypes."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=%F0%9D%9C%86%E2%82%9B%3A+computable+semantics+for+differentiable+programming+with+higher-order+functions+and+datatypes."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434284&text=%22%F0%9D%9C%86%E2%82%9B%3A+computable+semantics+for+differentiable+programming+with+higher-order+functions+and+...%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434284&text=%22%F0%9D%9C%86%E2%82%9B%3A+computable+semantics+for+differentiable+programming+with+higher-order+functions+and+...%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434284&title=%22%F0%9D%9C%86%E2%82%9B%3A+computable+semantics+for+differentiable+programming+with+higher-order+functions+and+datatypes.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434284&title=%22%F0%9D%9C%86%E2%82%9B%3A+computable+semantics+for+differentiable+programming+with+higher-order+functions+and+datatypes.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434284"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434284&title=%22%F0%9D%9C%86%E2%82%9B%3A+computable+semantics+for+differentiable+programming+with+higher-order+functions+and+datatypes.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434284"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/ShermanMC21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/205/7232.html" itemprop="url"><span itemprop="name" title="Benjamin Sherman">Benjamin Sherman</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/225/4542.html" itemprop="url"><span itemprop="name" title="Jesse Michel">Jesse Michel</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/07/3119.html" itemprop="url"><span itemprop="name" title="Michael Carbin">Michael Carbin</span></a></span>:<br /> <span class="title" itemprop="name">𝜆ₛ: computable semantics for differentiable programming with higher-order functions and datatypes.</span> <span itemprop="pagination">1-31</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/MargalitL21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434285"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434285" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/MargalitL21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/MargalitL21&rft.au=Roy+Margalit&rft.atitle=Verifying+observational+robustness+against+a+c11-style+memory+model.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-33&rft_id=info%3Adoi%2F10.1145%2F3434285&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/MargalitL21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/MargalitL21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/MargalitL21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/MargalitL21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/MargalitL21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/MargalitL21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/MargalitL21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Verifying+observational+robustness+against+a+c11-style+memory+model."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Verifying+observational+robustness+against+a+c11-style+memory+model."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Verifying+observational+robustness+against+a+c11-style+memory+model."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Verifying+observational+robustness+against+a+c11-style+memory+model."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Verifying+observational+robustness+against+a+c11-style+memory+model."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Verifying+observational+robustness+against+a+c11-style+memory+model."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434285&text=%22Verifying+observational+robustness+against+a+c11-style+memory+model.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434285&text=%22Verifying+observational+robustness+against+a+c11-style+memory+model.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434285&title=%22Verifying+observational+robustness+against+a+c11-style+memory+model.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434285&title=%22Verifying+observational+robustness+against+a+c11-style+memory+model.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434285"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434285&title=%22Verifying+observational+robustness+against+a+c11-style+memory+model.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434285"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/MargalitL21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/242/4536.html" itemprop="url"><span itemprop="name" title="Roy Margalit">Roy Margalit</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/84/7458.html" itemprop="url"><span itemprop="name" title="Ori Lahav">Ori Lahav</span></a></span>:<br /> <span class="title" itemprop="name">Verifying observational robustness against a c11-style memory model.</span> <span itemprop="pagination">1-33</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/FarkaN0DF21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434286"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434286" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/FarkaN0DF21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/FarkaN0DF21&rft.au=Frantisek+Farka&rft.atitle=On+algebraic+abstractions+for+concurrent+separation+logics.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-32&rft_id=info%3Adoi%2F10.1145%2F3434286&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/FarkaN0DF21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/FarkaN0DF21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/FarkaN0DF21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/FarkaN0DF21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/FarkaN0DF21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/FarkaN0DF21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/FarkaN0DF21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=On+algebraic+abstractions+for+concurrent+separation+logics."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=On+algebraic+abstractions+for+concurrent+separation+logics."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=On+algebraic+abstractions+for+concurrent+separation+logics."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=On+algebraic+abstractions+for+concurrent+separation+logics."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=On+algebraic+abstractions+for+concurrent+separation+logics."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=On+algebraic+abstractions+for+concurrent+separation+logics."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434286&text=%22On+algebraic+abstractions+for+concurrent+separation+logics.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434286&text=%22On+algebraic+abstractions+for+concurrent+separation+logics.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434286&title=%22On+algebraic+abstractions+for+concurrent+separation+logics.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434286&title=%22On+algebraic+abstractions+for+concurrent+separation+logics.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434286"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434286&title=%22On+algebraic+abstractions+for+concurrent+separation+logics.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434286"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/FarkaN0DF21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/185/0984.html" itemprop="url"><span itemprop="name" title="Frantisek Farka">Frantisek Farka</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/70/3373.html" itemprop="url"><span itemprop="name" title="Aleksandar Nanevski">Aleksandar Nanevski</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/65/1920.html" itemprop="url"><span itemprop="name" title="Anindya Banerjee 0001">Anindya Banerjee</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/130/4256.html" itemprop="url"><span itemprop="name" title="Germán Andrés Delbianco">Germán Andrés Delbianco</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/58/2507.html" itemprop="url"><span itemprop="name" title="Ignacio Fábregas">Ignacio Fábregas</span></a></span>:<br /> <span class="title" itemprop="name">On algebraic abstractions for concurrent separation logics.</span> <span itemprop="pagination">1-32</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/GeorgesGSTTHDB21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434287"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434287" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/GeorgesGSTTHDB21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/GeorgesGSTTHDB21&rft.au=A%C3%AFna+Linn+Georges&rft.atitle=Efficient+and+provable+local+capability+revocation+using+uninitialized+capabilities.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-30&rft_id=info%3Adoi%2F10.1145%2F3434287&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/GeorgesGSTTHDB21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/GeorgesGSTTHDB21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/GeorgesGSTTHDB21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/GeorgesGSTTHDB21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/GeorgesGSTTHDB21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/GeorgesGSTTHDB21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/GeorgesGSTTHDB21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Efficient+and+provable+local+capability+revocation+using+uninitialized+capabilities."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Efficient+and+provable+local+capability+revocation+using+uninitialized+capabilities."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Efficient+and+provable+local+capability+revocation+using+uninitialized+capabilities."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Efficient+and+provable+local+capability+revocation+using+uninitialized+capabilities."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Efficient+and+provable+local+capability+revocation+using+uninitialized+capabilities."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Efficient+and+provable+local+capability+revocation+using+uninitialized+capabilities."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434287&text=%22Efficient+and+provable+local+capability+revocation+using+uninitialized+capabilities.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434287&text=%22Efficient+and+provable+local+capability+revocation+using+uninitialized+capabilities.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434287&title=%22Efficient+and+provable+local+capability+revocation+using+uninitialized+capabilities.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434287&title=%22Efficient+and+provable+local+capability+revocation+using+uninitialized+capabilities.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434287"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434287&title=%22Efficient+and+provable+local+capability+revocation+using+uninitialized+capabilities.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434287"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/GeorgesGSTTHDB21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/192/1954.html" itemprop="url"><span itemprop="name" title="Aïna Linn Georges">Aïna Linn Georges</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/137/8030.html" itemprop="url"><span itemprop="name" title="Armaël Guéneau">Armaël Guéneau</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/251/2059.html" itemprop="url"><span itemprop="name" title="Thomas Van Strydonck">Thomas Van Strydonck</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/163/1794.html" itemprop="url"><span itemprop="name" title="Amin Timany">Amin Timany</span></a><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0002-2237-851X" /></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/174/4816.html" itemprop="url"><span itemprop="name" title="Alix Trieu">Alix Trieu</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/266/7851.html" itemprop="url"><span itemprop="name" title="Sander Huyghebaert">Sander Huyghebaert</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/74/8301.html" itemprop="url"><span itemprop="name" title="Dominique Devriese">Dominique Devriese</span></a><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0002-3862-6856" /></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/31/910.html" itemprop="url"><span itemprop="name" title="Lars Birkedal">Lars Birkedal</span></a></span>:<br /> <span class="title" itemprop="name">Efficient and provable local capability revocation using uninitialized capabilities.</span> <span itemprop="pagination">1-30</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/JacobsTD21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434288"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434288" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/JacobsTD21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/JacobsTD21&rft.au=Koen+Jacobs&rft.atitle=Fully+abstract+from+static+to+gradual.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-30&rft_id=info%3Adoi%2F10.1145%2F3434288&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/JacobsTD21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/JacobsTD21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/JacobsTD21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/JacobsTD21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/JacobsTD21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/JacobsTD21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/JacobsTD21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Fully+abstract+from+static+to+gradual."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Fully+abstract+from+static+to+gradual."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Fully+abstract+from+static+to+gradual."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Fully+abstract+from+static+to+gradual."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Fully+abstract+from+static+to+gradual."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Fully+abstract+from+static+to+gradual."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434288&text=%22Fully+abstract+from+static+to+gradual.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434288&text=%22Fully+abstract+from+static+to+gradual.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434288&title=%22Fully+abstract+from+static+to+gradual.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434288&title=%22Fully+abstract+from+static+to+gradual.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434288"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434288&title=%22Fully+abstract+from+static+to+gradual.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434288"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/JacobsTD21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/123/3172.html" itemprop="url"><span itemprop="name" title="Koen Jacobs">Koen Jacobs</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/163/1794.html" itemprop="url"><span itemprop="name" title="Amin Timany">Amin Timany</span></a><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0002-2237-851X" /></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/74/8301.html" itemprop="url"><span itemprop="name" title="Dominique Devriese">Dominique Devriese</span></a><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0002-3862-6856" /></span>:<br /> <span class="title" itemprop="name">Fully abstract from static to gradual.</span> <span itemprop="pagination">1-30</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/BartheCKS021" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434289"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434289" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/BartheCKS021.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/BartheCKS021&rft.au=Gilles+Barthe&rft.atitle=Deciding+accuracy+of+differential+privacy+schemes.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-30&rft_id=info%3Adoi%2F10.1145%2F3434289&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/BartheCKS021.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/BartheCKS021.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/BartheCKS021.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/BartheCKS021.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/BartheCKS021.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/BartheCKS021.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/BartheCKS021</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Deciding+accuracy+of+differential+privacy+schemes."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Deciding+accuracy+of+differential+privacy+schemes."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Deciding+accuracy+of+differential+privacy+schemes."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Deciding+accuracy+of+differential+privacy+schemes."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Deciding+accuracy+of+differential+privacy+schemes."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Deciding+accuracy+of+differential+privacy+schemes."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434289&text=%22Deciding+accuracy+of+differential+privacy+schemes.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434289&text=%22Deciding+accuracy+of+differential+privacy+schemes.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434289&title=%22Deciding+accuracy+of+differential+privacy+schemes.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434289&title=%22Deciding+accuracy+of+differential+privacy+schemes.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434289"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434289&title=%22Deciding+accuracy+of+differential+privacy+schemes.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434289"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/BartheCKS021</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/b/GBarthe.html" itemprop="url"><span itemprop="name" title="Gilles Barthe">Gilles Barthe</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/c/RohitChadha.html" itemprop="url"><span itemprop="name" title="Rohit Chadha">Rohit Chadha</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/244/2375.html" itemprop="url"><span itemprop="name" title="Paul Krogmeier">Paul Krogmeier</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/s/APrasadSistla.html" itemprop="url"><span itemprop="name" title="A. Prasad Sistla">A. Prasad Sistla</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/23/2759-1.html" itemprop="url"><span itemprop="name" title="Mahesh Viswanathan 0001">Mahesh Viswanathan</span></a></span>:<br /> <span class="title" itemprop="name">Deciding accuracy of differential privacy schemes.</span> <span itemprop="pagination">1-30</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/ChenS21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434290"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434290" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/ChenS21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/ChenS21&rft.au=Chao-Hong+Chen&rft.atitle=A+computational+interpretation+of+compact+closed+categories%3A+reversible+programming+with+negative+and+fractional+types.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-29&rft_id=info%3Adoi%2F10.1145%2F3434290&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/ChenS21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/ChenS21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/ChenS21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/ChenS21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/ChenS21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/ChenS21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/ChenS21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=A+computational+interpretation+of+compact+closed+categories%3A+reversible+programming+with+negative+and+fractional+types."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=A+computational+interpretation+of+compact+closed+categories%3A+reversible+programming+with+negative+and+fractional+types."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=A+computational+interpretation+of+compact+closed+categories%3A+reversible+programming+with+negative+and+fractional+types."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=A+computational+interpretation+of+compact+closed+categories%3A+reversible+programming+with+negative+and+fractional+types."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=A+computational+interpretation+of+compact+closed+categories%3A+reversible+programming+with+negative+and+fractional+types."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=A+computational+interpretation+of+compact+closed+categories%3A+reversible+programming+with+negative+and+fractional+types."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434290&text=%22A+computational+interpretation+of+compact+closed+categories%3A+reversible+programming+with+negative+and+...%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434290&text=%22A+computational+interpretation+of+compact+closed+categories%3A+reversible+programming+with+negative+and+...%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434290&title=%22A+computational+interpretation+of+compact+closed+categories%3A+reversible+programming+with+negative+and+fractional+types.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434290&title=%22A+computational+interpretation+of+compact+closed+categories%3A+reversible+programming+with+negative+and+fractional+types.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434290"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434290&title=%22A+computational+interpretation+of+compact+closed+categories%3A+reversible+programming+with+negative+and+fractional+types.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434290"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/ChenS21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/98/231.html" itemprop="url"><span itemprop="name" title="Chao-Hong Chen">Chao-Hong Chen</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/65/6934.html" itemprop="url"><span itemprop="name" title="Amr Sabry">Amr Sabry</span></a></span>:<br /> <span class="title" itemprop="name">A computational interpretation of compact closed categories: reversible programming with negative and fractional types.</span> <span itemprop="pagination">1-29</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/GregersenBTB21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434291"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434291" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/GregersenBTB21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/GregersenBTB21&rft.au=Simon+Oddershede+Gregersen&rft.atitle=Mechanized+logical+relations+for+termination-insensitive+noninterference.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-29&rft_id=info%3Adoi%2F10.1145%2F3434291&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/GregersenBTB21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/GregersenBTB21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/GregersenBTB21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/GregersenBTB21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/GregersenBTB21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/GregersenBTB21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/GregersenBTB21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Mechanized+logical+relations+for+termination-insensitive+noninterference."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Mechanized+logical+relations+for+termination-insensitive+noninterference."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Mechanized+logical+relations+for+termination-insensitive+noninterference."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Mechanized+logical+relations+for+termination-insensitive+noninterference."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Mechanized+logical+relations+for+termination-insensitive+noninterference."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Mechanized+logical+relations+for+termination-insensitive+noninterference."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434291&text=%22Mechanized+logical+relations+for+termination-insensitive+noninterference.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434291&text=%22Mechanized+logical+relations+for+termination-insensitive+noninterference.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434291&title=%22Mechanized+logical+relations+for+termination-insensitive+noninterference.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434291&title=%22Mechanized+logical+relations+for+termination-insensitive+noninterference.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434291"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434291&title=%22Mechanized+logical+relations+for+termination-insensitive+noninterference.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434291"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/GregersenBTB21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/263/1059.html" itemprop="url"><span itemprop="name" title="Simon Oddershede Gregersen">Simon Oddershede Gregersen</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/264/4856.html" itemprop="url"><span itemprop="name" title="Johan Bay">Johan Bay</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/163/1794.html" itemprop="url"><span itemprop="name" title="Amin Timany">Amin Timany</span></a><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0002-2237-851X" /></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/31/910.html" itemprop="url"><span itemprop="name" title="Lars Birkedal">Lars Birkedal</span></a></span>:<br /> <span class="title" itemprop="name">Mechanized logical relations for termination-insensitive noninterference.</span> <span itemprop="pagination">1-29</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/SabokSSW21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434292"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434292" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/SabokSSW21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/SabokSSW21&rft.au=Marcin+Sabok&rft.atitle=Probabilistic+programming+semantics+for+name+generation.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-29&rft_id=info%3Adoi%2F10.1145%2F3434292&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/SabokSSW21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/SabokSSW21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/SabokSSW21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/SabokSSW21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/SabokSSW21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/SabokSSW21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/SabokSSW21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Probabilistic+programming+semantics+for+name+generation."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Probabilistic+programming+semantics+for+name+generation."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Probabilistic+programming+semantics+for+name+generation."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Probabilistic+programming+semantics+for+name+generation."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Probabilistic+programming+semantics+for+name+generation."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Probabilistic+programming+semantics+for+name+generation."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434292&text=%22Probabilistic+programming+semantics+for+name+generation.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434292&text=%22Probabilistic+programming+semantics+for+name+generation.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434292&title=%22Probabilistic+programming+semantics+for+name+generation.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434292&title=%22Probabilistic+programming+semantics+for+name+generation.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434292"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434292&title=%22Probabilistic+programming+semantics+for+name+generation.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434292"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/SabokSSW21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/94/315.html" itemprop="url"><span itemprop="name" title="Marcin Sabok">Marcin Sabok</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/07/197.html" itemprop="url"><span itemprop="name" title="Sam Staton">Sam Staton</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/215/5179.html" itemprop="url"><span itemprop="name" title="Dario Stein">Dario Stein</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/270/9029.html" itemprop="url"><span itemprop="name" title="Michael Wolman">Michael Wolman</span></a></span>:<br /> <span class="title" itemprop="name">Probabilistic programming semantics for name generation.</span> <span itemprop="pagination">1-29</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/AngiuliCMZ21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434293"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434293" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/AngiuliCMZ21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/AngiuliCMZ21&rft.au=Carlo+Angiuli&rft.atitle=Internalizing+representation+independence+with+univalence.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-30&rft_id=info%3Adoi%2F10.1145%2F3434293&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/AngiuliCMZ21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/AngiuliCMZ21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/AngiuliCMZ21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/AngiuliCMZ21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/AngiuliCMZ21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/AngiuliCMZ21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/AngiuliCMZ21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Internalizing+representation+independence+with+univalence."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Internalizing+representation+independence+with+univalence."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Internalizing+representation+independence+with+univalence."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Internalizing+representation+independence+with+univalence."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Internalizing+representation+independence+with+univalence."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Internalizing+representation+independence+with+univalence."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434293&text=%22Internalizing+representation+independence+with+univalence.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434293&text=%22Internalizing+representation+independence+with+univalence.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434293&title=%22Internalizing+representation+independence+with+univalence.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434293&title=%22Internalizing+representation+independence+with+univalence.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434293"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434293&title=%22Internalizing+representation+independence+with+univalence.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434293"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/AngiuliCMZ21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/154/2030.html" itemprop="url"><span itemprop="name" title="Carlo Angiuli">Carlo Angiuli</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/213/7511.html" itemprop="url"><span itemprop="name" title="Evan Cavallo">Evan Cavallo</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/01/11536.html" itemprop="url"><span itemprop="name" title="Anders Mörtberg">Anders Mörtberg</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/274/2339.html" itemprop="url"><span itemprop="name" title="Max Zeuner">Max Zeuner</span></a></span>:<br /> <span class="title" itemprop="name">Internalizing representation independence with univalence.</span> <span itemprop="pagination">1-30</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/SpiesKD21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434294"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434294" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/SpiesKD21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/SpiesKD21&rft.au=Simon+Spies&rft.atitle=Transfinite+step-indexing+for+termination.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-29&rft_id=info%3Adoi%2F10.1145%2F3434294&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/SpiesKD21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/SpiesKD21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/SpiesKD21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/SpiesKD21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/SpiesKD21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/SpiesKD21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/SpiesKD21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Transfinite+step-indexing+for+termination."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Transfinite+step-indexing+for+termination."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Transfinite+step-indexing+for+termination."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Transfinite+step-indexing+for+termination."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Transfinite+step-indexing+for+termination."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Transfinite+step-indexing+for+termination."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434294&text=%22Transfinite+step-indexing+for+termination.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434294&text=%22Transfinite+step-indexing+for+termination.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434294&title=%22Transfinite+step-indexing+for+termination.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434294&title=%22Transfinite+step-indexing+for+termination.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434294"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434294&title=%22Transfinite+step-indexing+for+termination.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434294"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/SpiesKD21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/232/5277.html" itemprop="url"><span itemprop="name" title="Simon Spies">Simon Spies</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/92/1903.html" itemprop="url"><span itemprop="name" title="Neel Krishnaswami">Neel Krishnaswami</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/d/DerekDreyer.html" itemprop="url"><span itemprop="name" title="Derek Dreyer">Derek Dreyer</span></a></span>:<br /> <span class="title" itemprop="name">Transfinite step-indexing for termination.</span> <span itemprop="pagination">1-29</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/BenediktP21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434295"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434295" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/BenediktP21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/BenediktP21&rft.au=Michael+Benedikt&rft.atitle=Generating+collection+transformations+from+proofs.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-28&rft_id=info%3Adoi%2F10.1145%2F3434295&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/BenediktP21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/BenediktP21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/BenediktP21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/BenediktP21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/BenediktP21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/BenediktP21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/BenediktP21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Generating+collection+transformations+from+proofs."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Generating+collection+transformations+from+proofs."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Generating+collection+transformations+from+proofs."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Generating+collection+transformations+from+proofs."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Generating+collection+transformations+from+proofs."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Generating+collection+transformations+from+proofs."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434295&text=%22Generating+collection+transformations+from+proofs.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434295&text=%22Generating+collection+transformations+from+proofs.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434295&title=%22Generating+collection+transformations+from+proofs.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434295&title=%22Generating+collection+transformations+from+proofs.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434295"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434295&title=%22Generating+collection+transformations+from+proofs.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434295"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/BenediktP21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/b/MichaelBenedikt.html" itemprop="url"><span itemprop="name" title="Michael Benedikt">Michael Benedikt</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/155/8146.html" itemprop="url"><span itemprop="name" title="Pierre Pradic">Pierre Pradic</span></a></span>:<br /> <span class="title" itemprop="name">Generating collection transformations from proofs.</span> <span itemprop="pagination">1-28</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/FeldmanSSW21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434296"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434296" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/FeldmanSSW21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/FeldmanSSW21&rft.au=Yotam+M.+Y.+Feldman&rft.atitle=Learning+the+boundary+of+inductive+invariants.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-30&rft_id=info%3Adoi%2F10.1145%2F3434296&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/FeldmanSSW21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/FeldmanSSW21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/FeldmanSSW21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/FeldmanSSW21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/FeldmanSSW21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/FeldmanSSW21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/FeldmanSSW21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Learning+the+boundary+of+inductive+invariants."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Learning+the+boundary+of+inductive+invariants."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Learning+the+boundary+of+inductive+invariants."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Learning+the+boundary+of+inductive+invariants."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Learning+the+boundary+of+inductive+invariants."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Learning+the+boundary+of+inductive+invariants."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434296&text=%22Learning+the+boundary+of+inductive+invariants.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434296&text=%22Learning+the+boundary+of+inductive+invariants.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434296&title=%22Learning+the+boundary+of+inductive+invariants.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434296&title=%22Learning+the+boundary+of+inductive+invariants.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434296"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434296&title=%22Learning+the+boundary+of+inductive+invariants.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434296"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/FeldmanSSW21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/193/0778.html" itemprop="url"><span itemprop="name" title="Yotam M. Y. Feldman">Yotam M. Y. Feldman</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/s/SSagiv.html" itemprop="url"><span itemprop="name" title="Mooly Sagiv">Mooly Sagiv</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/92/128.html" itemprop="url"><span itemprop="name" title="Sharon Shoham">Sharon Shoham</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/38/10688-1.html" itemprop="url"><span itemprop="name" title="James R. Wilcox">James R. Wilcox</span></a></span>:<br /> <span class="title" itemprop="name">Learning the boundary of inductive invariants.</span> <span itemprop="pagination">1-30</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/GhilezanPPSY21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434297"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434297" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/GhilezanPPSY21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/GhilezanPPSY21&rft.au=Silvia+Ghilezan&rft.atitle=Precise+subtyping+for+asynchronous+multiparty+sessions.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-28&rft_id=info%3Adoi%2F10.1145%2F3434297&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/GhilezanPPSY21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/GhilezanPPSY21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/GhilezanPPSY21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/GhilezanPPSY21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/GhilezanPPSY21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/GhilezanPPSY21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/GhilezanPPSY21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Precise+subtyping+for+asynchronous+multiparty+sessions."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Precise+subtyping+for+asynchronous+multiparty+sessions."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Precise+subtyping+for+asynchronous+multiparty+sessions."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Precise+subtyping+for+asynchronous+multiparty+sessions."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Precise+subtyping+for+asynchronous+multiparty+sessions."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Precise+subtyping+for+asynchronous+multiparty+sessions."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434297&text=%22Precise+subtyping+for+asynchronous+multiparty+sessions.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434297&text=%22Precise+subtyping+for+asynchronous+multiparty+sessions.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434297&title=%22Precise+subtyping+for+asynchronous+multiparty+sessions.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434297&title=%22Precise+subtyping+for+asynchronous+multiparty+sessions.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434297"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434297&title=%22Precise+subtyping+for+asynchronous+multiparty+sessions.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434297"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/GhilezanPPSY21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/g/SilviaGhilezan.html" itemprop="url"><span itemprop="name" title="Silvia Ghilezan">Silvia Ghilezan</span></a><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0003-2253-8285" /></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/35/4108.html" itemprop="url"><span itemprop="name" title="Jovanka Pantovic">Jovanka Pantovic</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/202/7664.html" itemprop="url"><span itemprop="name" title="Ivan Prokic">Ivan Prokic</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/16/7577.html" itemprop="url"><span itemprop="name" title="Alceste Scalas">Alceste Scalas</span></a><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0002-1153-6164" /></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/29/3650.html" itemprop="url"><span itemprop="name" title="Nobuko Yoshida">Nobuko Yoshida</span></a><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0002-3925-8557" /></span>:<br /> <span class="title" itemprop="name">Precise subtyping for asynchronous multiparty sessions.</span> <span itemprop="pagination">1-28</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/FerlesSD21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434298"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434298" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/FerlesSD21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/FerlesSD21&rft.au=Kostas+Ferles&rft.atitle=Verifying+correct+usage+of+context-free+API+protocols.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-30&rft_id=info%3Adoi%2F10.1145%2F3434298&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/FerlesSD21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/FerlesSD21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/FerlesSD21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/FerlesSD21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/FerlesSD21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/FerlesSD21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/FerlesSD21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Verifying+correct+usage+of+context-free+API+protocols."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Verifying+correct+usage+of+context-free+API+protocols."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Verifying+correct+usage+of+context-free+API+protocols."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Verifying+correct+usage+of+context-free+API+protocols."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Verifying+correct+usage+of+context-free+API+protocols."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Verifying+correct+usage+of+context-free+API+protocols."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434298&text=%22Verifying+correct+usage+of+context-free+API+protocols.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434298&text=%22Verifying+correct+usage+of+context-free+API+protocols.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434298&title=%22Verifying+correct+usage+of+context-free+API+protocols.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434298&title=%22Verifying+correct+usage+of+context-free+API+protocols.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434298"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434298&title=%22Verifying+correct+usage+of+context-free+API+protocols.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434298"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/FerlesSD21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/202/1679.html" itemprop="url"><span itemprop="name" title="Kostas Ferles">Kostas Ferles</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/196/8839.html" itemprop="url"><span itemprop="name" title="Jon Stephens">Jon Stephens</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/85/3688.html" itemprop="url"><span itemprop="name" title="Isil Dillig">Isil Dillig</span></a></span>:<br /> <span class="title" itemprop="name">Verifying correct usage of context-free API protocols.</span> <span itemprop="pagination">1-30</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/0002WA21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434299"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434299" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/0002WA21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/0002WA21&rft.au=Jatin+Arora&rft.atitle=Provably+space-efficient+parallel+functional+programming.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-33&rft_id=info%3Adoi%2F10.1145%2F3434299&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/0002WA21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/0002WA21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/0002WA21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/0002WA21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/0002WA21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/0002WA21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/0002WA21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Provably+space-efficient+parallel+functional+programming."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Provably+space-efficient+parallel+functional+programming."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Provably+space-efficient+parallel+functional+programming."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Provably+space-efficient+parallel+functional+programming."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Provably+space-efficient+parallel+functional+programming."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Provably+space-efficient+parallel+functional+programming."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434299&text=%22Provably+space-efficient+parallel+functional+programming.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434299&text=%22Provably+space-efficient+parallel+functional+programming.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434299&title=%22Provably+space-efficient+parallel+functional+programming.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434299&title=%22Provably+space-efficient+parallel+functional+programming.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434299"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434299&title=%22Provably+space-efficient+parallel+functional+programming.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434299"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/0002WA21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/166/8570-2.html" itemprop="url"><span itemprop="name" title="Jatin Arora 0002">Jatin Arora</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/203/3288.html" itemprop="url"><span itemprop="name" title="Sam Westrick">Sam Westrick</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/44/3421.html" itemprop="url"><span itemprop="name" title="Umut A. Acar">Umut A. Acar</span></a></span>:<br /> <span class="title" itemprop="name">Provably space-efficient parallel functional programming.</span> <span itemprop="pagination">1-33</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/PavlinovicSW21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434300"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434300" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/PavlinovicSW21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/PavlinovicSW21&rft.au=Zvonimir+Pavlinovic&rft.atitle=Data+flow+refinement+type+inference.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-31&rft_id=info%3Adoi%2F10.1145%2F3434300&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/PavlinovicSW21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/PavlinovicSW21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/PavlinovicSW21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/PavlinovicSW21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/PavlinovicSW21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/PavlinovicSW21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/PavlinovicSW21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Data+flow+refinement+type+inference."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Data+flow+refinement+type+inference."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Data+flow+refinement+type+inference."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Data+flow+refinement+type+inference."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Data+flow+refinement+type+inference."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Data+flow+refinement+type+inference."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434300&text=%22Data+flow+refinement+type+inference.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434300&text=%22Data+flow+refinement+type+inference.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434300&title=%22Data+flow+refinement+type+inference.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434300&title=%22Data+flow+refinement+type+inference.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434300"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434300&title=%22Data+flow+refinement+type+inference.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434300"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/PavlinovicSW21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/152/5859.html" itemprop="url"><span itemprop="name" title="Zvonimir Pavlinovic">Zvonimir Pavlinovic</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/278/2343.html" itemprop="url"><span itemprop="name" title="Yusen Su">Yusen Su</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/23/5398.html" itemprop="url"><span itemprop="name" title="Thomas Wies">Thomas Wies</span></a></span>:<br /> <span class="title" itemprop="name">Data flow refinement type inference.</span> <span itemprop="pagination">1-31</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/YangAC21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434301"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434301" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/YangAC21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/YangAC21&rft.au=Cambridge+Yang&rft.atitle=Simplifying+dependent+reductions+in+the+polyhedral+model.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-33&rft_id=info%3Adoi%2F10.1145%2F3434301&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/YangAC21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/YangAC21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/YangAC21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/YangAC21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/YangAC21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/YangAC21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/YangAC21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Simplifying+dependent+reductions+in+the+polyhedral+model."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Simplifying+dependent+reductions+in+the+polyhedral+model."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Simplifying+dependent+reductions+in+the+polyhedral+model."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Simplifying+dependent+reductions+in+the+polyhedral+model."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Simplifying+dependent+reductions+in+the+polyhedral+model."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Simplifying+dependent+reductions+in+the+polyhedral+model."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434301&text=%22Simplifying+dependent+reductions+in+the+polyhedral+model.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434301&text=%22Simplifying+dependent+reductions+in+the+polyhedral+model.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434301&title=%22Simplifying+dependent+reductions+in+the+polyhedral+model.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434301&title=%22Simplifying+dependent+reductions+in+the+polyhedral+model.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434301"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434301&title=%22Simplifying+dependent+reductions+in+the+polyhedral+model.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434301"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/YangAC21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/220/3043.html" itemprop="url"><span itemprop="name" title="Cambridge Yang">Cambridge Yang</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/126/2056.html" itemprop="url"><span itemprop="name" title="Eric Atkinson">Eric Atkinson</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/07/3119.html" itemprop="url"><span itemprop="name" title="Michael Carbin">Michael Carbin</span></a></span>:<br /> <span class="title" itemprop="name">Simplifying dependent reductions in the polyhedral model.</span> <span itemprop="pagination">1-33</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/PatrignaniMD21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434302"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434302" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/PatrignaniMD21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/PatrignaniMD21&rft.au=Marco+Patrignani&rft.atitle=On+the+semantic+expressiveness+of+recursive+types.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-29&rft_id=info%3Adoi%2F10.1145%2F3434302&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/PatrignaniMD21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/PatrignaniMD21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/PatrignaniMD21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/PatrignaniMD21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/PatrignaniMD21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/PatrignaniMD21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/PatrignaniMD21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=On+the+semantic+expressiveness+of+recursive+types."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=On+the+semantic+expressiveness+of+recursive+types."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=On+the+semantic+expressiveness+of+recursive+types."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=On+the+semantic+expressiveness+of+recursive+types."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=On+the+semantic+expressiveness+of+recursive+types."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=On+the+semantic+expressiveness+of+recursive+types."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434302&text=%22On+the+semantic+expressiveness+of+recursive+types.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434302&text=%22On+the+semantic+expressiveness+of+recursive+types.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434302&title=%22On+the+semantic+expressiveness+of+recursive+types.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434302&title=%22On+the+semantic+expressiveness+of+recursive+types.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434302"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434302&title=%22On+the+semantic+expressiveness+of+recursive+types.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434302"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/PatrignaniMD21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/41/9729.html" itemprop="url"><span itemprop="name" title="Marco Patrignani">Marco Patrignani</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/277/0626.html" itemprop="url"><span itemprop="name" title="Eric Mark Martin">Eric Mark Martin</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/74/8301.html" itemprop="url"><span itemprop="name" title="Dominique Devriese">Dominique Devriese</span></a><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0002-3862-6856" /></span>:<br /> <span class="title" itemprop="name">On the semantic expressiveness of recursive types.</span> <span itemprop="pagination">1-29</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/RouvoetKV21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434303"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434303" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/RouvoetKV21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/RouvoetKV21&rft.au=Arjen+Rouvoet&rft.atitle=Intrinsically+typed+compilation+with+nameless+labels.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-28&rft_id=info%3Adoi%2F10.1145%2F3434303&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/RouvoetKV21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/RouvoetKV21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/RouvoetKV21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/RouvoetKV21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/RouvoetKV21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/RouvoetKV21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/RouvoetKV21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Intrinsically+typed+compilation+with+nameless+labels."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Intrinsically+typed+compilation+with+nameless+labels."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Intrinsically+typed+compilation+with+nameless+labels."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Intrinsically+typed+compilation+with+nameless+labels."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Intrinsically+typed+compilation+with+nameless+labels."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Intrinsically+typed+compilation+with+nameless+labels."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434303&text=%22Intrinsically+typed+compilation+with+nameless+labels.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434303&text=%22Intrinsically+typed+compilation+with+nameless+labels.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434303&title=%22Intrinsically+typed+compilation+with+nameless+labels.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434303&title=%22Intrinsically+typed+compilation+with+nameless+labels.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434303"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434303&title=%22Intrinsically+typed+compilation+with+nameless+labels.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434303"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/RouvoetKV21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/211/9233.html" itemprop="url"><span itemprop="name" title="Arjen Rouvoet">Arjen Rouvoet</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/96/8576.html" itemprop="url"><span itemprop="name" title="Robbert Krebbers">Robbert Krebbers</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/00/5705.html" itemprop="url"><span itemprop="name" title="Eelco Visser">Eelco Visser</span></a></span>:<br /> <span class="title" itemprop="name">Intrinsically typed compilation with nameless labels.</span> <span itemprop="pagination">1-28</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/WillseyNWFTP21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434304"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434304" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/WillseyNWFTP21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/WillseyNWFTP21&rft.au=Max+Willsey&rft.atitle=egg%3A+Fast+and+extensible+equality+saturation.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-29&rft_id=info%3Adoi%2F10.1145%2F3434304&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/WillseyNWFTP21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/WillseyNWFTP21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/WillseyNWFTP21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/WillseyNWFTP21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/WillseyNWFTP21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/WillseyNWFTP21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/WillseyNWFTP21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=egg%3A+Fast+and+extensible+equality+saturation."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=egg%3A+Fast+and+extensible+equality+saturation."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=egg%3A+Fast+and+extensible+equality+saturation."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=egg%3A+Fast+and+extensible+equality+saturation."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=egg%3A+Fast+and+extensible+equality+saturation."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=egg%3A+Fast+and+extensible+equality+saturation."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434304&text=%22egg%3A+Fast+and+extensible+equality+saturation.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434304&text=%22egg%3A+Fast+and+extensible+equality+saturation.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434304&title=%22egg%3A+Fast+and+extensible+equality+saturation.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434304&title=%22egg%3A+Fast+and+extensible+equality+saturation.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434304"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434304&title=%22egg%3A+Fast+and+extensible+equality+saturation.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434304"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/WillseyNWFTP21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/194/2846.html" itemprop="url"><span itemprop="name" title="Max Willsey">Max Willsey</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/157/8240.html" itemprop="url"><span itemprop="name" title="Chandrakana Nandi">Chandrakana Nandi</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/185/9964.html" itemprop="url"><span itemprop="name" title="Yisu Remy Wang">Yisu Remy Wang</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/262/3988.html" itemprop="url"><span itemprop="name" title="Oliver Flatt">Oliver Flatt</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/24/2888.html" itemprop="url"><span itemprop="name" title="Zachary Tatlock">Zachary Tatlock</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/132/1798.html" itemprop="url"><span itemprop="name" title="Pavel Panchekha">Pavel Panchekha</span></a></span>:<br /> <span class="title" itemprop="name">egg: Fast and extensible equality saturation.</span> <span itemprop="pagination">1-29</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/AhmanP21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434305"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434305" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/AhmanP21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/AhmanP21&rft.au=Danel+Ahman&rft.atitle=Asynchronous+effects.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-28&rft_id=info%3Adoi%2F10.1145%2F3434305&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/AhmanP21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/AhmanP21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/AhmanP21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/AhmanP21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/AhmanP21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/AhmanP21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/AhmanP21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Asynchronous+effects."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Asynchronous+effects."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Asynchronous+effects."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Asynchronous+effects."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Asynchronous+effects."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Asynchronous+effects."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434305&text=%22Asynchronous+effects.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434305&text=%22Asynchronous+effects.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434305&title=%22Asynchronous+effects.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434305&title=%22Asynchronous+effects.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434305"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434305&title=%22Asynchronous+effects.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434305"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/AhmanP21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/22/10964.html" itemprop="url"><span itemprop="name" title="Danel Ahman">Danel Ahman</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/21/497.html" itemprop="url"><span itemprop="name" title="Matija Pretnar">Matija Pretnar</span></a></span>:<br /> <span class="title" itemprop="name">Asynchronous effects.</span> <span itemprop="pagination">1-28</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/Muller021" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434306"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434306" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/Muller021.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/Muller021&rft.au=Stefan+K.+Muller&rft.atitle=Modeling+and+analyzing+evaluation+cost+of+CUDA+kernels.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-31&rft_id=info%3Adoi%2F10.1145%2F3434306&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/Muller021.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/Muller021.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/Muller021.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/Muller021.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/Muller021.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/Muller021.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/Muller021</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Modeling+and+analyzing+evaluation+cost+of+CUDA+kernels."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Modeling+and+analyzing+evaluation+cost+of+CUDA+kernels."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Modeling+and+analyzing+evaluation+cost+of+CUDA+kernels."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Modeling+and+analyzing+evaluation+cost+of+CUDA+kernels."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Modeling+and+analyzing+evaluation+cost+of+CUDA+kernels."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Modeling+and+analyzing+evaluation+cost+of+CUDA+kernels."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434306&text=%22Modeling+and+analyzing+evaluation+cost+of+CUDA+kernels.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434306&text=%22Modeling+and+analyzing+evaluation+cost+of+CUDA+kernels.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434306&title=%22Modeling+and+analyzing+evaluation+cost+of+CUDA+kernels.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434306&title=%22Modeling+and+analyzing+evaluation+cost+of+CUDA+kernels.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434306"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434306&title=%22Modeling+and+analyzing+evaluation+cost+of+CUDA+kernels.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434306"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/Muller021</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/162/0450.html" itemprop="url"><span itemprop="name" title="Stefan K. Muller">Stefan K. Muller</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/75/425.html" itemprop="url"><span itemprop="name" title="Jan Hoffmann 0002">Jan Hoffmann</span></a></span>:<br /> <span class="title" itemprop="name">Modeling and analyzing evaluation cost of CUDA kernels.</span> <span itemprop="pagination">1-31</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/SilverZ21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434307"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434307" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/SilverZ21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/SilverZ21&rft.au=Lucas+Silver&rft.atitle=Dijkstra+monads+forever%3A+termination-sensitive+specifications+for+interaction+trees.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-28&rft_id=info%3Adoi%2F10.1145%2F3434307&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/SilverZ21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/SilverZ21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/SilverZ21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/SilverZ21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/SilverZ21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/SilverZ21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/SilverZ21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Dijkstra+monads+forever%3A+termination-sensitive+specifications+for+interaction+trees."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Dijkstra+monads+forever%3A+termination-sensitive+specifications+for+interaction+trees."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Dijkstra+monads+forever%3A+termination-sensitive+specifications+for+interaction+trees."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Dijkstra+monads+forever%3A+termination-sensitive+specifications+for+interaction+trees."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Dijkstra+monads+forever%3A+termination-sensitive+specifications+for+interaction+trees."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Dijkstra+monads+forever%3A+termination-sensitive+specifications+for+interaction+trees."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434307&text=%22Dijkstra+monads+forever%3A+termination-sensitive+specifications+for+interaction+trees.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434307&text=%22Dijkstra+monads+forever%3A+termination-sensitive+specifications+for+interaction+trees.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434307&title=%22Dijkstra+monads+forever%3A+termination-sensitive+specifications+for+interaction+trees.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434307&title=%22Dijkstra+monads+forever%3A+termination-sensitive+specifications+for+interaction+trees.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434307"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434307&title=%22Dijkstra+monads+forever%3A+termination-sensitive+specifications+for+interaction+trees.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434307"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/SilverZ21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/283/3591.html" itemprop="url"><span itemprop="name" title="Lucas Silver">Lucas Silver</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/99/3437.html" itemprop="url"><span itemprop="name" title="Steve Zdancewic">Steve Zdancewic</span></a></span>:<br /> <span class="title" itemprop="name">Dijkstra monads forever: termination-sensitive specifications for interaction trees.</span> <span itemprop="pagination">1-28</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/RajaniG0021" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434308"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434308" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/RajaniG0021.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/RajaniG0021&rft.au=Vineet+Rajani&rft.atitle=A+unifying+type-theory+for+higher-order+%28amortized%29+cost+analysis.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-28&rft_id=info%3Adoi%2F10.1145%2F3434308&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/RajaniG0021.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/RajaniG0021.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/RajaniG0021.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/RajaniG0021.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/RajaniG0021.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/RajaniG0021.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/RajaniG0021</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=A+unifying+type-theory+for+higher-order+%28amortized%29+cost+analysis."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=A+unifying+type-theory+for+higher-order+%28amortized%29+cost+analysis."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=A+unifying+type-theory+for+higher-order+%28amortized%29+cost+analysis."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=A+unifying+type-theory+for+higher-order+%28amortized%29+cost+analysis."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=A+unifying+type-theory+for+higher-order+%28amortized%29+cost+analysis."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=A+unifying+type-theory+for+higher-order+%28amortized%29+cost+analysis."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434308&text=%22A+unifying+type-theory+for+higher-order+%28amortized%29+cost+analysis.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434308&text=%22A+unifying+type-theory+for+higher-order+%28amortized%29+cost+analysis.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434308&title=%22A+unifying+type-theory+for+higher-order+%28amortized%29+cost+analysis.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434308&title=%22A+unifying+type-theory+for+higher-order+%28amortized%29+cost+analysis.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434308"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434308&title=%22A+unifying+type-theory+for+higher-order+%28amortized%29+cost+analysis.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434308"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/RajaniG0021</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/99/4141.html" itemprop="url"><span itemprop="name" title="Vineet Rajani">Vineet Rajani</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/84/3396.html" itemprop="url"><span itemprop="name" title="Marco Gaboardi">Marco Gaboardi</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/45/6786-1.html" itemprop="url"><span itemprop="name" title="Deepak Garg 0001">Deepak Garg</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/75/425.html" itemprop="url"><span itemprop="name" title="Jan Hoffmann 0002">Jan Hoffmann</span></a></span>:<br /> <span class="title" itemprop="name">A unifying type-theory for higher-order (amortized) cost analysis.</span> <span itemprop="pagination">1-28</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/MazzaP21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434309"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434309" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/MazzaP21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/MazzaP21&rft.au=Damiano+Mazza&rft.atitle=Automatic+differentiation+in+PCF.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-27&rft_id=info%3Adoi%2F10.1145%2F3434309&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/MazzaP21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/MazzaP21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/MazzaP21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/MazzaP21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/MazzaP21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/MazzaP21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/MazzaP21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Automatic+differentiation+in+PCF."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Automatic+differentiation+in+PCF."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Automatic+differentiation+in+PCF."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Automatic+differentiation+in+PCF."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Automatic+differentiation+in+PCF."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Automatic+differentiation+in+PCF."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434309&text=%22Automatic+differentiation+in+PCF.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434309&text=%22Automatic+differentiation+in+PCF.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434309&title=%22Automatic+differentiation+in+PCF.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434309&title=%22Automatic+differentiation+in+PCF.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434309"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434309&title=%22Automatic+differentiation+in+PCF.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434309"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/MazzaP21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/33/4213.html" itemprop="url"><span itemprop="name" title="Damiano Mazza">Damiano Mazza</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/60/4141.html" itemprop="url"><span itemprop="name" title="Michele Pagani">Michele Pagani</span></a></span>:<br /> <span class="title" itemprop="name">Automatic differentiation in PCF.</span> <span itemprop="pagination">1-27</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/LimAGN21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434310"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434310" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/LimAGN21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/LimAGN21&rft.au=Jay+P.+Lim&rft.atitle=An+approach+to+generate+correctly+rounded+math+libraries+for+new+floating+point+variants.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-30&rft_id=info%3Adoi%2F10.1145%2F3434310&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/LimAGN21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/LimAGN21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/LimAGN21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/LimAGN21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/LimAGN21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/LimAGN21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/LimAGN21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=An+approach+to+generate+correctly+rounded+math+libraries+for+new+floating+point+variants."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=An+approach+to+generate+correctly+rounded+math+libraries+for+new+floating+point+variants."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=An+approach+to+generate+correctly+rounded+math+libraries+for+new+floating+point+variants."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=An+approach+to+generate+correctly+rounded+math+libraries+for+new+floating+point+variants."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=An+approach+to+generate+correctly+rounded+math+libraries+for+new+floating+point+variants."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=An+approach+to+generate+correctly+rounded+math+libraries+for+new+floating+point+variants."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434310&text=%22An+approach+to+generate+correctly+rounded+math+libraries+for+new+floating+point+variants.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434310&text=%22An+approach+to+generate+correctly+rounded+math+libraries+for+new+floating+point+variants.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434310&title=%22An+approach+to+generate+correctly+rounded+math+libraries+for+new+floating+point+variants.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434310&title=%22An+approach+to+generate+correctly+rounded+math+libraries+for+new+floating+point+variants.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434310"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434310&title=%22An+approach+to+generate+correctly+rounded+math+libraries+for+new+floating+point+variants.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434310"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/LimAGN21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/219/9089.html" itemprop="url"><span itemprop="name" title="Jay P. Lim">Jay P. Lim</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/81/5359.html" itemprop="url"><span itemprop="name" title="Mridul Aanjaneya">Mridul Aanjaneya</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/54/2801.html" itemprop="url"><span itemprop="name" title="John Gustafson">John Gustafson</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/57/1735.html" itemprop="url"><span itemprop="name" title="Santosh Nagarakatte">Santosh Nagarakatte</span></a></span>:<br /> <span class="title" itemprop="name">An approach to generate correctly rounded math libraries for new floating point variants.</span> <span itemprop="pagination">1-30</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/KimHDR21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434311"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434311" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/KimHDR21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/KimHDR21&rft.au=Jinwoo+Kim&rft.atitle=Semantics-guided+synthesis.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-32&rft_id=info%3Adoi%2F10.1145%2F3434311&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/KimHDR21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/KimHDR21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/KimHDR21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/KimHDR21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/KimHDR21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/KimHDR21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/KimHDR21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Semantics-guided+synthesis."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Semantics-guided+synthesis."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Semantics-guided+synthesis."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Semantics-guided+synthesis."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Semantics-guided+synthesis."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Semantics-guided+synthesis."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434311&text=%22Semantics-guided+synthesis.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434311&text=%22Semantics-guided+synthesis.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434311&title=%22Semantics-guided+synthesis.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434311&title=%22Semantics-guided+synthesis.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434311"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434311&title=%22Semantics-guided+synthesis.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434311"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/KimHDR21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/85/1809.html" itemprop="url"><span itemprop="name" title="Jinwoo Kim">Jinwoo Kim</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/201/4822.html" itemprop="url"><span itemprop="name" title="Qinheping Hu">Qinheping Hu</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/85/770.html" itemprop="url"><span itemprop="name" title="Loris D'Antoni">Loris D'Antoni</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/r/TWReps.html" itemprop="url"><span itemprop="name" title="Thomas W. Reps">Thomas W. Reps</span></a></span>:<br /> <span class="title" itemprop="name">Semantics-guided synthesis.</span> <span itemprop="pagination">1-32</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/RosemannMH21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434312"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434312" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/RosemannMH21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/RosemannMH21&rft.au=Julian+Rosemann&rft.atitle=An+abstract+interpretation+for+SPMD+divergence+on+reducible+control+flow+graphs.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-31&rft_id=info%3Adoi%2F10.1145%2F3434312&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/RosemannMH21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/RosemannMH21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/RosemannMH21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/RosemannMH21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/RosemannMH21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/RosemannMH21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/RosemannMH21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=An+abstract+interpretation+for+SPMD+divergence+on+reducible+control+flow+graphs."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=An+abstract+interpretation+for+SPMD+divergence+on+reducible+control+flow+graphs."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=An+abstract+interpretation+for+SPMD+divergence+on+reducible+control+flow+graphs."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=An+abstract+interpretation+for+SPMD+divergence+on+reducible+control+flow+graphs."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=An+abstract+interpretation+for+SPMD+divergence+on+reducible+control+flow+graphs."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=An+abstract+interpretation+for+SPMD+divergence+on+reducible+control+flow+graphs."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434312&text=%22An+abstract+interpretation+for+SPMD+divergence+on+reducible+control+flow+graphs.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434312&text=%22An+abstract+interpretation+for+SPMD+divergence+on+reducible+control+flow+graphs.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434312&title=%22An+abstract+interpretation+for+SPMD+divergence+on+reducible+control+flow+graphs.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434312&title=%22An+abstract+interpretation+for+SPMD+divergence+on+reducible+control+flow+graphs.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434312"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434312&title=%22An+abstract+interpretation+for+SPMD+divergence+on+reducible+control+flow+graphs.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434312"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/RosemannMH21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/205/4370.html" itemprop="url"><span itemprop="name" title="Julian Rosemann">Julian Rosemann</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/150/7043.html" itemprop="url"><span itemprop="name" title="Simon Moll">Simon Moll</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/96/92.html" itemprop="url"><span itemprop="name" title="Sebastian Hack">Sebastian Hack</span></a></span>:<br /> <span class="title" itemprop="name">An abstract interpretation for SPMD divergence on reducible control flow graphs.</span> <span itemprop="pagination">1-31</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/LagoFR21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434313"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434313" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/LagoFR21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/LagoFR21&rft.au=Ugo+Dal+Lago&rft.atitle=Intersection+types+and+%28positive%29+almost-sure+termination.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-32&rft_id=info%3Adoi%2F10.1145%2F3434313&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/LagoFR21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/LagoFR21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/LagoFR21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/LagoFR21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/LagoFR21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/LagoFR21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/LagoFR21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Intersection+types+and+%28positive%29+almost-sure+termination."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Intersection+types+and+%28positive%29+almost-sure+termination."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Intersection+types+and+%28positive%29+almost-sure+termination."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Intersection+types+and+%28positive%29+almost-sure+termination."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Intersection+types+and+%28positive%29+almost-sure+termination."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Intersection+types+and+%28positive%29+almost-sure+termination."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434313&text=%22Intersection+types+and+%28positive%29+almost-sure+termination.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434313&text=%22Intersection+types+and+%28positive%29+almost-sure+termination.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434313&title=%22Intersection+types+and+%28positive%29+almost-sure+termination.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434313&title=%22Intersection+types+and+%28positive%29+almost-sure+termination.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434313"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434313&title=%22Intersection+types+and+%28positive%29+almost-sure+termination.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434313"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/LagoFR21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/44/3105.html" itemprop="url"><span itemprop="name" title="Ugo Dal Lago">Ugo Dal Lago</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/91/4180.html" itemprop="url"><span itemprop="name" title="Claudia Faggian">Claudia Faggian</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/r/SRonchiDR.html" itemprop="url"><span itemprop="name" title="Simona Ronchi Della Rocca">Simona Ronchi Della Rocca</span></a></span>:<br /> <span class="title" itemprop="name">Intersection types and (positive) almost-sure termination.</span> <span itemprop="pagination">1-32</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/VilhenaP21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434314"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434314" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/VilhenaP21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/VilhenaP21&rft.au=Paulo+Em%C3%ADlio+de+Vilhena&rft.atitle=A+separation+logic+for+effect+handlers.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-28&rft_id=info%3Adoi%2F10.1145%2F3434314&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/VilhenaP21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/VilhenaP21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/VilhenaP21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/VilhenaP21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/VilhenaP21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/VilhenaP21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/VilhenaP21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=A+separation+logic+for+effect+handlers."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=A+separation+logic+for+effect+handlers."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=A+separation+logic+for+effect+handlers."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=A+separation+logic+for+effect+handlers."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=A+separation+logic+for+effect+handlers."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=A+separation+logic+for+effect+handlers."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434314&text=%22A+separation+logic+for+effect+handlers.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434314&text=%22A+separation+logic+for+effect+handlers.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434314&title=%22A+separation+logic+for+effect+handlers.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434314&title=%22A+separation+logic+for+effect+handlers.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434314"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434314&title=%22A+separation+logic+for+effect+handlers.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434314"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/VilhenaP21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/255/7543.html" itemprop="url"><span itemprop="name" title="Paulo Emílio de Vilhena">Paulo Emílio de Vilhena</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/12/6990.html" itemprop="url"><span itemprop="name" title="François Pottier">François Pottier</span></a></span>:<br /> <span class="title" itemprop="name">A separation logic for effect handlers.</span> <span itemprop="pagination">1-28</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/MathiasenP21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434315"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434315" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/MathiasenP21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/MathiasenP21&rft.au=Anders+Alnor+Mathiasen&rft.atitle=The+fine-grained+and+parallel+complexity+of+andersen%27s+pointer+analysis.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-29&rft_id=info%3Adoi%2F10.1145%2F3434315&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/MathiasenP21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/MathiasenP21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/MathiasenP21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/MathiasenP21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/MathiasenP21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/MathiasenP21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/MathiasenP21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=The+fine-grained+and+parallel+complexity+of+andersen%27s+pointer+analysis."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=The+fine-grained+and+parallel+complexity+of+andersen%27s+pointer+analysis."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=The+fine-grained+and+parallel+complexity+of+andersen%27s+pointer+analysis."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=The+fine-grained+and+parallel+complexity+of+andersen%27s+pointer+analysis."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=The+fine-grained+and+parallel+complexity+of+andersen%27s+pointer+analysis."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=The+fine-grained+and+parallel+complexity+of+andersen%27s+pointer+analysis."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434315&text=%22The+fine-grained+and+parallel+complexity+of+andersen%27s+pointer+analysis.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434315&text=%22The+fine-grained+and+parallel+complexity+of+andersen%27s+pointer+analysis.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434315&title=%22The+fine-grained+and+parallel+complexity+of+andersen%27s+pointer+analysis.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434315&title=%22The+fine-grained+and+parallel+complexity+of+andersen%27s+pointer+analysis.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434315"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434315&title=%22The+fine-grained+and+parallel+complexity+of+andersen%27s+pointer+analysis.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434315"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/MathiasenP21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/283/3669.html" itemprop="url"><span itemprop="name" title="Anders Alnor Mathiasen">Anders Alnor Mathiasen</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/47/8037.html" itemprop="url"><span itemprop="name" title="Andreas Pavlogiannis">Andreas Pavlogiannis</span></a><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0002-8943-0722" /></span>:<br /> <span class="title" itemprop="name">The fine-grained and parallel complexity of andersen's pointer analysis.</span> <span itemprop="pagination">1-29</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/HirschC21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434316"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434316" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/HirschC21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/HirschC21&rft.au=Andrew+K.+Hirsch&rft.atitle=Giving+semantics+to+program-counter+labels+via+secure+effects.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-29&rft_id=info%3Adoi%2F10.1145%2F3434316&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/HirschC21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/HirschC21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/HirschC21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/HirschC21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/HirschC21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/HirschC21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/HirschC21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Giving+semantics+to+program-counter+labels+via+secure+effects."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Giving+semantics+to+program-counter+labels+via+secure+effects."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Giving+semantics+to+program-counter+labels+via+secure+effects."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Giving+semantics+to+program-counter+labels+via+secure+effects."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Giving+semantics+to+program-counter+labels+via+secure+effects."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Giving+semantics+to+program-counter+labels+via+secure+effects."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434316&text=%22Giving+semantics+to+program-counter+labels+via+secure+effects.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434316&text=%22Giving+semantics+to+program-counter+labels+via+secure+effects.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434316&title=%22Giving+semantics+to+program-counter+labels+via+secure+effects.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434316&title=%22Giving+semantics+to+program-counter+labels+via+secure+effects.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434316"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434316&title=%22Giving+semantics+to+program-counter+labels+via+secure+effects.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434316"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/HirschC21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/122/2921.html" itemprop="url"><span itemprop="name" title="Andrew K. Hirsch">Andrew K. Hirsch</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/177/2245.html" itemprop="url"><span itemprop="name" title="Ethan Cecchetti">Ethan Cecchetti</span></a></span>:<br /> <span class="title" itemprop="name">Giving semantics to program-counter labels via secure effects.</span> <span itemprop="pagination">1-29</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/0001P021" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434317"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434317" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/0001P021.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/0001P021&rft.au=Umang+Mathur&rft.atitle=Optimal+prediction+of+synchronization-preserving+races.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-29&rft_id=info%3Adoi%2F10.1145%2F3434317&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/0001P021.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/0001P021.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/0001P021.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/0001P021.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/0001P021.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/0001P021.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/0001P021</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Optimal+prediction+of+synchronization-preserving+races."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Optimal+prediction+of+synchronization-preserving+races."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Optimal+prediction+of+synchronization-preserving+races."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Optimal+prediction+of+synchronization-preserving+races."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Optimal+prediction+of+synchronization-preserving+races."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Optimal+prediction+of+synchronization-preserving+races."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434317&text=%22Optimal+prediction+of+synchronization-preserving+races.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434317&text=%22Optimal+prediction+of+synchronization-preserving+races.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434317&title=%22Optimal+prediction+of+synchronization-preserving+races.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434317&title=%22Optimal+prediction+of+synchronization-preserving+races.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434317"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434317&title=%22Optimal+prediction+of+synchronization-preserving+races.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434317"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/0001P021</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/137/7835.html" itemprop="url"><span itemprop="name" title="Umang Mathur 0001">Umang Mathur</span></a><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0002-7610-0660" /></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/47/8037.html" itemprop="url"><span itemprop="name" title="Andreas Pavlogiannis">Andreas Pavlogiannis</span></a><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0002-8943-0722" /></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/23/2759-1.html" itemprop="url"><span itemprop="name" title="Mahesh Viswanathan 0001">Mahesh Viswanathan</span></a></span>:<br /> <span class="title" itemprop="name">Optimal prediction of synchronization-preserving races.</span> <span itemprop="pagination">1-29</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/Hietala0HW021" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434318"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434318" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/Hietala0HW021.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/Hietala0HW021&rft.au=Kesha+Hietala&rft.atitle=A+verified+optimizer+for+Quantum+circuits.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-29&rft_id=info%3Adoi%2F10.1145%2F3434318&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/Hietala0HW021.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/Hietala0HW021.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/Hietala0HW021.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/Hietala0HW021.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/Hietala0HW021.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/Hietala0HW021.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/Hietala0HW021</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=A+verified+optimizer+for+Quantum+circuits."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=A+verified+optimizer+for+Quantum+circuits."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=A+verified+optimizer+for+Quantum+circuits."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=A+verified+optimizer+for+Quantum+circuits."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=A+verified+optimizer+for+Quantum+circuits."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=A+verified+optimizer+for+Quantum+circuits."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434318&text=%22A+verified+optimizer+for+Quantum+circuits.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434318&text=%22A+verified+optimizer+for+Quantum+circuits.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434318&title=%22A+verified+optimizer+for+Quantum+circuits.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434318&title=%22A+verified+optimizer+for+Quantum+circuits.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434318"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434318&title=%22A+verified+optimizer+for+Quantum+circuits.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434318"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/Hietala0HW021</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/203/8410.html" itemprop="url"><span itemprop="name" title="Kesha Hietala">Kesha Hietala</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/55/10359.html" itemprop="url"><span itemprop="name" title="Robert Rand 0001">Robert Rand</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/168/8818.html" itemprop="url"><span itemprop="name" title="Shih-Han Hung">Shih-Han Hung</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/66/8037.html" itemprop="url"><span itemprop="name" title="Xiaodi Wu">Xiaodi Wu</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/h/MichaelWHicks.html" itemprop="url"><span itemprop="name" title="Michael Hicks 0001">Michael Hicks</span></a></span>:<br /> <span class="title" itemprop="name">A verified optimizer for Quantum circuits.</span> <span itemprop="pagination">1-29</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/GutsfeldMO21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434319"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434319" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/GutsfeldMO21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/GutsfeldMO21&rft.au=Jens+Oliver+Gutsfeld&rft.atitle=Automata+and+fixpoints+for+asynchronous+hyperproperties.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-29&rft_id=info%3Adoi%2F10.1145%2F3434319&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/GutsfeldMO21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/GutsfeldMO21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/GutsfeldMO21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/GutsfeldMO21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/GutsfeldMO21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/GutsfeldMO21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/GutsfeldMO21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Automata+and+fixpoints+for+asynchronous+hyperproperties."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Automata+and+fixpoints+for+asynchronous+hyperproperties."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Automata+and+fixpoints+for+asynchronous+hyperproperties."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Automata+and+fixpoints+for+asynchronous+hyperproperties."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Automata+and+fixpoints+for+asynchronous+hyperproperties."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Automata+and+fixpoints+for+asynchronous+hyperproperties."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434319&text=%22Automata+and+fixpoints+for+asynchronous+hyperproperties.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434319&text=%22Automata+and+fixpoints+for+asynchronous+hyperproperties.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434319&title=%22Automata+and+fixpoints+for+asynchronous+hyperproperties.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434319&title=%22Automata+and+fixpoints+for+asynchronous+hyperproperties.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434319"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434319&title=%22Automata+and+fixpoints+for+asynchronous+hyperproperties.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434319"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/GutsfeldMO21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/221/1697.html" itemprop="url"><span itemprop="name" title="Jens Oliver Gutsfeld">Jens Oliver Gutsfeld</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/m/MarkusMullerOhm.html" itemprop="url"><span itemprop="name" title="Markus Müller-Olm">Markus Müller-Olm</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/251/5545.html" itemprop="url"><span itemprop="name" title="Christoph Ohrem">Christoph Ohrem</span></a></span>:<br /> <span class="title" itemprop="name">Automata and fixpoints for asynchronous hyperproperties.</span> <span itemprop="pagination">1-29</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/BatzKKM21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434320"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434320" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/BatzKKM21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/BatzKKM21&rft.au=Kevin+Batz&rft.atitle=Relatively+complete+verification+of+probabilistic+programs%3A+an+expressive+language+for+expectation-based+reasoning.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-30&rft_id=info%3Adoi%2F10.1145%2F3434320&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/BatzKKM21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/BatzKKM21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/BatzKKM21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/BatzKKM21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/BatzKKM21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/BatzKKM21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/BatzKKM21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Relatively+complete+verification+of+probabilistic+programs%3A+an+expressive+language+for+expectation-based+reasoning."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Relatively+complete+verification+of+probabilistic+programs%3A+an+expressive+language+for+expectation-based+reasoning."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Relatively+complete+verification+of+probabilistic+programs%3A+an+expressive+language+for+expectation-based+reasoning."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Relatively+complete+verification+of+probabilistic+programs%3A+an+expressive+language+for+expectation-based+reasoning."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Relatively+complete+verification+of+probabilistic+programs%3A+an+expressive+language+for+expectation-based+reasoning."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Relatively+complete+verification+of+probabilistic+programs%3A+an+expressive+language+for+expectation-based+reasoning."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434320&text=%22Relatively+complete+verification+of+probabilistic+programs%3A+an+expressive+language+for+expectation-based+...%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434320&text=%22Relatively+complete+verification+of+probabilistic+programs%3A+an+expressive+language+for+expectation-based+...%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434320&title=%22Relatively+complete+verification+of+probabilistic+programs%3A+an+expressive+language+for+expectation-based+reasoning.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434320&title=%22Relatively+complete+verification+of+probabilistic+programs%3A+an+expressive+language+for+expectation-based+reasoning.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434320"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434320&title=%22Relatively+complete+verification+of+probabilistic+programs%3A+an+expressive+language+for+expectation-based+reasoning.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434320"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/BatzKKM21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/215/5068.html" itemprop="url"><span itemprop="name" title="Kevin Batz">Kevin Batz</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/39/9937.html" itemprop="url"><span itemprop="name" title="Benjamin Lucien Kaminski">Benjamin Lucien Kaminski</span></a><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0001-5185-2324" /></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/k/JoostPieterKatoen.html" itemprop="url"><span itemprop="name" title="Joost-Pieter Katoen">Joost-Pieter Katoen</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/172/5070.html" itemprop="url"><span itemprop="name" title="Christoph Matheja">Christoph Matheja</span></a></span>:<br /> <span class="title" itemprop="name">Relatively complete verification of probabilistic programs: an expressive language for expectation-based reasoning.</span> <span itemprop="pagination">1-30</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/CourantL21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434321"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434321" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/CourantL21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/CourantL21&rft.au=Nathana%C3%ABl+Courant&rft.atitle=Verified+code+generation+for+the+polyhedral+model.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-24&rft_id=info%3Adoi%2F10.1145%2F3434321&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/CourantL21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/CourantL21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/CourantL21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/CourantL21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/CourantL21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/CourantL21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/CourantL21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Verified+code+generation+for+the+polyhedral+model."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Verified+code+generation+for+the+polyhedral+model."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Verified+code+generation+for+the+polyhedral+model."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Verified+code+generation+for+the+polyhedral+model."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Verified+code+generation+for+the+polyhedral+model."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Verified+code+generation+for+the+polyhedral+model."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434321&text=%22Verified+code+generation+for+the+polyhedral+model.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434321&text=%22Verified+code+generation+for+the+polyhedral+model.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434321&title=%22Verified+code+generation+for+the+polyhedral+model.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434321&title=%22Verified+code+generation+for+the+polyhedral+model.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434321"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434321&title=%22Verified+code+generation+for+the+polyhedral+model.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434321"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/CourantL21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/197/9578.html" itemprop="url"><span itemprop="name" title="Nathanaël Courant">Nathanaël Courant</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/03/352.html" itemprop="url"><span itemprop="name" title="Xavier Leroy">Xavier Leroy</span></a></span>:<br /> <span class="title" itemprop="name">Verified code generation for the polyhedral model.</span> <span itemprop="pagination">1-24</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/DoengesABCNPPSX21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434322"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434322" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/DoengesABCNPPSX21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/DoengesABCNPPSX21&rft.au=Ryan+Doenges&rft.atitle=Petr4%3A+formal+foundations+for+p4+data+planes.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-32&rft_id=info%3Adoi%2F10.1145%2F3434322&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/DoengesABCNPPSX21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/DoengesABCNPPSX21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/DoengesABCNPPSX21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/DoengesABCNPPSX21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/DoengesABCNPPSX21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/DoengesABCNPPSX21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/DoengesABCNPPSX21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Petr4%3A+formal+foundations+for+p4+data+planes."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Petr4%3A+formal+foundations+for+p4+data+planes."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Petr4%3A+formal+foundations+for+p4+data+planes."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Petr4%3A+formal+foundations+for+p4+data+planes."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Petr4%3A+formal+foundations+for+p4+data+planes."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Petr4%3A+formal+foundations+for+p4+data+planes."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434322&text=%22Petr4%3A+formal+foundations+for+p4+data+planes.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434322&text=%22Petr4%3A+formal+foundations+for+p4+data+planes.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434322&title=%22Petr4%3A+formal+foundations+for+p4+data+planes.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434322&title=%22Petr4%3A+formal+foundations+for+p4+data+planes.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434322"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434322&title=%22Petr4%3A+formal+foundations+for+p4+data+planes.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434322"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/DoengesABCNPPSX21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/271/5967.html" itemprop="url"><span itemprop="name" title="Ryan Doenges">Ryan Doenges</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/173/5006.html" itemprop="url"><span itemprop="name" title="Mina Tahmasbi Arashloo">Mina Tahmasbi Arashloo</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/278/2761.html" itemprop="url"><span itemprop="name" title="Santiago Bautista">Santiago Bautista</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/34/5385.html" itemprop="url"><span itemprop="name" title="Alexander Chang">Alexander Chang</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/278/3217.html" itemprop="url"><span itemprop="name" title="Newton Ni">Newton Ni</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/278/2800.html" itemprop="url"><span itemprop="name" title="Samwise Parkinson">Samwise Parkinson</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/278/3052.html" itemprop="url"><span itemprop="name" title="Rudy Peterson">Rudy Peterson</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/278/3188.html" itemprop="url"><span itemprop="name" title="Alaia Solko-Breslin">Alaia Solko-Breslin</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/278/2819.html" itemprop="url"><span itemprop="name" title="Amanda Xu">Amanda Xu</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/15/3253.html" itemprop="url"><span itemprop="name" title="Nate Foster">Nate Foster</span></a></span>:<br /> <span class="title" itemprop="name">Petr4: formal foundations for p4 data planes.</span> <span itemprop="pagination">1-32</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/GondelmanGNTB21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434323"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434323" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/GondelmanGNTB21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/GondelmanGNTB21&rft.au=L%C3%A9on+Gondelman&rft.atitle=Distributed+causal+memory%3A+modular+specification+and+verification+in+higher-order+distributed+separation+logic.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-29&rft_id=info%3Adoi%2F10.1145%2F3434323&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/GondelmanGNTB21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/GondelmanGNTB21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/GondelmanGNTB21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/GondelmanGNTB21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/GondelmanGNTB21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/GondelmanGNTB21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/GondelmanGNTB21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Distributed+causal+memory%3A+modular+specification+and+verification+in+higher-order+distributed+separation+logic."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Distributed+causal+memory%3A+modular+specification+and+verification+in+higher-order+distributed+separation+logic."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Distributed+causal+memory%3A+modular+specification+and+verification+in+higher-order+distributed+separation+logic."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Distributed+causal+memory%3A+modular+specification+and+verification+in+higher-order+distributed+separation+logic."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Distributed+causal+memory%3A+modular+specification+and+verification+in+higher-order+distributed+separation+logic."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Distributed+causal+memory%3A+modular+specification+and+verification+in+higher-order+distributed+separation+logic."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434323&text=%22Distributed+causal+memory%3A+modular+specification+and+verification+in+higher-order+distributed+separation+...%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434323&text=%22Distributed+causal+memory%3A+modular+specification+and+verification+in+higher-order+distributed+separation+...%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434323&title=%22Distributed+causal+memory%3A+modular+specification+and+verification+in+higher-order+distributed+separation+logic.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434323&title=%22Distributed+causal+memory%3A+modular+specification+and+verification+in+higher-order+distributed+separation+logic.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434323"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434323&title=%22Distributed+causal+memory%3A+modular+specification+and+verification+in+higher-order+distributed+separation+logic.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434323"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/GondelmanGNTB21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/147/4364.html" itemprop="url"><span itemprop="name" title="Léon Gondelman">Léon Gondelman</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/263/1059.html" itemprop="url"><span itemprop="name" title="Simon Oddershede Gregersen">Simon Oddershede Gregersen</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/205/2896.html" itemprop="url"><span itemprop="name" title="Abel Nieto">Abel Nieto</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/163/1794.html" itemprop="url"><span itemprop="name" title="Amin Timany">Amin Timany</span></a><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0002-2237-851X" /></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/31/910.html" itemprop="url"><span itemprop="name" title="Lars Birkedal">Lars Birkedal</span></a></span>:<br /> <span class="title" itemprop="name">Distributed causal memory: modular specification and verification in higher-order distributed separation logic.</span> <span itemprop="pagination">1-29</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/Kokologiannakis21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434324"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434324" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/Kokologiannakis21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/Kokologiannakis21&rft.au=Michalis+Kokologiannakis&rft.atitle=PerSeVerE%3A+persistency+semantics+for+verification+under+ext4.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-29&rft_id=info%3Adoi%2F10.1145%2F3434324&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/Kokologiannakis21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/Kokologiannakis21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/Kokologiannakis21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/Kokologiannakis21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/Kokologiannakis21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/Kokologiannakis21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/Kokologiannakis21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=PerSeVerE%3A+persistency+semantics+for+verification+under+ext4."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=PerSeVerE%3A+persistency+semantics+for+verification+under+ext4."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=PerSeVerE%3A+persistency+semantics+for+verification+under+ext4."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=PerSeVerE%3A+persistency+semantics+for+verification+under+ext4."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=PerSeVerE%3A+persistency+semantics+for+verification+under+ext4."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=PerSeVerE%3A+persistency+semantics+for+verification+under+ext4."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434324&text=%22PerSeVerE%3A+persistency+semantics+for+verification+under+ext4.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434324&text=%22PerSeVerE%3A+persistency+semantics+for+verification+under+ext4.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434324&title=%22PerSeVerE%3A+persistency+semantics+for+verification+under+ext4.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434324&title=%22PerSeVerE%3A+persistency+semantics+for+verification+under+ext4.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434324"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434324&title=%22PerSeVerE%3A+persistency+semantics+for+verification+under+ext4.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434324"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/Kokologiannakis21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/204/3706.html" itemprop="url"><span itemprop="name" title="Michalis Kokologiannakis">Michalis Kokologiannakis</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/283/3784.html" itemprop="url"><span itemprop="name" title="Ilya Kaysin">Ilya Kaysin</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/84/9528.html" itemprop="url"><span itemprop="name" title="Azalea Raad">Azalea Raad</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/69/1549.html" itemprop="url"><span itemprop="name" title="Viktor Vafeiadis">Viktor Vafeiadis</span></a></span>:<br /> <span class="title" itemprop="name">PerSeVerE: persistency semantics for verification under ext4.</span> <span itemprop="pagination">1-29</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/BaumannMTZ21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434325"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434325" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/BaumannMTZ21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/BaumannMTZ21&rft.au=Pascal+Baumann&rft.atitle=Context-bounded+verification+of+liveness+properties+for+multithreaded+shared-memory+programs.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-31&rft_id=info%3Adoi%2F10.1145%2F3434325&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/BaumannMTZ21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/BaumannMTZ21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/BaumannMTZ21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/BaumannMTZ21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/BaumannMTZ21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/BaumannMTZ21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/BaumannMTZ21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Context-bounded+verification+of+liveness+properties+for+multithreaded+shared-memory+programs."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Context-bounded+verification+of+liveness+properties+for+multithreaded+shared-memory+programs."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Context-bounded+verification+of+liveness+properties+for+multithreaded+shared-memory+programs."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Context-bounded+verification+of+liveness+properties+for+multithreaded+shared-memory+programs."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Context-bounded+verification+of+liveness+properties+for+multithreaded+shared-memory+programs."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Context-bounded+verification+of+liveness+properties+for+multithreaded+shared-memory+programs."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434325&text=%22Context-bounded+verification+of+liveness+properties+for+multithreaded+shared-memory+programs.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434325&text=%22Context-bounded+verification+of+liveness+properties+for+multithreaded+shared-memory+programs.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434325&title=%22Context-bounded+verification+of+liveness+properties+for+multithreaded+shared-memory+programs.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434325&title=%22Context-bounded+verification+of+liveness+properties+for+multithreaded+shared-memory+programs.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434325"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434325&title=%22Context-bounded+verification+of+liveness+properties+for+multithreaded+shared-memory+programs.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434325"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/BaumannMTZ21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/30/11196.html" itemprop="url"><span itemprop="name" title="Pascal Baumann">Pascal Baumann</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/71/1981.html" itemprop="url"><span itemprop="name" title="Rupak Majumdar">Rupak Majumdar</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/172/7662.html" itemprop="url"><span itemprop="name" title="Ramanathan S. Thinniyam">Ramanathan S. Thinniyam</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/24/651.html" itemprop="url"><span itemprop="name" title="Georg Zetzsche">Georg Zetzsche</span></a></span>:<br /> <span class="title" itemprop="name">Context-bounded verification of liveness properties for multithreaded shared-memory programs.</span> <span itemprop="pagination">1-31</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/ReynaudSY21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434326"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434326" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/ReynaudSY21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/ReynaudSY21&rft.au=Alban+Reynaud&rft.atitle=A+practical+mode+system+for+recursive+definitions.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-29&rft_id=info%3Adoi%2F10.1145%2F3434326&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/ReynaudSY21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/ReynaudSY21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/ReynaudSY21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/ReynaudSY21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/ReynaudSY21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/ReynaudSY21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/ReynaudSY21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=A+practical+mode+system+for+recursive+definitions."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=A+practical+mode+system+for+recursive+definitions."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=A+practical+mode+system+for+recursive+definitions."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=A+practical+mode+system+for+recursive+definitions."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=A+practical+mode+system+for+recursive+definitions."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=A+practical+mode+system+for+recursive+definitions."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434326&text=%22A+practical+mode+system+for+recursive+definitions.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434326&text=%22A+practical+mode+system+for+recursive+definitions.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434326&title=%22A+practical+mode+system+for+recursive+definitions.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434326&title=%22A+practical+mode+system+for+recursive+definitions.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434326"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434326&title=%22A+practical+mode+system+for+recursive+definitions.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434326"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/ReynaudSY21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/230/4477.html" itemprop="url"><span itemprop="name" title="Alban Reynaud">Alban Reynaud</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/31/11144.html" itemprop="url"><span itemprop="name" title="Gabriel Scherer">Gabriel Scherer</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/35/6244.html" itemprop="url"><span itemprop="name" title="Jeremy Yallop">Jeremy Yallop</span></a></span>:<br /> <span class="title" itemprop="name">A practical mode system for recursive definitions.</span> <span itemprop="pagination">1-29</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/BarriereBFPV21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434327"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434327" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/BarriereBFPV21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/BarriereBFPV21&rft.au=Aur%C3%A8le+Barri%C3%A8re&rft.atitle=Formally+verified+speculation+and+deoptimization+in+a+JIT+compiler.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-26&rft_id=info%3Adoi%2F10.1145%2F3434327&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/BarriereBFPV21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/BarriereBFPV21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/BarriereBFPV21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/BarriereBFPV21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/BarriereBFPV21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/BarriereBFPV21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/BarriereBFPV21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Formally+verified+speculation+and+deoptimization+in+a+JIT+compiler."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Formally+verified+speculation+and+deoptimization+in+a+JIT+compiler."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Formally+verified+speculation+and+deoptimization+in+a+JIT+compiler."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Formally+verified+speculation+and+deoptimization+in+a+JIT+compiler."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Formally+verified+speculation+and+deoptimization+in+a+JIT+compiler."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Formally+verified+speculation+and+deoptimization+in+a+JIT+compiler."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434327&text=%22Formally+verified+speculation+and+deoptimization+in+a+JIT+compiler.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434327&text=%22Formally+verified+speculation+and+deoptimization+in+a+JIT+compiler.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434327&title=%22Formally+verified+speculation+and+deoptimization+in+a+JIT+compiler.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434327&title=%22Formally+verified+speculation+and+deoptimization+in+a+JIT+compiler.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434327"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434327&title=%22Formally+verified+speculation+and+deoptimization+in+a+JIT+compiler.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434327"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/BarriereBFPV21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/220/4291.html" itemprop="url"><span itemprop="name" title="Aurèle Barrière">Aurèle Barrière</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/b/SandrineBlazy.html" itemprop="url"><span itemprop="name" title="Sandrine Blazy">Sandrine Blazy</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/209/9785.html" itemprop="url"><span itemprop="name" title="Olivier Flückiger">Olivier Flückiger</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/37/6728.html" itemprop="url"><span itemprop="name" title="David Pichardie">David Pichardie</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/v/JanVitek.html" itemprop="url"><span itemprop="name" title="Jan Vitek">Jan Vitek</span></a></span>:<br /> <span class="title" itemprop="name">Formally verified speculation and deoptimization in a JIT compiler.</span> <span itemprop="pagination">1-26</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/KhyzhaL21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434328"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434328" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/KhyzhaL21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/KhyzhaL21&rft.au=Artem+Khyzha&rft.atitle=Taming+x86-TSO+persistency.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-29&rft_id=info%3Adoi%2F10.1145%2F3434328&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/KhyzhaL21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/KhyzhaL21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/KhyzhaL21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/KhyzhaL21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/KhyzhaL21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/KhyzhaL21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/KhyzhaL21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Taming+x86-TSO+persistency."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Taming+x86-TSO+persistency."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Taming+x86-TSO+persistency."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Taming+x86-TSO+persistency."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Taming+x86-TSO+persistency."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Taming+x86-TSO+persistency."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434328&text=%22Taming+x86-TSO+persistency.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434328&text=%22Taming+x86-TSO+persistency.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434328&title=%22Taming+x86-TSO+persistency.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434328&title=%22Taming+x86-TSO+persistency.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434328"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434328&title=%22Taming+x86-TSO+persistency.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434328"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/KhyzhaL21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/123/9997.html" itemprop="url"><span itemprop="name" title="Artem Khyzha">Artem Khyzha</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/84/7458.html" itemprop="url"><span itemprop="name" title="Ori Lahav">Ori Lahav</span></a></span>:<br /> <span class="title" itemprop="name">Taming x86-TSO persistency.</span> <span itemprop="pagination">1-29</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/AlmagorKKO021" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434329"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434329" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/AlmagorKKO021.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/AlmagorKKO021&rft.au=Shaull+Almagor&rft.atitle=Deciding+%CF%89-regular+properties+on+linear+recurrence+sequences.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-24&rft_id=info%3Adoi%2F10.1145%2F3434329&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/AlmagorKKO021.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/AlmagorKKO021.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/AlmagorKKO021.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/AlmagorKKO021.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/AlmagorKKO021.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/AlmagorKKO021.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/AlmagorKKO021</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Deciding+%CF%89-regular+properties+on+linear+recurrence+sequences."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Deciding+%CF%89-regular+properties+on+linear+recurrence+sequences."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Deciding+%CF%89-regular+properties+on+linear+recurrence+sequences."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Deciding+%CF%89-regular+properties+on+linear+recurrence+sequences."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Deciding+%CF%89-regular+properties+on+linear+recurrence+sequences."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Deciding+%CF%89-regular+properties+on+linear+recurrence+sequences."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434329&text=%22Deciding+%CF%89-regular+properties+on+linear+recurrence+sequences.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434329&text=%22Deciding+%CF%89-regular+properties+on+linear+recurrence+sequences.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434329&title=%22Deciding+%CF%89-regular+properties+on+linear+recurrence+sequences.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434329&title=%22Deciding+%CF%89-regular+properties+on+linear+recurrence+sequences.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434329"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434329&title=%22Deciding+%CF%89-regular+properties+on+linear+recurrence+sequences.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434329"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/AlmagorKKO021</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/88/8556.html" itemprop="url"><span itemprop="name" title="Shaull Almagor">Shaull Almagor</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/270/0008.html" itemprop="url"><span itemprop="name" title="Toghrul Karimov">Toghrul Karimov</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/140/7385.html" itemprop="url"><span itemprop="name" title="Edon Kelmendi">Edon Kelmendi</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/55/4663.html" itemprop="url"><span itemprop="name" title="Joël Ouaknine">Joël Ouaknine</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/90/2367.html" itemprop="url"><span itemprop="name" title="James Worrell 0001">James Worrell</span></a></span>:<br /> <span class="title" itemprop="name">Deciding ω-regular properties on linear recurrence sequences.</span> <span itemprop="pagination">1-24</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/VassenaDGCKJTS21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434330"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434330" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/VassenaDGCKJTS21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/VassenaDGCKJTS21&rft.au=Marco+Vassena&rft.atitle=Automatically+eliminating+speculative+leaks+from+cryptographic+code+with+blade.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-30&rft_id=info%3Adoi%2F10.1145%2F3434330&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/VassenaDGCKJTS21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/VassenaDGCKJTS21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/VassenaDGCKJTS21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/VassenaDGCKJTS21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/VassenaDGCKJTS21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/VassenaDGCKJTS21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/VassenaDGCKJTS21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Automatically+eliminating+speculative+leaks+from+cryptographic+code+with+blade."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Automatically+eliminating+speculative+leaks+from+cryptographic+code+with+blade."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Automatically+eliminating+speculative+leaks+from+cryptographic+code+with+blade."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Automatically+eliminating+speculative+leaks+from+cryptographic+code+with+blade."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Automatically+eliminating+speculative+leaks+from+cryptographic+code+with+blade."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Automatically+eliminating+speculative+leaks+from+cryptographic+code+with+blade."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434330&text=%22Automatically+eliminating+speculative+leaks+from+cryptographic+code+with+blade.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434330&text=%22Automatically+eliminating+speculative+leaks+from+cryptographic+code+with+blade.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434330&title=%22Automatically+eliminating+speculative+leaks+from+cryptographic+code+with+blade.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434330&title=%22Automatically+eliminating+speculative+leaks+from+cryptographic+code+with+blade.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434330"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434330&title=%22Automatically+eliminating+speculative+leaks+from+cryptographic+code+with+blade.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434330"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/VassenaDGCKJTS21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/185/6272.html" itemprop="url"><span itemprop="name" title="Marco Vassena">Marco Vassena</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/199/4885.html" itemprop="url"><span itemprop="name" title="Craig Disselkoen">Craig Disselkoen</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/86/10265.html" itemprop="url"><span itemprop="name" title="Klaus von Gleissenthall">Klaus von Gleissenthall</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/208/7309.html" itemprop="url"><span itemprop="name" title="Sunjay Cauligi">Sunjay Cauligi</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/182/4711.html" itemprop="url"><span itemprop="name" title="Rami Gökhan Kici">Rami Gökhan Kici</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/47/4244.html" itemprop="url"><span itemprop="name" title="Ranjit Jhala">Ranjit Jhala</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/t/DeanMTullsen.html" itemprop="url"><span itemprop="name" title="Dean M. Tullsen">Dean M. Tullsen</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/91/6118.html" itemprop="url"><span itemprop="name" title="Deian Stefan">Deian Stefan</span></a></span>:<br /> <span class="title" itemprop="name">Automatically eliminating speculative leaks from cryptographic code with blade.</span> <span itemprop="pagination">1-30</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/ChoudhuryEEW21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434331"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434331" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/ChoudhuryEEW21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/ChoudhuryEEW21&rft.au=Pritam+Choudhury&rft.atitle=A+graded+dependent+type+system+with+a+usage-aware+semantics.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-32&rft_id=info%3Adoi%2F10.1145%2F3434331&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/ChoudhuryEEW21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/ChoudhuryEEW21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/ChoudhuryEEW21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/ChoudhuryEEW21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/ChoudhuryEEW21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/ChoudhuryEEW21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/ChoudhuryEEW21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=A+graded+dependent+type+system+with+a+usage-aware+semantics."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=A+graded+dependent+type+system+with+a+usage-aware+semantics."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=A+graded+dependent+type+system+with+a+usage-aware+semantics."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=A+graded+dependent+type+system+with+a+usage-aware+semantics."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=A+graded+dependent+type+system+with+a+usage-aware+semantics."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=A+graded+dependent+type+system+with+a+usage-aware+semantics."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434331&text=%22A+graded+dependent+type+system+with+a+usage-aware+semantics.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434331&text=%22A+graded+dependent+type+system+with+a+usage-aware+semantics.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434331&title=%22A+graded+dependent+type+system+with+a+usage-aware+semantics.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434331&title=%22A+graded+dependent+type+system+with+a+usage-aware+semantics.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434331"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434331&title=%22A+graded+dependent+type+system+with+a+usage-aware+semantics.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434331"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/ChoudhuryEEW21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/241/9426.html" itemprop="url"><span itemprop="name" title="Pritam Choudhury">Pritam Choudhury</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/25/10814.html" itemprop="url"><span itemprop="name" title="Harley Eades III">Harley Eades III</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/119/7138.html" itemprop="url"><span itemprop="name" title="Richard A. Eisenberg">Richard A. Eisenberg</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/w/StephanieWeirich.html" itemprop="url"><span itemprop="name" title="Stephanie Weirich">Stephanie Weirich</span></a></span>:<br /> <span class="title" itemprop="name">A graded dependent type system with a usage-aware semantics.</span> <span itemprop="pagination">1-32</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/AccattoliLV21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434332"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434332" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/AccattoliLV21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/AccattoliLV21&rft.au=Beniamino+Accattoli&rft.atitle=The+%28In%29Efficiency+of+interaction.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-33&rft_id=info%3Adoi%2F10.1145%2F3434332&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/AccattoliLV21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/AccattoliLV21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/AccattoliLV21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/AccattoliLV21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/AccattoliLV21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/AccattoliLV21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/AccattoliLV21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=The+%28In%29Efficiency+of+interaction."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=The+%28In%29Efficiency+of+interaction."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=The+%28In%29Efficiency+of+interaction."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=The+%28In%29Efficiency+of+interaction."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=The+%28In%29Efficiency+of+interaction."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=The+%28In%29Efficiency+of+interaction."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434332&text=%22The+%28In%29Efficiency+of+interaction.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434332&text=%22The+%28In%29Efficiency+of+interaction.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434332&title=%22The+%28In%29Efficiency+of+interaction.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434332&title=%22The+%28In%29Efficiency+of+interaction.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434332"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434332&title=%22The+%28In%29Efficiency+of+interaction.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434332"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/AccattoliLV21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/90/7361.html" itemprop="url"><span itemprop="name" title="Beniamino Accattoli">Beniamino Accattoli</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/44/3105.html" itemprop="url"><span itemprop="name" title="Ugo Dal Lago">Ugo Dal Lago</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/220/3433.html" itemprop="url"><span itemprop="name" title="Gabriele Vanoni">Gabriele Vanoni</span></a></span>:<br /> <span class="title" itemprop="name">The (In)Efficiency of interaction.</span> <span itemprop="pagination">1-33</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/0001BHKKM21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434333"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434333" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/0001BHKKM21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/0001BHKKM21&rft.au=Alejandro+Aguirre&rft.atitle=A+pre-expectation+calculus+for+probabilistic+sensitivity.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-28&rft_id=info%3Adoi%2F10.1145%2F3434333&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/0001BHKKM21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/0001BHKKM21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/0001BHKKM21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/0001BHKKM21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/0001BHKKM21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/0001BHKKM21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/0001BHKKM21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=A+pre-expectation+calculus+for+probabilistic+sensitivity."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=A+pre-expectation+calculus+for+probabilistic+sensitivity."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=A+pre-expectation+calculus+for+probabilistic+sensitivity."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=A+pre-expectation+calculus+for+probabilistic+sensitivity."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=A+pre-expectation+calculus+for+probabilistic+sensitivity."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=A+pre-expectation+calculus+for+probabilistic+sensitivity."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434333&text=%22A+pre-expectation+calculus+for+probabilistic+sensitivity.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434333&text=%22A+pre-expectation+calculus+for+probabilistic+sensitivity.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434333&title=%22A+pre-expectation+calculus+for+probabilistic+sensitivity.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434333&title=%22A+pre-expectation+calculus+for+probabilistic+sensitivity.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434333"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434333&title=%22A+pre-expectation+calculus+for+probabilistic+sensitivity.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434333"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/0001BHKKM21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/99/3218.html" itemprop="url"><span itemprop="name" title="Alejandro Aguirre 0001">Alejandro Aguirre</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/b/GBarthe.html" itemprop="url"><span itemprop="name" title="Gilles Barthe">Gilles Barthe</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/35/10964.html" itemprop="url"><span itemprop="name" title="Justin Hsu">Justin Hsu</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/39/9937.html" itemprop="url"><span itemprop="name" title="Benjamin Lucien Kaminski">Benjamin Lucien Kaminski</span></a><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0001-5185-2324" /></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/k/JoostPieterKatoen.html" itemprop="url"><span itemprop="name" title="Joost-Pieter Katoen">Joost-Pieter Katoen</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/172/5070.html" itemprop="url"><span itemprop="name" title="Christoph Matheja">Christoph Matheja</span></a></span>:<br /> <span class="title" itemprop="name">A pre-expectation calculus for probabilistic sensitivity.</span> <span itemprop="pagination">1-28</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/MoyNTH21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434334"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434334" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/MoyNTH21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/MoyNTH21&rft.au=Cameron+Moy&rft.atitle=Corpse+reviver%3A+sound+and+efficient+gradual+typing+via+contract+verification.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-28&rft_id=info%3Adoi%2F10.1145%2F3434334&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/MoyNTH21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/MoyNTH21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/MoyNTH21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/MoyNTH21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/MoyNTH21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/MoyNTH21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/MoyNTH21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Corpse+reviver%3A+sound+and+efficient+gradual+typing+via+contract+verification."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Corpse+reviver%3A+sound+and+efficient+gradual+typing+via+contract+verification."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Corpse+reviver%3A+sound+and+efficient+gradual+typing+via+contract+verification."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Corpse+reviver%3A+sound+and+efficient+gradual+typing+via+contract+verification."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Corpse+reviver%3A+sound+and+efficient+gradual+typing+via+contract+verification."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Corpse+reviver%3A+sound+and+efficient+gradual+typing+via+contract+verification."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434334&text=%22Corpse+reviver%3A+sound+and+efficient+gradual+typing+via+contract+verification.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434334&text=%22Corpse+reviver%3A+sound+and+efficient+gradual+typing+via+contract+verification.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434334&title=%22Corpse+reviver%3A+sound+and+efficient+gradual+typing+via+contract+verification.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434334&title=%22Corpse+reviver%3A+sound+and+efficient+gradual+typing+via+contract+verification.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434334"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434334&title=%22Corpse+reviver%3A+sound+and+efficient+gradual+typing+via+contract+verification.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434334"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/MoyNTH21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/271/0905.html" itemprop="url"><span itemprop="name" title="Cameron Moy">Cameron Moy</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/132/9068.html" itemprop="url"><span itemprop="name" title="Phuc C. Nguyen">Phuc C. Nguyen</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/56/3287.html" itemprop="url"><span itemprop="name" title="Sam Tobin-Hochstadt">Sam Tobin-Hochstadt</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/77/2466.html" itemprop="url"><span itemprop="name" title="David Van Horn">David Van Horn</span></a></span>:<br /> <span class="title" itemprop="name">Corpse reviver: sound and efficient gradual typing via contract verification.</span> <span itemprop="pagination">1-28</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/Lee21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434335"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434335" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/Lee21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/Lee21&rft.au=Woosuk+Lee&rft.atitle=Combining+the+top-down+propagation+and+bottom-up+enumeration+for+inductive+program+synthesis.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-28&rft_id=info%3Adoi%2F10.1145%2F3434335&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/Lee21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/Lee21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/Lee21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/Lee21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/Lee21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/Lee21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/Lee21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Combining+the+top-down+propagation+and+bottom-up+enumeration+for+inductive+program+synthesis."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Combining+the+top-down+propagation+and+bottom-up+enumeration+for+inductive+program+synthesis."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Combining+the+top-down+propagation+and+bottom-up+enumeration+for+inductive+program+synthesis."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Combining+the+top-down+propagation+and+bottom-up+enumeration+for+inductive+program+synthesis."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Combining+the+top-down+propagation+and+bottom-up+enumeration+for+inductive+program+synthesis."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Combining+the+top-down+propagation+and+bottom-up+enumeration+for+inductive+program+synthesis."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434335&text=%22Combining+the+top-down+propagation+and+bottom-up+enumeration+for+inductive+program+synthesis.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434335&text=%22Combining+the+top-down+propagation+and+bottom-up+enumeration+for+inductive+program+synthesis.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434335&title=%22Combining+the+top-down+propagation+and+bottom-up+enumeration+for+inductive+program+synthesis.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434335&title=%22Combining+the+top-down+propagation+and+bottom-up+enumeration+for+inductive+program+synthesis.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434335"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434335&title=%22Combining+the+top-down+propagation+and+bottom-up+enumeration+for+inductive+program+synthesis.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434335"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/Lee21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/57/2881.html" itemprop="url"><span itemprop="name" title="Woosuk Lee">Woosuk Lee</span></a></span>:<br /> <span class="title" itemprop="name">Combining the top-down propagation and bottom-up enumeration for inductive program synthesis.</span> <span itemprop="pagination">1-28</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/JonesR21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434336"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434336" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/JonesR21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/JonesR21&rft.au=Eddie+Jones&rft.atitle=Intensional+datatype+refinement%3A+with+application+to+scalable+verification+of+pattern-match+safety.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-29&rft_id=info%3Adoi%2F10.1145%2F3434336&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/JonesR21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/JonesR21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/JonesR21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/JonesR21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/JonesR21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/JonesR21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/JonesR21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Intensional+datatype+refinement%3A+with+application+to+scalable+verification+of+pattern-match+safety."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Intensional+datatype+refinement%3A+with+application+to+scalable+verification+of+pattern-match+safety."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Intensional+datatype+refinement%3A+with+application+to+scalable+verification+of+pattern-match+safety."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Intensional+datatype+refinement%3A+with+application+to+scalable+verification+of+pattern-match+safety."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Intensional+datatype+refinement%3A+with+application+to+scalable+verification+of+pattern-match+safety."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Intensional+datatype+refinement%3A+with+application+to+scalable+verification+of+pattern-match+safety."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434336&text=%22Intensional+datatype+refinement%3A+with+application+to+scalable+verification+of+pattern-match+safety.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434336&text=%22Intensional+datatype+refinement%3A+with+application+to+scalable+verification+of+pattern-match+safety.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434336&title=%22Intensional+datatype+refinement%3A+with+application+to+scalable+verification+of+pattern-match+safety.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434336&title=%22Intensional+datatype+refinement%3A+with+application+to+scalable+verification+of+pattern-match+safety.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434336"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434336&title=%22Intensional+datatype+refinement%3A+with+application+to+scalable+verification+of+pattern-match+safety.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434336"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/JonesR21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/188/6104.html" itemprop="url"><span itemprop="name" title="Eddie Jones">Eddie Jones</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/16/9032.html" itemprop="url"><span itemprop="name" title="Steven J. Ramsay">Steven J. Ramsay</span></a></span>:<br /> <span class="title" itemprop="name">Intensional datatype refinement: with application to scalable verification of pattern-match safety.</span> <span itemprop="pagination">1-29</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/AbdullaABKS21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434337"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434337" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/AbdullaABKS21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/AbdullaABKS21&rft.au=Parosh+Aziz+Abdulla&rft.atitle=Deciding+reachability+under+persistent+x86-TSO.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-32&rft_id=info%3Adoi%2F10.1145%2F3434337&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/AbdullaABKS21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/AbdullaABKS21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/AbdullaABKS21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/AbdullaABKS21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/AbdullaABKS21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/AbdullaABKS21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/AbdullaABKS21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Deciding+reachability+under+persistent+x86-TSO."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Deciding+reachability+under+persistent+x86-TSO."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Deciding+reachability+under+persistent+x86-TSO."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Deciding+reachability+under+persistent+x86-TSO."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Deciding+reachability+under+persistent+x86-TSO."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Deciding+reachability+under+persistent+x86-TSO."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434337&text=%22Deciding+reachability+under+persistent+x86-TSO.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434337&text=%22Deciding+reachability+under+persistent+x86-TSO.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434337&title=%22Deciding+reachability+under+persistent+x86-TSO.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434337&title=%22Deciding+reachability+under+persistent+x86-TSO.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434337"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434337&title=%22Deciding+reachability+under+persistent+x86-TSO.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434337"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/AbdullaABKS21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/a/PAAbdulla.html" itemprop="url"><span itemprop="name" title="Parosh Aziz Abdulla">Parosh Aziz Abdulla</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/42/4028.html" itemprop="url"><span itemprop="name" title="Mohamed Faouzi Atig">Mohamed Faouzi Atig</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/b/AhmedBouajjani.html" itemprop="url"><span itemprop="name" title="Ahmed Bouajjani">Ahmed Bouajjani</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/54/203.html" itemprop="url"><span itemprop="name" title="K. Narayan Kumar">K. Narayan Kumar</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/62/11469.html" itemprop="url"><span itemprop="name" title="Prakash Saivasan">Prakash Saivasan</span></a></span>:<br /> <span class="title" itemprop="name">Deciding reachability under persistent x86-TSO.</span> <span itemprop="pagination">1-32</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/LibertiLN021" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434338"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434338" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/LibertiLN021.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/LibertiLN021&rft.au=Ivan+Di+Liberti&rft.atitle=Functorial+semantics+for+partial+theories.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-28&rft_id=info%3Adoi%2F10.1145%2F3434338&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/LibertiLN021.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/LibertiLN021.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/LibertiLN021.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/LibertiLN021.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/LibertiLN021.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/LibertiLN021.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/LibertiLN021</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Functorial+semantics+for+partial+theories."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Functorial+semantics+for+partial+theories."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Functorial+semantics+for+partial+theories."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Functorial+semantics+for+partial+theories."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Functorial+semantics+for+partial+theories."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Functorial+semantics+for+partial+theories."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434338&text=%22Functorial+semantics+for+partial+theories.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434338&text=%22Functorial+semantics+for+partial+theories.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434338&title=%22Functorial+semantics+for+partial+theories.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434338&title=%22Functorial+semantics+for+partial+theories.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434338"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434338&title=%22Functorial+semantics+for+partial+theories.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434338"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/LibertiLN021</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/251/7125.html" itemprop="url"><span itemprop="name" title="Ivan Di Liberti">Ivan Di Liberti</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/177/4864.html" itemprop="url"><span itemprop="name" title="Fosco Loregiàn">Fosco Loregiàn</span></a><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0003-3052-465X" /></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/251/2936.html" itemprop="url"><span itemprop="name" title="Chad Nester">Chad Nester</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/46/609.html" itemprop="url"><span itemprop="name" title="Pawel Sobocinski 0001">Pawel Sobocinski</span></a></span>:<br /> <span class="title" itemprop="name">Functorial semantics for partial theories.</span> <span itemprop="pagination">1-28</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/Jacobs21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434339"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434339" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/Jacobs21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/Jacobs21&rft.au=Jules+Jacobs&rft.atitle=Paradoxes+of+probabilistic+programming%3A+and+how+to+condition+on+events+of+measure+zero+with+infinitesimal+probabilities.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-26&rft_id=info%3Adoi%2F10.1145%2F3434339&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/Jacobs21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/Jacobs21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/Jacobs21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/Jacobs21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/Jacobs21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/Jacobs21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/Jacobs21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Paradoxes+of+probabilistic+programming%3A+and+how+to+condition+on+events+of+measure+zero+with+infinitesimal+probabilities."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Paradoxes+of+probabilistic+programming%3A+and+how+to+condition+on+events+of+measure+zero+with+infinitesimal+probabilities."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Paradoxes+of+probabilistic+programming%3A+and+how+to+condition+on+events+of+measure+zero+with+infinitesimal+probabilities."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Paradoxes+of+probabilistic+programming%3A+and+how+to+condition+on+events+of+measure+zero+with+infinitesimal+probabilities."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Paradoxes+of+probabilistic+programming%3A+and+how+to+condition+on+events+of+measure+zero+with+infinitesimal+probabilities."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Paradoxes+of+probabilistic+programming%3A+and+how+to+condition+on+events+of+measure+zero+with+infinitesimal+probabilities."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434339&text=%22Paradoxes+of+probabilistic+programming%3A+and+how+to+condition+on+events+of+measure+zero+with+...%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434339&text=%22Paradoxes+of+probabilistic+programming%3A+and+how+to+condition+on+events+of+measure+zero+with+...%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434339&title=%22Paradoxes+of+probabilistic+programming%3A+and+how+to+condition+on+events+of+measure+zero+with+infinitesimal+probabilities.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434339&title=%22Paradoxes+of+probabilistic+programming%3A+and+how+to+condition+on+events+of+measure+zero+with+infinitesimal+probabilities.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434339"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434339&title=%22Paradoxes+of+probabilistic+programming%3A+and+how+to+condition+on+events+of+measure+zero+with+infinitesimal+probabilities.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434339"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/Jacobs21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/283/3420.html" itemprop="url"><span itemprop="name" title="Jules Jacobs">Jules Jacobs</span></a></span>:<br /> <span class="title" itemprop="name">Paradoxes of probabilistic programming: and how to condition on events of measure zero with infinitesimal probabilities.</span> <span itemprop="pagination">1-26</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/LiZR21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434340"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434340" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/LiZR21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/LiZR21&rft.au=Yuanbo+Li&rft.atitle=On+the+complexity+of+bidirected+interleaved+Dyck-reachability.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-28&rft_id=info%3Adoi%2F10.1145%2F3434340&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/LiZR21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/LiZR21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/LiZR21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/LiZR21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/LiZR21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/LiZR21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/LiZR21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=On+the+complexity+of+bidirected+interleaved+Dyck-reachability."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=On+the+complexity+of+bidirected+interleaved+Dyck-reachability."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=On+the+complexity+of+bidirected+interleaved+Dyck-reachability."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=On+the+complexity+of+bidirected+interleaved+Dyck-reachability."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=On+the+complexity+of+bidirected+interleaved+Dyck-reachability."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=On+the+complexity+of+bidirected+interleaved+Dyck-reachability."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434340&text=%22On+the+complexity+of+bidirected+interleaved+Dyck-reachability.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434340&text=%22On+the+complexity+of+bidirected+interleaved+Dyck-reachability.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434340&title=%22On+the+complexity+of+bidirected+interleaved+Dyck-reachability.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434340&title=%22On+the+complexity+of+bidirected+interleaved+Dyck-reachability.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434340"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434340&title=%22On+the+complexity+of+bidirected+interleaved+Dyck-reachability.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434340"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/LiZR21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/198/2381.html" itemprop="url"><span itemprop="name" title="Yuanbo Li">Yuanbo Li</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/18/8523.html" itemprop="url"><span itemprop="name" title="Qirun Zhang">Qirun Zhang</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/r/TWReps.html" itemprop="url"><span itemprop="name" title="Thomas W. Reps">Thomas W. Reps</span></a></span>:<br /> <span class="title" itemprop="name">On the complexity of bidirected interleaved Dyck-reachability.</span> <span itemprop="pagination">1-28</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/CockxTW21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434341"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434341" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/CockxTW21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/CockxTW21&rft.au=Jesper+Cockx&rft.atitle=The+taming+of+the+rew%3A+a+type+theory+with+computational+assumptions.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-29&rft_id=info%3Adoi%2F10.1145%2F3434341&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/CockxTW21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/CockxTW21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/CockxTW21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/CockxTW21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/CockxTW21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/CockxTW21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/CockxTW21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=The+taming+of+the+rew%3A+a+type+theory+with+computational+assumptions."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=The+taming+of+the+rew%3A+a+type+theory+with+computational+assumptions."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=The+taming+of+the+rew%3A+a+type+theory+with+computational+assumptions."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=The+taming+of+the+rew%3A+a+type+theory+with+computational+assumptions."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=The+taming+of+the+rew%3A+a+type+theory+with+computational+assumptions."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=The+taming+of+the+rew%3A+a+type+theory+with+computational+assumptions."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434341&text=%22The+taming+of+the+rew%3A+a+type+theory+with+computational+assumptions.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434341&text=%22The+taming+of+the+rew%3A+a+type+theory+with+computational+assumptions.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434341&title=%22The+taming+of+the+rew%3A+a+type+theory+with+computational+assumptions.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434341&title=%22The+taming+of+the+rew%3A+a+type+theory+with+computational+assumptions.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434341"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434341&title=%22The+taming+of+the+rew%3A+a+type+theory+with+computational+assumptions.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434341"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/CockxTW21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/143/2636.html" itemprop="url"><span itemprop="name" title="Jesper Cockx">Jesper Cockx</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/56/3285.html" itemprop="url"><span itemprop="name" title="Nicolas Tabareau">Nicolas Tabareau</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/162/8955.html" itemprop="url"><span itemprop="name" title="Théo Winterhalter">Théo Winterhalter</span></a></span>:<br /> <span class="title" itemprop="name">The taming of the rew: a type theory with computational assumptions.</span> <span itemprop="pagination">1-29</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li><li class="entry article" id="journals/pacmpl/SchwerterCJG21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema-2020-07-01#Publication" /><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png" /></div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/3434342"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image" /></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/3434342" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon" />electronic edition via DOI (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/pacmpl/SchwerterCJG21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon" />references & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/pacmpl/SchwerterCJG21&rft.au=Felipe+Ba%C3%B1ados+Schwerter&rft.atitle=Abstracting+gradual+typing+moving+forward%3A+precise+and+space-efficient.&rft.jtitle=Proc.+ACM+Program.+Lang.&rft.volume=5&rft.issue=POPL&rft.date=2021&rft.pages=1-28&rft_id=info%3Adoi%2F10.1145%2F3434342&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/rec/journals/pacmpl/SchwerterCJG21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>export record</b></p><ul><li><a href="https://dblp.org/rec/journals/pacmpl/SchwerterCJG21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon" />BibTeX</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/SchwerterCJG21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon" />RIS</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/SchwerterCJG21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF N-Triples</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/SchwerterCJG21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon" />RDF/XML</a></li><li><a href="https://dblp.org/rec/journals/pacmpl/SchwerterCJG21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon" />XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/pacmpl/SchwerterCJG21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Abstracting+gradual+typing+moving+forward%3A+precise+and+space-efficient."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Abstracting+gradual+typing+moving+forward%3A+precise+and+space-efficient."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon" />Google</a></li><li><a href="https://scholar.google.com/scholar?q=Abstracting+gradual+typing+moving+forward%3A+precise+and+space-efficient."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon" />Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Abstracting+gradual+typing+moving+forward%3A+precise+and+space-efficient."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon" />Semantic Scholar</a></li><li><a href="https://academic.microsoft.com/search?q=Abstracting+gradual+typing+moving+forward%3A+precise+and+space-efficient."><img alt="" src="https://dblp.org/img/ms-academic.dark.16x16.png" class="icon" />MS Academic</a></li><li><a href="https://citeseerx.ist.psu.edu/search?q=Abstracting+gradual+typing+moving+forward%3A+precise+and+space-efficient."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon" />CiteSeerX</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434342&text=%22Abstracting+gradual+typing+moving+forward%3A+precise+and+space-efficient.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon" /></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434342&text=%22Abstracting+gradual+typing+moving+forward%3A+precise+and+space-efficient.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon" />Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434342&title=%22Abstracting+gradual+typing+moving+forward%3A+precise+and+space-efficient.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon" />Reddit</a></li><li><a href="https://www.mendeley.com/import/?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434342&title=%22Abstracting+gradual+typing+moving+forward%3A+precise+and+space-efficient.%22"><img alt="" src="https://dblp.org/img/mendeley.dark.16x16.png" class="icon" />Mendeley</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434342"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon" />BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F3434342&title=%22Abstracting+gradual+typing+moving+forward%3A+precise+and+space-efficient.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon" />LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F3434342"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon" />Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li class="select-on-click"><small>https://dblp.org/rec/journals/pacmpl/SchwerterCJG21</small></li></ul></div></li></ul></nav><cite class="data" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/30/10759.html" itemprop="url"><span itemprop="name" title="Felipe Bañados Schwerter">Felipe Bañados Schwerter</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/173/9502.html" itemprop="url"><span itemprop="name" title="Alison M. Clark">Alison M. Clark</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/190/7678.html" itemprop="url"><span itemprop="name" title="Khurram A. Jafery">Khurram A. Jafery</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/21/1406.html" itemprop="url"><span itemprop="name" title="Ronald Garcia">Ronald Garcia</span></a></span>:<br /> <span class="title" itemprop="name">Abstracting gradual typing moving forward: precise and space-efficient.</span> <span itemprop="pagination">1-28</span><meta itemprop="datePublished" content="2021" /></cite><meta property="genre" content="computer science" /></li></ul><!-- top container --><div id="top"><div class="credit"><div><a href="https://www.dagstuhl.de/en/"><img src="https://dblp.org/img/lzi-logo-small.180x30.png" alt="a service of Schloss Dagstuhl - Leibniz Center for Informatics" title="a service of Schloss Dagstuhl - Leibniz Center for Informatics" /></a></div></div><nav class="top"><ul><li class="drop-down"><div class="head"><a href="https://dblp.org">home</a></div><div class="body"><ul><li><a href="https://blog.dblp.org">blog</a></li><li><a href="https://dblp.org/statistics/">statistics</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/db/">browse</a></div><div class="body"><ul><li><a href="https://dblp.org/pers/">persons</a></li><li><a href="https://dblp.org/db/conf/">conferences</a></li><li><a href="https://dblp.org/db/journals/">journals</a></li><li><a href="https://dblp.org/db/series/">series</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/search/">search</a></div><div class="body"><ul><li><a href="https://dblp.org/search/">search dblp</a></li><li><a href="https://dblp.org/lookup/">lookup by ID</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://dblp.org/db/about/">about</a></div><div class="body"><ul><li><a href="https://dblp.org/faq/">f.a.q.</a></li><li><a href="https://dblp.org/db/about/team.html">team</a></li><li><a href="https://dblp.org/db/about/copyright.html">license</a></li><li><a href="https://dblp.org/db/about/privacy.html">privacy</a></li><li><a href="https://dblp.org/db/about/imprint.html">imprint</a></li></ul></div></li></ul></nav>
</div><!-- settings menu --><div id="settings" class="js-only"><div class="drop-down"><div class="head"><img alt="" src="https://dblp.org/img/cog.dark.24x24.png" class="icon" /></div><div class="body"><p><b>manage site settings</b></p><div class="scrollbox"><p>To protect your privacy, all features that rely on external API calls from your browser are <em>turned off by default</em>. 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 <a href="https://dblp.org/faq/15696107">see our F.A.Q.</a></p><div class="medskip"></div><div class="unpaywall-settings hideable hidden"><p class="hide-head"><em>Unpaywalled article links</em></p><div class="hide-body"><p>Add open access links from <a href="https://unpaywall.org"><img alt="unpaywall.org" src="https://dblp.org/img/unpaywall-logo.80x16.png" style="vertical-align:-5px;"/></a> to the list of external document links (if available).</p><p class="unpaywall-load load-button"><input type="checkbox"><a><strong>load links from unpaywall.org</strong></a></p><p><small>Privacy notice: By enabling the option above, your browser will contact the API of <em>unpaywall.org</em> 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 <a href="http://unpaywall.org/legal/privacy">Unpaywall privacy policy</a>.</small></p></div></div><div class="archive-settings hideable hidden"><p class="hide-head"><em>Archived links via Wayback Machine</em></p><div class="hide-body"><p>For web page which are no longer available, try to retrieve content from the <a href="https://web.archive.org"><img alt="web.archive.org" src="https://dblp.org/img/wayback-logo.72x14.png" style="vertical-align:-2px;"/></a> of the Internet Archive (if available).</p><p class="archive-load load-button"><input type="checkbox"><a><strong>load content from web.archive.org</strong></a></p><p><small>Privacy notice: By enabling the option above, your browser will contact the API of <em>web.archive.org</em> 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 <a href="https://archive.org/about/terms.php">Internet Archive privacy policy</a>.</small></p></div></div><div class="references-settings hideable hidden"><p class="hide-head"><em>Reference lists</em></p><div class="hide-body"><p>Add a list of references from <a href="https://crossref.org"><img alt="crossref.org" src="https://dblp.org/img/crossref-logo.60x15.png" style="vertical-align:-2px;"/></a>, <a href="https://opencitations.net"><img alt="opencitations.net" src="https://dblp.org/img/opencitations-logo.110x14.png" style="vertical-align:-2px;"/></a>, and <a href="https://semanticscholar.org"><img alt="semanticscholar.org" src="https://dblp.org/img/semanticscholar-logo.128x16.png" style="vertical-align:-4px;"/></a> to record detail pages.</p><p class="references-load load-button"><input type="checkbox"><a><strong>load references from crossref.org and opencitations.net</strong></a></p><p><small>Privacy notice: By enabling the option above, your browser will contact the APIs of <em>crossref.org</em>, <em>opencitations.net</em>, and <em>semanticscholar.org</em> 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 <a href="https://www.crossref.org/privacy/">Crossref privacy policy</a> and the <a href="https://opencitations.net/about">OpenCitations privacy policy</a>, as well as the <a href="https://allenai.org/privacy-policy">AI2 Privacy Policy</a> covering Semantic Scholar.</small></p></div></div><div class="citations-settings hideable hidden"><p class="hide-head"><em>Citation data</em></p><div class="hide-body"><p>Add a list of citing articles from <a href="https://opencitations.net"><img alt="opencitations.net" src="https://dblp.org/img/opencitations-logo.110x14.png" style="vertical-align:-2px;"/></a> and <a href="https://semanticscholar.org"><img alt="semanticscholar.org" src="https://dblp.org/img/semanticscholar-logo.128x16.png" style="vertical-align:-4px;"/></a> to record detail pages.</p><p class="citations-load load-button"><input type="checkbox"><a><strong>load citations from opencitations.net</strong></a></p><p><small>Privacy notice: By enabling the option above, your browser will contact the API of <em>opencitations.net</em> and <em>semanticscholar.org</em> 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 <a href="https://opencitations.net/about">OpenCitations privacy policy</a> as well as the <a href="https://allenai.org/privacy-policy">AI2 Privacy Policy</a> covering Semantic Scholar.</small></p></div></div><div class="tweets-settings hideable hidden"><p class="hide-head"><em>Tweets on dblp homepage</em></p><div class="hide-body"><p>Show tweets from <a href="https://twitter.com"><img alt="twitter.com" src="https://dblp.org/img/twitter-logo.75x14.png" style="vertical-align:-1px;"/></a> on the dblp homepage.</p><p class="tweets-load load-button"><input type="checkbox"><a><strong>load tweets from twitter.com</strong></a></p><p><small>Privacy notice: By enabling the option above, your browser will contact <em>twitter.com</em> and <em>twimg.com</em> to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the <a href="https://dev.twitter.com/web/overview/privacy">"dnt" flag</a>, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the <a href="https://www.twitter.com/privacy">Twitter privacy policy</a>.</small></p></div></div></div></div></div></div><!-- footer --><div class="clear-both"></div><div id="footer"><div class="info"><p><a href="https://validator.w3.org/nu/?doc=https%3A%2F%2Fdblp.org%2Fdb%2Fjournals%2Fpacmpl%2Fpacmpl5.html&showoutline=yes&checkerrorpages=yes"> <img alt="w3c valid html" src="https://dblp.org/img/w3c-valid-html.80x15.gray.png" /></a> last updated on 2021-08-12 23:11 CEST by the <a href="https://dblp.org/db/about/team.html">dblp team</a></p><p><a href="https://creativecommons.org/publicdomain/zero/1.0/"><img alt="cc zero" src="https://dblp.org/img/cc0.80x15.black.png" /></a> all metadata released as <a href="https://opendefinition.org/">open data</a> under <a href="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 license </a></p><p>see also: <a href="https://dblp.org/db/about/copyright.html">Terms of Use</a> | <a href="https://dblp.org/db/about/privacy.html">Privacy Policy</a> | <a href="https://dblp.org/db/about/imprint.html">Imprint</a></p></div><div class="funders"><p>dblp has been originally created in 1993 at:</p><a href="https://www.uni-trier.de/en/"><img alt="University of Trier" src="https://dblp.org/img/utr-logo-bottom.png" /></a> </div><div class="funders"><p>since 2018, dblp is operated and maintained by:</p><a href="https://www.dagstuhl.de/en/"><img alt="Schloss Dagstuhl - Leibniz Center for Informatics" src="https://dblp.org/img/lzi-logo-bottom.png" /></a> </div><div class="funders"><p>the dblp computer science bibliography is funded and supported by:</p><a href="https://www.bmbf.de/en/index.html"><img alt="BMBF" src="https://dblp.org/img/bmbf-logo-bottom.png" /></a> <a href="https://mwg.rlp.de/"><img alt="RLP" src="https://dblp.org/img/rlp-logo-bottom.png" /></a> <a href="https://www.saarland.de/stk/DE/home/home_node.html"><img alt="SL" src="https://dblp.org/img/sl-logo-bottom.png" /></a> <a href="https://www.leibniz-gemeinschaft.de/en/"><img alt="Leibniz" src="https://dblp.org/img/leibniz-logo-bottom.png" /></a> </div></div>
</div>
<script src="https://dblp.org/js/dblp-2020-08-18.min.js"></script><script src="https://dblp.org/js/dblp-search-2020-08-18.min.js"></script><script src="https://dblp.org/js/dblp-ui-2020-11-02.min.js"></script></body>
</html>