Остановите войну!
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 23 matches
- 2012
- Beniamino Accattoli:
Proof Pearl: Abella Formalization of λ-Calculus Cube Property. CPP 2012: 173-187 - Andrea Asperti, Wilmer Ricciotti:
Rating Disambiguation Errors. CPP 2012: 240-255 - Gilles Barthe, Benjamin Grégoire, César Kunz, Yassine Lakhnech, Santiago Zanella Béguelin:
Automation in Computer-Aided Cryptography: Proofs, Attacks and Designs. CPP 2012: 7-8 - Sylvie Boldo, Catherine Lelay, Guillaume Melquiond:
Improving Real Analysis in Coq: A User-Friendly Approach to Integrals and Derivatives. CPP 2012: 289-304 - Lukas Bulwahn:
The New Quickcheck for Isabelle - Random, Exhaustive and Symbolic Testing under One Roof. CPP 2012: 92-108 - Brian Campbell:
An Executable Semantics for CompCert C. CPP 2012: 60-75 - Hing-Lun Chan, Michael Norrish:
A String of Pearls: Proofs of Fermat's Little Theorem. CPP 2012: 188-207 - Kaustuv Chaudhuri:
Compact Proof Certificates for Linear Logic. CPP 2012: 208-223 - Thierry Coquand, Anders Mörtberg, Vincent Siles:
Coherent and Strongly Discrete Rings in Type Theory. CPP 2012: 273-288 - Christian Doczkal, Gert Smolka:
Constructive Completeness for Modal Logic with Transitive Closure. CPP 2012: 224-239 - Naoki Kobayashi:
Program Certification by Higher-Order Model Checking. CPP 2012: 9-10 - Xavier Leroy:
Mechanized Semantics for Compiler Verification. CPP 2012: 4-6 - Greg Morrisett:
Scalable Formal Machine Models. CPP 2012: 1-3 - Dominic P. Mulligan, Claudio Sacerdoti Coen:
On the Correctness of an Optimising Assembler for the Intel MCS-51 Microprocessor. CPP 2012: 43-59 - Toby C. Murray, Daniel Matichuk, Matthew Brassil, Peter Gammie, Gerwin Klein:
Noninterference for Operating System Kernels. CPP 2012: 126-142 - Keisuke Nakano:
Shall We Juggle, Coinductively? CPP 2012: 160-172 - Pierre Neron:
A Formal Proof of Square Root and Division Elimination in Embedded Programs. CPP 2012: 256-272 - Andrei Popescu, Johannes Hölzl, Tobias Nipkow:
Proving Concurrent Noninterference. CPP 2012: 109-125 - Valentin Robert, Xavier Leroy:
A Formally-Verified Alias Analysis. CPP 2012: 11-26 - Pierre-Nicolas Tollitte, David Delahaye, Catherine Dubois:
Producing Certified Functional Code from Inductive Specifications. CPP 2012: 76-91 - Alexander Vaynberg, Zhong Shao:
Compositional Verification of a Baby Virtual Memory Manager. CPP 2012: 143-159 - Jianzhou Zhao, Steve Zdancewic:
Mechanized Verification of Computing Dominators for Formalizing Compilers. CPP 2012: 27-42 - Chris Hawblitzel, Dale Miller:
Certified Programs and Proofs - Second International Conference, CPP 2012, Kyoto, Japan, December 13-15, 2012. Proceedings. Lecture Notes in Computer Science 7679, Springer 2012, ISBN 978-3-642-35307-9 [contents]
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-09 07:36 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