Sciweavers

125 search results - page 15 / 25
» Importing HOL into Isabelle HOL
Sort
View
TYPES
2000
Springer
13 years 11 months ago
Executing Higher Order Logic
We report on the design of a prototyping component for the theorem prover Isabelle/HOL. Specifications consisting of datatypes, recursive functions and inductive definitions are co...
Stefan Berghofer, Tobias Nipkow
ENTCS
2008
104views more  ENTCS 2008»
13 years 7 months ago
A Logic for Virtual Memory
We present an extension to classical separation logic which allows reasoning about virtual memory. Our logic is formalised in the Isabelle/HOL theorem prover in a manner allowing ...
Rafal Kolanski
JAPLL
2006
87views more  JAPLL 2006»
13 years 7 months ago
Is ZF a hack?: Comparing the complexity of some (formalist interpretations of) foundational systems for mathematics
This paper presents Automath encodings (which also are valid in LF/P) of various kinds of foundations of mathematics. Then it compares these encodings according to their size, to f...
Freek Wiedijk
CSL
2002
Springer
13 years 7 months ago
Hoare Logics for Recursive Procedures and Unbounded Nondeterminism
This paper presents sound and complete Hoare logics for partial and total correctness of recursive parameterless procedures in the context of unbounded nondeterminism. For total co...
Tobias Nipkow
LPAR
2010
Springer
13 years 5 months ago
Generating Counterexamples for Structural Inductions by Exploiting Nonstandard Models
Induction proofs often fail because the stated theorem is noninductive, in which case the user must strengthen the theorem or prove auxiliary properties before performing the induc...
Jasmin Christian Blanchette, Koen Claessen