#### Filter Results:

- Full text PDF available (20)

#### Publication Year

2006

2017

- This year (4)
- Last 5 years (16)
- Last 10 years (26)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Lukas Bulwahn, Alexander Krauss, Florian Haftmann, Levent ErkÃ¶k, John Matthews
- TPHOLs
- 2008

We introduce a lightweight approach for reasoning about programs involving imperative data structures using the proof assistant Isabelle/HOL. It is based on shallow embedding of programs, aâ€¦ (More)

- Lukas Bulwahn
- CPP
- 2012

The new Quickcheck is a counterexample generator for Isabelle/HOL that uncovers faulty specifications and invalid conjectures using various testing strategies. The previous Quickcheck only testedâ€¦ (More)

- Jasmin Christian Blanchette, Lukas Bulwahn, Tobias Nipkow
- FroCoS
- 2011

Isabelle/HOL is a popular interactive theorem prover based on higherorder logic. It owes its success to its ease of use and powerful automation. Much of the automation is performed by external tools:â€¦ (More)

- Lukas Bulwahn
- LPAR
- 2012

We present a novel counterexample generator for the interactive theorem prover Isabelle based on a compiler that synthesizes test data generators for functional programming languages (e.g. ML,â€¦ (More)

- Stefan Berghofer, Lukas Bulwahn, Florian Haftmann
- TPHOLs
- 2009

Inductively defined predicates are frequently used in formal specifications. Using the theorem prover Isabelle, we describe an approach to turn a class of systems of inductively defined predicatesâ€¦ (More)

- Lukas Bulwahn, Alexander Krauss, Tobias Nipkow
- TPHOLs
- 2007

We present a simple method to formally prove termination of recursive functions by searching for lexicographic combinations of size measures. Despite its simplicity, the method turns out to beâ€¦ (More)

- Lukas Bulwahn
- 2012

The new Quickcheck is a counterexample generator for Isabelle/HOL that uncovers faulty specifications and invalid conjectures using various testing strategies. The previous Quickcheck only testedâ€¦ (More)

- Andreas Lochbihler, Lukas Bulwahn
- ITP
- 2011

Considerable effort has gone into the techniques of extracting executable code from formal specifications and animating them. We show how to apply these techniques to the large JinjaThreadsâ€¦ (More)

- Lukas Bulwahn
- ICLP
- 2011

We present a novel counterexample generator for the interactive theorem prover Isabelle based on a compiler that synthesizes test data generators for functional programming languages (e.g. Standardâ€¦ (More)

- Lukas Bulwahn
- 2012

This thesis presents a counterexample generator for the interactive theorem prover Isabelle/HOL that uncovers faulty specifications and invalid conjectures using various testing methods. The primaryâ€¦ (More)