Algorithmic aspects of some protocol verification logics

Loading...
Thumbnail Image

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

We show that 1. in first-order modal logic of Coffey and Saidha, it is undecidable whether a given protocol specification is valid 2. The language of valid protocol specifications is not even recursively enumerable over integer time 3. Over dense time it is recursively enumerable. We also give a semantics for that logic.

Description

Citation

Endorsement

Review

Supplemented By

Referenced By