Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 69 matches
- 2022
- Daniel Patterson, Noble Mushtak, Andrew Wagner, Amal Ahmed:
Semantic soundness for language interoperability. PLDI 2022: 609-624 - Michael Christensen, Georgios Tzimpragos, Harlan Kringen, Jennifer Volk, Timothy Sherwood, Ben Hardekopf:
PyLSE: a pulse-transfer level language for superconductor electronics. PLDI 2022: 671-686 - Michael Greenberg, Ryan Beckett, Eric Hayden Campbell:
Kleene algebra modulo theories: a framework for concrete KATs. PLDI 2022: 594-608 - Daniel Lehmann, Michael Pradel:
Finding the dwarf: recovering precise types from WebAssembly binaries. PLDI 2022: 410-425 - Mridul Aanjaneya, Jay P. Lim, Santosh Nagarakatte:
Progressive polynomial approximations for fast correctly rounded math libraries. PLDI 2022: 552-565 - Ali Ahmadi, Majid Daliri, Amir Kafshdar Goharshady, Andreas Pavlogiannis:
Efficient approximations for cache-conscious data placement. PLDI 2022: 857-871 - Willow Ahrens, Fredrik Kjolstad, Saman P. Amarasinghe:
Autoscheduling for sparse tensor algebra with an asymptotic cost model. PLDI 2022: 269-285 - Daniel Anderson, Guy E. Blelloch, Yuanhao Wei:
Turning manual concurrent memory reclamation into automatic reference counting. PLDI 2022: 61-75 - Bachir Bendrissou, Rahul Gopinath, Andreas Zeller:
"Synthesizing input grammars": a replication study. PLDI 2022: 260-268 - Raven Beutner, C.-H. Luke Ong, Fabian Zaiser:
Guaranteed bounds for posterior inference in universal probabilistic programming. PLDI 2022: 536-551 - Ian Briggs, Pavel Panchekha:
Choosing mathematical function implementations for speed and accuracy. PLDI 2022: 522-535 - Roberto Bruni, Roberto Giacobazzi, Roberta Gori, Francesco Ranzato:
Abstract interpretation repair. PLDI 2022: 426-441 - Milind Chabbi, Murali Krishna Ramanathan:
A study of real-world data races in Golang. PLDI 2022: 474-489 - Stefanos Chaliasos, Thodoris Sotiropoulos, Diomidis Spinellis, Arthur Gervais, Benjamin Livshits, Dimitris Mitropoulos:
Finding typing compiler bugs. PLDI 2022: 183-198 - Yishen Chen, Charith Mendis, Saman P. Amarasinghe:
All you need is superword-level parallelism: systematic control-flow vectorization with SLP. PLDI 2022: 301-315 - Yanju Chen, Xifeng Yan, Yu Feng:
Visualization question answering using introspective program synthesis. PLDI 2022: 137-151 - Minki Cho, Sung-Hwan Lee, Dongjae Lee, Chung-Kil Hur, Ori Lahav:
Sequential reasoning for optimizing compilers under weak memory concurrency. PLDI 2022: 213-228 - Wonhyuk Choi, Bernd Finkbeiner, Ruzica Piskac, Mark Santolucito:
Can reactive synthesis and syntax-guided synthesis be friends? PLDI 2022: 229-243 - Will Crichton, Marco Patrignani, Maneesh Agrawala, Pat Hanrahan:
Modular information flow through ownership. PLDI 2022: 1-14 - Hoang-Hai Dang, Jaehwang Jung, Jaemin Choi, Duc-Than Nguyen, William Mansky, Jeehoon Kang, Derek Dreyer:
Compass: strong and compositional library specifications in relaxed memory separation logic. PLDI 2022: 792-808 - Laxman Dhulipala, Guy E. Blelloch, Yan Gu, Yihan Sun:
PaC-trees: supporting parallel and compressed purely-functional collections. PLDI 2022: 108-121 - Ryan Doenges, Tobias Kappé, John Sarracino, Nate Foster, Greg Morrisett:
Leapfrog: certified equivalence for protocol parsers. PLDI 2022: 950-965 - Rui Dong, Zhicheng Huang, Ian Iong Lam, Yan Chen, Xinyu Wang:
WebRobot: web robotic process automation using interactive programming-by-demonstration. PLDI 2022: 152-167 - Azadeh Farzan, Dominik Klumpp, Andreas Podelski:
Sound sequentialization for concurrent program verification. PLDI 2022: 506-521 - Azadeh Farzan, Danya Lette, Victor Nicolet:
Recursion synthesis with unrealizability witnesses. PLDI 2022: 244-259 - Mathieu Fehr, Jeff Niu, River Riddle, Mehdi Amini, Zhendong Su, Tobias Grosser:
IRDL: an IR definition language for SSA compilers. PLDI 2022: 199-212 - Olivier Flückiger, Jan Jecmen, Sebastián Krynski, Jan Vitek:
Deoptless: speculation with dispatched on-stack replacement and specialized continuations. PLDI 2022: 749-761 - Hamed Gorjiara, Weiyu Luo, Alex Lee, Guoqing Harry Xu, Brian Demsky:
Checking robustness to weak persistency models. PLDI 2022: 490-505 - Ben Greenman:
Deep and shallow types for gradual languages. PLDI 2022: 580-593 - Karuna Grewal, Loris D'Antoni, Justin Hsu:
P4BID: information flow control in p4. PLDI 2022: 46-60
skipping 39 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-04-19 15:22 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint