#### Filter Results:

- Full text PDF available (19)

#### Publication Year

1988

2015

- This year (0)
- Last 5 years (8)
- Last 10 years (22)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Jasmin Christian Blanchette, Sascha Böhme, Lawrence C. Paulson
- Journal of Automated Reasoning
- 2011

Sledgehammer is a component of Isabelle/HOL that employs resolution-based first-order automatic theorem provers (ATPs) to discharge goals arising in interactive proofs. It heuristically selects… (More)

- Sascha Böhme, Tobias Nipkow
- IJCAR
- 2010

Sledgehammer, a component of the interactive theorem prover Isabelle, finds proofs in higher-order logic by calling the automated provers for first-order logic E, SPASS and Vampire. This paper is the… (More)

- Sascha Böhme, Tjark Weber
- ITP
- 2010

The Satisfiability Modulo Theories (SMT) solver Z3 can generate proofs of unsatisfiability. We present independent reconstruction of these proofs in the theorem provers Isabelle/HOL and HOL4 with… (More)

The Satisfiability Modulo Theories (SMT) solver Z3 can generate proofs of unsatisfiability. We present independent reconstruction of unsatisfiability proofs for bit-vector theories in the theorem… (More)

- Sascha Böhme, Till Weber
- 2011

Automatic provers that can produce proof certificates do not need to be trusted. The certificate can be checked by an independent tool, for example an LCF-style proof assistant such as Isabelle/ HOL… (More)

Most automatic theorem provers are restricted to untyped logics, and existing translations from typed logics are bulky or unsound. Recent research proposes monotonicity as a means to remove some… (More)

- Sascha Böhme, Michal Moskal, Wolfram Schulte, Burkhart Wolff
- Journal of Automated Reasoning
- 2009

Boogie is a verification condition generator for an imperative core language. It has front-ends for the programming languages C# and C enriched by annotations in first-order logic, i.e. pre- and… (More)

- Sascha Böhme
- 2009

Currently, only a few Satisfiability Modulo Theories (SMT) solvers are able to produce proof objects, although there is a strong incentive: Proof objects can be reconstructed in a different system to… (More)

- Jasmin Christian Blanchette, Sascha Böhme, Mathias Fleury, Steffen Juilf Smolka, Albert Steckermeier
- Journal of Automated Reasoning
- 2015

Sledgehammer is a component of the Isabelle/HOL proof assistant that integrates external automatic theorem provers (ATPs) to discharge interactive proof obligations. As a safeguard against bugs, the… (More)

- Sascha Böhme, Michal Moskal
- CADE
- 2011

Software verification is one of the most prominent application areas for automatic reasoning systems, but their potential improvement is limited by shortage of good benchmarks. Current benchmarks are… (More)