Остановите войну!
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 56 matches
- 2011
- John Altidor, Shan Shan Huang, Yannis Smaragdakis:
Taming the wildcards: combining definition- and use-site variance. PLDI 2011: 602-613 - Jason Ansel, Petr Marchenko, Úlfar Erlingsson, Elijah Taylor, Brad Chen, Derek L. Schuff, David Sehr, Cliff Biffle, Bennet Yee:
Language-independent sandboxing of just-in-time compilation and self-modifying code. PLDI 2011: 355-366 - Nels E. Beckman, Aditya V. Nori:
Probabilistic, modular and scalable inference of typestate specifications. PLDI 2011: 211-221 - Micah J. Best, Shane Mottishaw, Craig Mustard, Mark Roth, Alexandra Fedorova, Andrew Brownsword:
Synchronization via scheduling: techniques for efficiently managing shared state. PLDI 2011: 640-652 - Igor Böhm, Tobias J. K. Edler von Koch, Stephen C. Kyle, Björn Franke, Nigel P. Topham:
Generalized just-in-time trace compilation using a parallel task farm in a dynamic binary translator. PLDI 2011: 74-85 - Ahmed Bouajjani, Cezara Dragoi, Constantin Enea, Mihaela Sighireanu:
On inter-procedural analysis of programs with lists and data. PLDI 2011: 578-589 - Aditya Budi, David Lo, Lingxiao Jiang, Lucia:
kb-anonymity: a model for anonymized behaviour-preserving test and debugging data. PLDI 2011: 447-457 - Jacob Burnim, Tayfun Elmas, George C. Necula, Koushik Sen:
NDSeq: runtime checking for nondeterministic sequential specifications of parallel correctness. PLDI 2011: 401-414 - Adam Chlipala:
Mostly-automated verification of low-level programs in computational separation logic. PLDI 2011: 234-245 - Daniele Cono D'Elia, Camil Demetrescu, Irene Finocchi:
Mining hot calling contexts in small space. PLDI 2011: 516-527 - Isil Dillig, Thomas Dillig, Alex Aiken, Mooly Sagiv:
Precise and compact modular procedure summaries for heap manipulating programs. PLDI 2011: 567-577 - Saturnino Garcia, Donghwan Jeon, Christopher M. Louie, Michael Bedford Taylor:
Kremlin: rethinking and rebooting gprof for the multicore age. PLDI 2011: 458-469 - Patrice Godefroid:
Higher-order test generation. PLDI 2011: 258-269 - Sumit Gulwani, Susmit Jha, Ashish Tiwari, Ramarathnam Venkatesan:
Synthesis of loop-free programs. PLDI 2011: 62-73 - Sumit Gulwani, Vijay Anand Korthikanti, Ashish Tiwari:
Synthesizing geometry constructions. PLDI 2011: 50-61 - William R. Harris, Sumit Gulwani:
Spreadsheet table transformations from examples. PLDI 2011: 317-328 - Peter Hawkins, Alex Aiken, Kathleen Fisher, Martin C. Rinard, Mooly Sagiv:
Data representation synthesis. PLDI 2011: 38-49 - Thomas B. Jablin, Prakash Prabhu, James A. Jablin, Nick P. Johnson, Stephen R. Beard, David I. August:
Automatic CPU-GPU communication management and optimization. PLDI 2011: 142-151 - Dongyun Jin, Patrick O'Neil Meredith, Dennis Griffith, Grigore Rosu:
Garbage collection for monitoring parametric properties. PLDI 2011: 415-424 - Guoliang Jin, Linhai Song, Wei Zhang, Shan Lu, Ben Liblit:
Automated atomicity-violation fixing. PLDI 2011: 389-400 - Manu Jose, Rupak Majumdar:
Cause clue clauses: error localization using maximum satisfiability. PLDI 2011: 437-446 - Changhee Jung, Silvius Rus, Brian P. Railing, Nathan Clark, Santosh Pande:
Brainy: effective selection of data structures. PLDI 2011: 86-97 - Deokhwan Kim, Martin C. Rinard:
Verification of semantic commutativity conditions and inverse operations on linked data structures. PLDI 2011: 528-541 - Naoki Kobayashi, Ryosuke Sato, Hiroshi Unno:
Predicate abstraction and CEGAR for higher-order model checking. PLDI 2011: 222-233 - Milind Kulkarni, Donald Nguyen, Dimitrios Prountzos, Xin Sui, Keshav Pingali:
Exploiting the commutativity lattice. PLDI 2011: 542-555 - Michael Kuperstein, Martin T. Vechev, Eran Yahav:
Partial-coherence abstractions for relaxed memory models. PLDI 2011: 187-198 - Kyu Hyung Lee, Yunhui Zheng, Nick Sumner, Xiangyu Zhang:
Toward generating reducible replay logs. PLDI 2011: 246-257 - Xun Li, Mohit Tiwari, Jason Oberg, Vineeth Kashyap, Frederic T. Chong, Timothy Sherwood, Ben Hardekopf:
Caisson: a hardware description language for secure information flow. PLDI 2011: 109-120 - Percy Liang, Mayur Naik:
Scaling abstraction refinement via pruning. PLDI 2011: 590-601 - Brandon Lucia, Benjamin P. Wood, Luis Ceze:
Isolating and understanding concurrency errors using reconstructed execution fragments. PLDI 2011: 378-388
skipping 26 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-05-25 18: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