Остановите войну!
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
- 2011
- Don S. Batory:
Towards Verification of Product Lines. ITP 2011: 1 - Jesper Bengtson, Jonas Braband Jensen, Filip Sieczkowski, Lars Birkedal:
Verifying Object-Oriented Programs with Higher-Order Separation Logic in Coq. ITP 2011: 22-38 - Lennart Beringer:
Relational Decomposition. ITP 2011: 39-54 - Anne-Gwenn Bosser, Pierre Courtieu, Julien Forest, Marc Cavazza:
Structural Analysis of Narratives with the Coq Proof Assistant. ITP 2011: 55-70 - Renaud Clavel, Laurence Pierre, Régis Leveugle:
Towards Robustness Analysis Using PVS. ITP 2011: 71-86 - Anthony C. J. Fox:
LCF-Style Bit-Blasting in HOL4. ITP 2011: 357-362 - Peter Gammie:
Verified Synthesis of Knowledge-Based Programs in Finite Synchronous Environments. ITP 2011: 87-102 - Georges Gonthier:
Advances in the Formalization of the Odd Order Theorem. ITP 2011: 2 - Georges Gonthier:
Point-Free, Set-Free Concrete Linear Algebra. ITP 2011: 103-118 - Sylvain Heraud, David Nowak:
A Formalization of Polytime Functions. ITP 2011: 119-134 - Johannes Hölzl, Armin Heller:
Three Chapters of Measure Theory in Isabelle/HOL. ITP 2011: 135-151 - Bart Jacobs, Ronny Wichers Schreur:
Logical Formalisation and Analysis of the Mifare Classic Card in PVS. ITP 2011: 3-17 - Michael Kishinevsky, Alexander Gotmanov, Yuriy Viktorov:
Challenges in Verifying Communication Fabrics. ITP 2011: 18-21 - Alexander Krauss, Christian Sternagel, René Thiemann, Carsten Fuhs, Jürgen Giesl:
Termination of Isabelle Functions via Termination of Rewriting. ITP 2011: 152-167 - Ramana Kumar, Tjark Weber:
Validating QBF Validity in HOL4. ITP 2011: 168-183 - Ondrej Kuncar:
Proving Valid Quantified Boolean Formulas in HOL Light. ITP 2011: 184-199 - Laureano Lambán, Francisco-Jesús Martín-Mateos, Julio Rubio, José-Luis Ruiz-Reina:
Applying ACL2 to the Formalization of Algebraic Topology: Simplicial Polynomials. ITP 2011: 200-215 - Andreas Lochbihler, Lukas Bulwahn:
Animating the Formalised Semantics of a Java-Like Language. ITP 2011: 216-232 - Tarek Mhamdi, Osman Hasan, Sofiène Tahar:
Formalization of Entropy Measures in HOL. ITP 2011: 233-248 - David Monniaux, Pierre Corbineau:
On the Generation of Positivstellensatz Witnesses in Degenerate Cases. ITP 2011: 249-264 - Magnus O. Myreen, Jared Davis:
A Verified Runtime for a Verified Theorem Prover. ITP 2011: 265-280 - Tobias Nipkow:
Verified Efficient Enumeration of Plane Graphs Modulo Isomorphism. ITP 2011: 281-296 - Michael Norrish:
Mechanised Computability Theory. ITP 2011: 297-311 - Scott Owens, Peter Böhm, Francesco Zappa Nardelli, Peter Sewell:
Lem: A Lightweight Tool for Heavyweight Semantics. ITP 2011: 363-369 - Peter Reid, Ruben Gamboa:
Automatic Differentiation in ACL2. ITP 2011: 312-324 - Phil Scott, Jacques D. Fleuriot:
Composable Discovery Engines for Interactive Theorem Proving. ITP 2011: 370-375 - Thomas Sewell, Simon Winwood, Peter Gammie, Toby C. Murray, June Andronick, Gerwin Klein:
seL4 Enforces Integrity. ITP 2011: 325-340 - Matej Urbas, Mateja Jamnik:
Heterogeneous Proofs: Spider Diagrams Meet Higher-Order Provers. ITP 2011: 376-382 - Chunhan Wu, Xingyuan Zhang, Christian Urban:
A Formalisation of the Myhill-Nerode Theorem Based on Regular Expressions (Proof Pearl). ITP 2011: 341-356 - Marko C. J. D. van Eekelen, Herman Geuvers, Julien Schmaltz, Freek Wiedijk:
Interactive Theorem Proving - Second International Conference, ITP 2011, Berg en Dal, The Netherlands, August 22-25, 2011. Proceedings. Lecture Notes in Computer Science 6898, Springer 2011, ISBN 978-3-642-22862-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-04-27 16:45 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