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...
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...
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 ...
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...
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...