Abstract. Many security protocols fundamentally depend on the algebraic properties of cryptographic operators. It is however difficult to handle these properties when formally anal...
We present a proof-technique for reducing the nondeterminbstract agent specifications in a BDI framework by means of refinement. We implement the operational semantics of agent sp...
Circular coinductive rewriting is a new method for proving behavioral properties, that combines behavioral rewriting with circular coinduction. This method is implemented in our n...