#### Filter Results:

- Full text PDF available (121)

#### Publication Year

1983

2017

- This year (3)
- Last 5 years (47)
- Last 10 years (84)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Tobias Nipkow, Lawrence C. Paulson, Markus Wenzel
- Lecture Notes in Computer Science
- 2002

Want to get experience? Want to get any ideas to create new things in your life? Read isabelle hol a proof assistant for higher order logic now! By reading this book as soon as possible, you can renew the situation to get the inspirations. Yeah, this way will lead you to always think more and more. In this case, this book will be always right for you. When… (More)

- Tobias Nipkow
- LICS
- 1991

- Gerwin Klein, Tobias Nipkow
- ACM Trans. Program. Lang. Syst.
- 2006

We introduce Jinja, a Java-like programming language with a formal semantics designed to exhibit core features of the Java language architecture. Jinja is a compromise between the realism of the language and the tractability and clarity of its formal semantics. The following aspects are formalised: a big and a small step operational semantics for Jinja and… (More)

- Farhad Mehta, Tobias Nipkow
- CADE
- 2003

This paper develops sound modelling and reasoning methods for imperative programs with pointers: heaps are modelled as mappings from addresses to values, and pointer structures are mapped to higherlevel data types for verification. The programming language is embedded in higher-order logic, its Hoare logic is derived. The whole development is purely… (More)

Anecdotal evidence suggests that most “theorems” initially given to an interactive theorem prover do not hold, typically because of a typo or a missing assumption, but sometimes because of a deep flaw. Modern proof assistants for higher-order logic (HOL) provide counterexample generators that can be run on putative theorems or on specific subgoals in a… (More)

- Richard Mayr, Tobias Nipkow
- Theor. Comput. Sci.
- 1998

- Markus Wenzel, Lawrence C. Paulson, Tobias Nipkow
- TPHOLs
- 2008

Isabelle, which is available from http://isabelle.in.tum.de, is a generic framework for interactive theorem proving. The Isabelle/Pure meta-logic allows the formalization of the syntax and inference rules of a broad range of object-logics following the general idea of natural deduction [32, 33]. The logical core is implemented according to the well-known… (More)

- Olaf Müller, Tobias Nipkow, David von Oheimb, Oscar Slotosch
- J. Funct. Program.
- 1999

HOLCF is the de nitional extension of Church s Higher Order Logic with Scott s Logic for Computable Functions that has been implemented in the theorem prover Isabelle This results in a exible setup for reasoning about functional programs HOLCF supports stan dard domain theory in particular xpoint reasoning and recursive domain equations but also coinductive… (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 largest and most detailed empirical evaluation of such a link to date. Our test data consists of 1240 proof goals arising in 7 diverse Isabelle theories, thus… (More)