Sciweavers

265 search results - page 14 / 53
» How to Prove Inductive Theorems
Sort
View
TPHOL
2005
IEEE
14 years 1 months ago
Alpha-Structural Recursion and Induction
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...
Andrew M. Pitts
JLP
2007
114views more  JLP 2007»
13 years 7 months ago
Deaccumulation techniques for improving provability
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...
Jürgen Giesl, Armin Kühnemann, Janis Voi...
INFOCOM
2002
IEEE
14 years 17 days ago
Real-time Model and Convergence Time of BGP
—BGP allows routers to use general preference policies for route selection. This paper studies the impact of these policies on convergence time. We first describe a real-time mo...
Davor Obradovic
TPHOL
2007
IEEE
14 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
SYNTHESE
2008
88views more  SYNTHESE 2008»
13 years 7 months ago
Interpolation in computing science: the semantics of modularization
The Interpolation Theorem, first formulated and proved by W. Craig fifty years ago for predicate logic, has been extended to many other logical frameworks and is being applied in s...
Gerard R. Renardel de Lavalette