D. Miller. Higher-order quantification and proof search. In Proceedings of the AMAST confrerence, LNCS. Springer, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Encryption as an abstract data-type: An extended abstract - Miller (2003) (1 citation) (Correct)
....for #, #, and # conversions are assumed, although no other equations on the type data are assumed. As 3 is customary with typed incorporating # terms, # is assumed since there seems to be no good reason to distinguish, say, the encryption key k form the expression (#w. kw) As discussed in [25], higher order quantification can add greatly to the expressive strength of specification, but when done carefully, it does not need to add to the complexity of proof search. The remaining constructor for the type data is # of type data) data and this is used to coerce an encryption key ....
D. Miller. Higher-order quantification and proof search. In H. Kirchner and C. Ringeissen, editors, Proceedings of AMAST 2002.
Relating Multiset Rewriting and Process - Algebras For Security (Correct)
No context found.
D. Miller. Higher-order quantification and proof search. In Proceedings of the AMAST confrerence, LNCS. Springer, 2002.
Relating Process Algebras and Multiset Rewriting.. - Bistarelli.. (2002) (Correct)
No context found.
D. Miller. Higher-order quantification and proof search. In Proceedings of the AMAST confrerence, LNCS. Springer, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC