Guttman presented a model-theoretic approach to establishing security goals in the context of strand space theory. In his approach, a run of the Cryptographic Protocol Shapes Analyzer (cpsa) produces models that determine if a goal is satised. This paper presents a method for extracting a sentence that completely characterizes a run of cpsa. Logical deduction can then be used to determine if a goal is satised. This method has been implemented and is available to all.
['John D. Ramsdell']
Deducing Security Goals From Shape Analysis Sentences