203 search results - page 25 / 41 » Datatype-Generic Termination Proofs |
150
click to vote
CSFW
1999
IEEE
15 years 8 months ago
1999
IEEE
Belief-logic deductions are used in the analysis of cryptographic protocols. We show a new method to decide such logics. In addition to the familiar BAN logic, it is also applicab...
134
click to vote
LICS
1999
IEEE
15 years 8 months ago
1999
IEEE
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by adapting the recursive path ordering definition to terms of a typed ...
147
click to vote
TABLEAUX
2009
Springer
15 years 11 months ago
2009
Springer
We define a notion of formula schema handling arithmetic parameters, indexed propositional variables (e.g. Pi) and iterated conjunctions/disjunctions (e.g. Vn i=1 Pi, where n is a...
129
click to vote
CSFW
2005
IEEE
15 years 10 months ago
2005
IEEE
We study an automatic technique for the verification of cryptographic protocols based on a Horn clause model of the protocol. This technique yields proofs valid for an unbounded ...
135
click to vote
ENTCS
2008
15 years 4 months ago
2008
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...