Остановите войну!
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 30 matches
- 2012
- Reynald Affeldt, Manabu Hagiwara:
Formalization of Shannon's Theorems in SSReflect-Coq. ITP 2012: 233-249 - Andrea Asperti:
A Compact Proof of Decidability for Regular Expression Equivalence. ITP 2012: 283-298 - David Baelde, Pierre Courtieu, David Gross-Amblard, Christine Paulin-Mohring:
Towards Provably Robust Watermarking. ITP 2012: 201-216 - Gilles Barthe, Juan Manuel Crespo, Benjamin Grégoire, César Kunz, Santiago Zanella Béguelin:
Computer-Aided Cryptographic Proofs. ITP 2012: 11-27 - Jesper Bengtson, Jonas Braband Jensen, Lars Birkedal:
Charge! - A Framework for Higher-Order Separation Logic in Coq. ITP 2012: 315-331 - Jasmin Christian Blanchette, Andrei Popescu, Daniel Wand, Christoph Weidenbach:
More SPASS with Isabelle - Superposition with Hard Sorts and Configurable Simplification. ITP 2012: 345-360 - Cyril Cohen:
Construction of Real Algebraic Numbers in Coq. ITP 2012: 67-82 - Nils Anders Danielsson:
Bag Equivalence via a Proof-Relevant Membership Relation. ITP 2012: 149-165 - Maxime Dénès, Anders Mörtberg, Vincent Siles:
A Refinement-Based Approach to Computational Algebra in Coq. ITP 2012: 83-98 - Anthony C. J. Fox:
Directions in ISA Specification. ITP 2012: 338-344 - Andrew Gacek:
Abella: A Tutorial. ITP 2012: 49-50 - Ruben Gamboa, John R. Cowles:
A Cantor Trio: Denumerability, the Reals, and the Real Algebraic Numbers. ITP 2012: 51-66 - Georges Gonthier, Enrico Tassi:
A Language of Patterns for Subterm Selection. ITP 2012: 361-376 - David Greenaway, June Andronick, Gerwin Klein:
Bridging the Gap: Automatic Verified Abstraction of C. ITP 2012: 99-115 - Fabian Immler, Johannes Hölzl:
Numerical Analysis of Ordinary Differential Equations in Isabelle/HOL. ITP 2012: 377-392 - Gerwin Klein, Rafal Kolanski, Andrew Boyton:
Mechanised Separation Algebra. ITP 2012: 332-337 - Ramana Kumar, Joe Hurd:
Standalone Tactics Using OpenTheory. ITP 2012: 405-411 - Peter Lammich, Thomas Tuerk:
Applying Data Refinement for Monadic Programs to Hopcroft's Algorithm. ITP 2012: 166-182 - William Mansky, Elsa L. Gunter:
Using Locales to Define a Rely-Guarantee Temporal Logic. ITP 2012: 299-314 - Patrick Michel, Arnd Poetzsch-Heffter:
Verifying and Generating WP Transformers for Procedures on Complex Data. ITP 2012: 133-148 - Marino Miculan, Marco Paviotti:
Synthesis of Distributed Mobile Programs Using Monadic Types in Coq. ITP 2012: 183-200 - Magnus O. Myreen:
Functional Programs: Conversions between Deep and Shallow Embeddings. ITP 2012: 412-417 - Tobias Nipkow:
Abstract Interpretation of Annotated Commands. ITP 2012: 116-132 - Lars Noschinski:
Proof Pearl: A Probabilistic Proof for the Girth-Chromatic Number Theorem. ITP 2012: 393-404 - Lawrence C. Paulson:
MetiTarski: Past and Future. ITP 2012: 1-10 - André Platzer:
A Differential Operator Approach to Equational Differential Invariants - (Invited Paper). ITP 2012: 28-48 - Christian Sternagel, René Thiemann:
Certification of Nontermination Proofs. ITP 2012: 266-282 - Dimitrios Vytiniotis, Thierry Coquand, David Wahlstedt:
Stop When You Are Almost-Full - Adventures in Constructive Termination. ITP 2012: 250-265 - Xingyuan Zhang, Christian Urban, Chunhan Wu:
Priority Inheritance Protocol Proved Correct. ITP 2012: 217-232 - Lennart Beringer, Amy P. Felty:
Interactive Theorem Proving - Third International Conference, ITP 2012, Princeton, NJ, USA, August 13-15, 2012. Proceedings. Lecture Notes in Computer Science 7406, Springer 2012, ISBN 978-3-642-32346-1 [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-30 11:44 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