Остановите войну!
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 42 matches
- 2010
- Mohamed Faouzi Atig, Ahmed Bouajjani, Sebastian Burckhardt, Madanlal Musuvathi:
On the verification problem for weak memory models. POPL 2010: 7-18 - Hagit Attiya, G. Ramalingam, Noam Rinetzky:
Sequential verification of serializability. POPL 2010: 31-42 - Karthikeyan Bhargavan, Cédric Fournet, Andrew D. Gordon:
Modular verification of security protocol code by typing. POPL 2010: 445-456 - Rastislav Bodík, Satish Chandra, Joel Galenson, Doug Kimelman, Nicholas Tung, Shaon Barman, Casey Rodarmor:
Programming with angelic nondeterminism. POPL 2010: 339-352 - Niklas Broberg, David Sands:
Paralocks: role-based information flow control and beyond. POPL 2010: 431-444 - Swarat Chaudhuri, Sumit Gulwani, Roberto Lublinerman:
Continuity analysis of programs. POPL 2010: 57-70 - Adam Chlipala:
A verified compiler for an impure functional language. POPL 2010: 93-106 - João Dias, Norman Ramsey:
Automatically generating instruction selectors using declarative machine descriptions. POPL 2010: 403-416 - Derek Dreyer, Georg Neis, Andreas Rossberg, Lars Birkedal:
A relational modal logic for higher-order stateful ADTs. POPL 2010: 185-198 - Andrzej Filinski:
Monads in action. POPL 2010: 483-494 - Simon J. Gay, Vasco Thudichum Vasconcelos, António Ravara, Nils Gesbert, Alexandre Z. Caldeira:
Modular session types for distributed object-oriented programming. POPL 2010: 299-312 - Neil Gershenfeld, David Dalrymple, Kailiang Chen, Ara N. Knaian, Forrest Green, Erik D. Demaine, Scott Greenwald, Peter Schmidt-Nielsen:
Reconfigurable asynchronous logic automata: (RALA). POPL 2010: 1-6 - Patrice Godefroid, Aditya V. Nori, Sriram K. Rajamani, SaiDeep Tetali:
Compositional may-must program analysis: unleashing the power of alternation. POPL 2010: 43-56 - Michael Greenberg, Benjamin C. Pierce, Stephanie Weirich:
Contracts made manifest. POPL 2010: 353-364 - William R. Harris, Sriram Sankaranarayanan, Franjo Ivancic, Aarti Gupta:
Program analysis via satisfiability modulo path programs. POPL 2010: 71-82 - Matthias Heizmann, Jochen Hoenicke, Andreas Podelski:
Nested interpolants. POPL 2010: 471-482 - Thomas A. Henzinger:
From Boolean to quantitative notions of correctness. POPL 2010: 157-158 - Aquinas Hobor, Robert Dockins, Andrew W. Appel:
A theory of indirection via approximation. POPL 2010: 171-184 - DeLesley S. Hutchins:
Pure subtype systems. POPL 2010: 287-298 - Limin Jia, Jianzhou Zhao, Vilhelm Sjöberg, Stephanie Weirich:
Dependent types and program equivalence. POPL 2010: 275-286 - Trevor Jim, Yitzhak Mandelbaum, David Walker:
Semantics and algorithms for data-dependent grammars. POPL 2010: 417-430 - Steffen Jost, Kevin Hammond, Hans-Wolfgang Loidl, Martin Hofmann:
Static determination of quantitative resource usage for higher-order programs. POPL 2010: 223-236 - Naoki Kobayashi, Naoshi Tabuchi, Hiroshi Unno:
Higher-order multi-parameter tree transducers and recursion schemes for program verification. POPL 2010: 495-508 - Eric Koskinen, Matthew J. Parkinson, Maurice Herlihy:
Coarse-grained transactions. POPL 2010: 19-30 - Stephen Magill, Ming-Hsien Tsai, Peter Lee, Yih-Kuen Tsay:
Automatic numeric abstractions for heap-manipulating programs. POPL 2010: 211-222 - J. Gregory Malecha, Greg Morrisett, Avraham Shinnar, Ryan Wisnesky:
Toward a verified relational database management system. POPL 2010: 237-248 - Jean-Phillipe Martin, Michael Hicks, Manuel Costa, Periklis Akritidis, Miguel Castro:
Dynamically checking ownership policies in concurrent c/c++ programs. POPL 2010: 457-470 - Magnus O. Myreen:
Verified just-in-time compiler on x86. POPL 2010: 107-118 - Aleksandar Nanevski, Viktor Vafeiadis, Josh Berdine:
Structuring the verification of heap-manipulating programs. POPL 2010: 261-274 - Andrew M. Pitts:
Nominal system T. POPL 2010: 159-170
skipping 12 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-25 19:17 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