Остановите войну!
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 24 matches
- 2012
- Jeremy Avigad, Stefan Hetzl:
Bondy's Theorem. Arch. Formal Proofs 2012 (2012) - Giampaolo Bella:
Inductive Study of Confidentiality. Arch. Formal Proofs 2012 (2012) - Jesper Bengtson:
Psi-calculi in Isabelle. Arch. Formal Proofs 2012 (2012) - Jesper Bengtson:
The pi-calculus in nominal logic. Arch. Formal Proofs 2012 (2012) - Jesper Bengtson:
CCS in nominal logic. Arch. Formal Proofs 2012 (2012) - Henri Debrat, Stephan Merz:
Verifying Fault-Tolerant Distributed Algorithms in the Heard-Of Model. Arch. Formal Proofs 2012 (2012) - Abderrahmane Feliachi, Burkhart Wolff, Marie-Claude Gaudel:
Isabelle/Circus. Arch. Formal Proofs 2012 (2012) - Peter Gammie:
Logical Relations for PCF. Arch. Formal Proofs 2012 (2012) - Rachid Guerraoui, Viktor Kuncak, Giuliano Losa:
Abortable Linearizable Modules. Arch. Formal Proofs 2012 (2012) - Johannes Hölzl, Tobias Nipkow:
Markov Models. Arch. Formal Proofs 2012 (2012) - Brian Huffman:
Type Constructor Classes and Monad Transformers. Arch. Formal Proofs 2012 (2012) - Fabian Immler, Johannes Hölzl:
Ordinary Differential Equations. Arch. Formal Proofs 2012 (2012) - Gerwin Klein, Rafal Kolanski, Andrew Boyton:
Separation Algebra. Arch. Formal Proofs 2012 (2012) - Peter Lammich:
Refinement for Monadic Programs. Arch. Formal Proofs 2012 (2012) - Peter Lammich, Rene Meis:
A Separation Logic Framework for Imperative HOL. Arch. Formal Proofs 2012 (2012) - T. J. M. Makarios:
The independence of Tarski's Euclidean axiom. Arch. Formal Proofs 2012 (2012) - Stephan Merz:
Stuttering Equivalence. Arch. Formal Proofs 2012 (2012) - Benedikt Nordhoff, Peter Lammich:
Dijkstra's Shortest Path Algorithm. Arch. Formal Proofs 2012 (2012) - Lars Noschinski:
A Probabilistic Proof of the Girth-Chromatic Number Theorem. Arch. Formal Proofs 2012 (2012) - Andrei Popescu, Johannes Hölzl:
Possibilistic Noninterference. Arch. Formal Proofs 2012 (2012) - Ralph Romanos, Lawrence C. Paulson:
Proving the Impossibility of Trisecting an Angle and Doubling the Cube. Arch. Formal Proofs 2012 (2012) - Christian Sternagel:
Well-Quasi-Orders. Arch. Formal Proofs 2012 (2012) - René Thiemann:
Executable Transitive Closures. Arch. Formal Proofs 2012 (2012) - René Thiemann:
Generating linear orders for datatypes. Arch. Formal Proofs 2012 (2012)
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-07 13:23 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