Sciweavers

Share
LPAR
2012
Springer
7 years 2 months ago
Smart Testing of Functional Programs in Isabelle
Abstract. We present a novel counterexample generator for the interactive theorem prover Isabelle based on a compiler that synthesizes test data generators for functional programmi...
Lukas Bulwahn
CADE
2010
Springer
8 years 8 months ago
Sledgehammer: Judgement Day
Abstract. 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 a...
Sascha Böhme, Tobias Nipkow
AISC
2004
Springer
8 years 11 months ago
Four Approaches to Automated Reasoning with Differential Algebraic Structures
While implementing a proof for the Basic Perturbation Lemma (a central result in Homological Algebra) in the theorem prover Isabelle one faces problems such as the implementation o...
Jesús Aransay, Clemens Ballarin, Julio Rubi...
TAPSOFT
1997
Springer
8 years 11 months ago
Traces of I/O-Automata in Isabelle/HOLCF
Abstract. This paper presents a formalization of nite and in nite sequences in domain theory carried out in the theorem prover Isabelle. The results are used to model the metatheor...
Olaf Müller, Tobias Nipkow
CAV
1998
Springer
100views Hardware» more  CAV 1998»
8 years 11 months ago
Mechanising BAN Kerberos by the Inductive Method
The version of Kerberos presented by Burrows et al. [5] is fully mechanised using the Inductive Method. Two models are presented, allowing respectively the leak of any session keys...
Giampaolo Bella, Lawrence C. Paulson
CADE
1998
Springer
8 years 11 months ago
A Combination of Nonstandard Analysis and Geometry Theorem Proving, with Application to Newton's Principia
Abstract. The theorem prover Isabelle is used to formalise and reproduce some of the styles of reasoning used by Newton in his Principia. The Principia's reasoning is resolute...
Jacques D. Fleuriot, Lawrence C. Paulson
AISC
2010
Springer
8 years 11 months ago
Structured Formal Development with Quotient Types in Isabelle/HOL
General purpose theorem provers provide sophisticated proof methods, but lack some of the advanced structuring mechanisms found in specification languages. This paper builds on pr...
Maksym Bortin, Christoph Lüth
TPHOL
2000
IEEE
8 years 11 months ago
Proof Terms for Simply Typed Higher Order Logic
Abstract. This paper presents proof terms for simply typed, intuitionistic higher order logic, a popular logical framework. Unification-based algorithms for the compression and re...
Stefan Berghofer, Tobias Nipkow
TPHOL
2007
IEEE
9 years 1 months ago
Formalising Generalised Substitutions
Abstract. We use the theorem prover Isabelle to formalise and machinecheck results of the theory of generalised substitutions given by Dunne and used in the B method. We describe t...
Jeremy E. Dawson
CADE
2003
Springer
9 years 7 months ago
IsaPlanner: A Prototype Proof Planner in Isabelle
IsaPlanner is a generic framework for proof planning in the interactive theorem prover Isabelle. It facilitates the encoding of reasoning techniques, which can be used to conjectur...
Lucas Dixon, Jacques D. Fleuriot
books