Completeness and Counter-Example Generations of a Basic Protocol Logic: (Extended Abstract)


We give an axiomatic system in first-order predicate logic with equality for proving security protocols correct. Our axioms and inference rules derive the basic inference rules, which are explicitly or implicitly used in the literature of protocol logics, hence we call our axiomatic system Basic Protocol Logic (or BPL, for short). We give a formal semantics… (More)
DOI: 10.1016/j.entcs.2005.06.038