Sciweavers

265 search results - page 8 / 53
» How to Prove Inductive Theorems
Sort
View
ENTCS
2006
169views more  ENTCS 2006»
13 years 7 months ago
Constructing Induction Rules for Deductive Synthesis Proofs
We describe novel computational techniques for constructing induction rules for deductive synthesis proofs. Deductive synthesis holds out the promise of automated construction of ...
Alan Bundy, Lucas Dixon, Jeremy Gow, Jacques D. Fl...
CADE
2008
Springer
14 years 8 months ago
Automated Induction with Constrained Tree Automata
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
Adel Bouhoula, Florent Jacquemard
LICS
1999
IEEE
13 years 12 months ago
Proving Security Protocols Correct
Security protocols use cryptography to set up private communication channels on an insecure network. Many protocols contain flaws, and because security goals are seldom specified ...
Lawrence C. Paulson
HICSS
1994
IEEE
105views Biometrics» more  HICSS 1994»
13 years 11 months ago
A Methodology for Equational Reasoning
1 This paper presents a methodology to guide equational reasoning in a goal directed way. Suggested by rippling methods developed in the eld of inductive theorem proving we use att...
Jürgen Cleve, Dieter Hutter
TCS
2008
13 years 7 months ago
Polyhedra genus theorem and Euler formula: A hypermap-formalized intuitionistic proof
This article presents formalized intuitionistic proofs for the polyhedra genus theorem, the Euler formula and a sufficient condition of planarity. They are based on a hypermap mod...
Jean-François Dufourd