Остановите войну!
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 167 matches
- 2021
- Alejandro Aguirre, Gilles Barthe, Justin Hsu, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
A pre-expectation calculus for probabilistic sensitivity. Proc. ACM Program. Lang. 5(POPL): 1-28 (2021) - Umang Mathur, Andreas Pavlogiannis, Mahesh Viswanathan:
Optimal prediction of synchronization-preserving races. Proc. ACM Program. Lang. 5(POPL): 1-29 (2021) - Jatin Arora, Sam Westrick, Umut A. Acar:
Provably space-efficient parallel functional programming. Proc. ACM Program. Lang. 5(POPL): 1-33 (2021) - Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan:
Deciding reachability under persistent x86-TSO. Proc. ACM Program. Lang. 5(POPL): 1-32 (2021) - Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni:
The (In)Efficiency of interaction. Proc. ACM Program. Lang. 5(POPL): 1-33 (2021) - Alejandro Aguirre, Gilles Barthe, Marco Gaboardi, Deepak Garg, Shin-ya Katsumata, Tetsuya Sato:
Higher-order probabilistic adversarial computations: categorical semantics and program logics. Proc. ACM Program. Lang. 5(ICFP): 1-30 (2021) - Danel Ahman, Matija Pretnar:
Asynchronous effects. Proc. ACM Program. Lang. 5(POPL): 1-28 (2021) - Shaull Almagor, Toghrul Karimov, Edon Kelmendi, Joël Ouaknine, James Worrell:
Deciding ω-regular properties on linear recurrence sequences. Proc. ACM Program. Lang. 5(POPL): 1-24 (2021) - Luke Anderson, Andrew Adams, Karima Ma, Tzu-Mao Li, Tian Jin, Jonathan Ragan-Kelley:
Efficient automatic scheduling of imaging and vision pipelines for the GPU. Proc. ACM Program. Lang. 5(OOPSLA): 1-28 (2021) - Carlo Angiuli, Evan Cavallo, Anders Mörtberg, Max Zeuner:
Internalizing representation independence with univalence. Proc. ACM Program. Lang. 5(POPL): 1-30 (2021) - Angello Astorga, Shambwaditya Saha, Ahmad Dinkins, Felicia Wang, P. Madhusudan, Tao Xie:
Synthesizing contracts correct modulo a test generator. Proc. ACM Program. Lang. 5(OOPSLA): 1-27 (2021) - Eric Atkinson, Guillaume Baudart, Louis Mandel, Charles Yuan, Michael Carbin:
Statically bounded-memory delayed sampling for probabilistic streams. Proc. ACM Program. Lang. 5(OOPSLA): 1-28 (2021) - Martin Avanzini, Gilles Barthe, Ugo Dal Lago:
On continuation-passing transformations and expected cost analysis. Proc. ACM Program. Lang. 5(ICFP): 1-30 (2021) - Nader Al Awar, Kush Jain, Christopher J. Rossbach, Milos Gligoric:
Programming and execution models for parallel bounded exhaustive testing. Proc. ACM Program. Lang. 5(OOPSLA): 1-28 (2021) - Patrick Bahr, Christian Uldal Graulund, Rasmus Ejlers Møgelberg:
Diamonds are not forever: liveness in reactive programming with guarded recursion. Proc. ACM Program. Lang. 5(POPL): 1-28 (2021) - Yuyan Bao, Guannan Wei, Oliver Bracevac, Yuxuan Jiang, Qiyang He, Tiark Rompf:
Reachability types: tracking aliasing and separation in higher-order functional programs. Proc. ACM Program. Lang. 5(OOPSLA): 1-32 (2021) - Mohamad Barbar, Yulei Sui:
Compacting points-to sets through object clustering. Proc. ACM Program. Lang. 5(OOPSLA): 1-27 (2021) - Aurèle Barrière, Sandrine Blazy, Olivier Flückiger, David Pichardie, Jan Vitek:
Formally verified speculation and deoptimization in a JIT compiler. Proc. ACM Program. Lang. 5(POPL): 1-26 (2021) - Sándor Bartha, James Cheney, Vaishak Belle:
One down, 699 to go: or, synthesising compositional desugarings. Proc. ACM Program. Lang. 5(OOPSLA): 1-29 (2021) - Gilles Barthe, Rohit Chadha, Paul Krogmeier, A. Prasad Sistla, Mahesh Viswanathan:
Deciding accuracy of differential privacy schemes. Proc. ACM Program. Lang. 5(POPL): 1-30 (2021) - Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
Relatively complete verification of probabilistic programs: an expressive language for expectation-based reasoning. Proc. ACM Program. Lang. 5(POPL): 1-30 (2021) - Pascal Baumann, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche:
Context-bounded verification of liveness properties for multithreaded shared-memory programs. Proc. ACM Program. Lang. 5(POPL): 1-31 (2021) - Rohan Bavishi, Caroline Lemieux, Koushik Sen, Ion Stoica:
Gauss: program synthesis by reasoning over graphs. Proc. ACM Program. Lang. 5(OOPSLA): 1-29 (2021) - Michael Benedikt, Cécilia Pradic:
Generating collection transformations from proofs. Proc. ACM Program. Lang. 5(POPL): 1-28 (2021) - Lars Birkedal, Thomas Dinsdale-Young, Armaël Guéneau, Guilhem Jaber, Kasper Svendsen, Nikos Tzevelekos:
Theorems for free from separation logic specifications. Proc. ACM Program. Lang. 5(ICFP): 1-29 (2021) - Ranadeep Biswas, Diptanshu Kakwani, Jyothi Vedurada, Constantin Enea, Akash Lal:
MonkeyDB: effectively testing correctness under weak isolation levels. Proc. ACM Program. Lang. 5(OOPSLA): 1-27 (2021) - Christian Bräm, Marco Eilers, Peter Müller, Robin Sierra, Alexander J. Summers:
Rich specifications for Ethereum smart contract verification. Proc. ACM Program. Lang. 5(OOPSLA): 1-30 (2021) - Robert Brotzman, Danfeng Zhang, Mahmut Taylan Kandemir, Gang Tan:
SpecSafe: detecting cache side channels in a speculative world. Proc. ACM Program. Lang. 5(OOPSLA): 1-28 (2021) - Michael D. Brown, Matthew Pruett, Robert Bigelow, Girish Mururu, Santosh Pande:
Not so fast: understanding and mitigating negative impacts of compiler optimizations on code reuse gadget sets. Proc. ACM Program. Lang. 5(OOPSLA): 1-30 (2021) - Truc Lam Bui, Krishnendu Chatterjee, Tushar Gautam, Andreas Pavlogiannis, Viktor Toman:
The reads-from equivalence for the TSO and PSO memory models. Proc. ACM Program. Lang. 5(OOPSLA): 1-30 (2021)
skipping 137 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-06-04 06:58 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