![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Sascha Böhme
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [j7]Jasmin Christian Blanchette, Sascha Böhme, Andrei Popescu, Nicholas Smallbone:
Encoding Monomorphic and Polymorphic Types. Log. Methods Comput. Sci. 12(4) (2016) - [j6]Jasmin Christian Blanchette
, Sascha Böhme, Mathias Fleury
, Steffen Juilf Smolka
, Albert Steckermeier:
Semi-intelligible Isar Proofs from Machine-Generated Proofs. J. Autom. Reason. 56(2): 155-200 (2016) - 2014
- [j5]Eyad Alkassar, Sascha Böhme, Kurt Mehlhorn, Christine Rizkallah
:
A Framework for the Verification of Certifying Computations. J. Autom. Reason. 52(3): 241-273 (2014) - 2013
- [j4]Jasmin Christian Blanchette, Sascha Böhme, Lawrence C. Paulson
:
Extending Sledgehammer with SMT Solvers. J. Autom. Reason. 51(1): 109-128 (2013) - [c9]Jasmin Christian Blanchette, Sascha Böhme, Andrei Popescu, Nicholas Smallbone:
Encoding Monomorphic and Polymorphic Types. TACAS 2013: 493-507 - [i1]Eyad Alkassar, Sascha Böhme, Kurt Mehlhorn, Christine Rizkallah:
A Framework for the Verification of Certifying Computations. CoRR abs/1301.7462 (2013) - 2012
- [b1]Sascha Böhme:
Proving Theorems of Higher-Order Logic with SMT Solvers. Technical University Munich, 2012 - 2011
- [j3]Eyad Alkassar, Sascha Böhme, Kurt Mehlhorn, Christine Rizkallah, Pascal Schweitzer
:
An Introduction to Certifying Algorithms. it Inf. Technol. 53(6): 287-293 (2011) - [c8]Jasmin Christian Blanchette, Sascha Böhme, Lawrence C. Paulson
:
Extending Sledgehammer with SMT Solvers. CADE 2011: 116-130 - [c7]Sascha Böhme, Michal Moskal:
Heaps and Data Structures: A Challenge for Automated Provers. CADE 2011: 177-191 - [c6]Eyad Alkassar, Sascha Böhme, Kurt Mehlhorn, Christine Rizkallah
:
Verification of Certifying Computations. CAV 2011: 67-82 - [c5]Sascha Böhme, Anthony C. J. Fox, Thomas Sewell, Tjark Weber:
Reconstruction of Z3's Bit-Vector Proofs in HOL4 and Isabelle/HOL. CPP 2011: 183-198 - [c4]Sascha Böhme, Tjark Weber:
Designing Proof Formats: A User's Perspective. PxTP 2011: 27-32 - 2010
- [j2]Sascha Böhme, Michal Moskal
, Wolfram Schulte, Burkhart Wolff:
HOL-Boogie - An Interactive Prover-Backend for the Verifying C Compiler. J. Autom. Reason. 44(1-2): 111-144 (2010) - [c3]Sascha Böhme, Tobias Nipkow
:
Sledgehammer: Judgement Day. IJCAR 2010: 107-121 - [c2]Sascha Böhme, Tjark Weber:
Fast LCF-Style Proof Reconstruction for Z3. ITP 2010: 179-194
2000 – 2009
- 2008
- [c1]Sascha Böhme, K. Rustan M. Leino, Burkhart Wolff:
HOL-Boogie - An Interactive Prover for the Boogie Program-Verifier. TPHOLs 2008: 150-166 - 2007
- [j1]Sascha Böhme:
Much Ado About Two. Arch. Formal Proofs 2007 (2007)
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
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.
last updated on 2024-08-05 20:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint