65 search results - page 9 / 13 » Matrix-Based Inductive Theorem Proving |
JCS
2010
13 years 6 months ago
2010
Protocol authentication properties are generally trace-based, meaning that authentication holds for the protocol if authentication holds for individual traces (runs of the protoco...
TPHOL
2005
IEEE
14 years 1 months ago
2005
IEEE
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...
JLP
2007
13 years 7 months ago
2007
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...
TACAS
2009
Springer
14 years 2 months ago
2009
Springer
We introduce the All-Termination(T) problem: given a termination solver, T, and a program (a set of functions), find every set of formal arguments whose consideration is sufficie...
JUCS
2006
13 years 7 months ago
2006
: We present a tutorial of the ITP tool, a rewriting-based theorem prover that can be used to prove inductive properties of membership equational specifications. We also introduce ...