ACM Transactions on Computer Systems (TOCS)
Reasoning about knowledge
Term rewriting and all that
Fundamentals of Algebraic Specification I
Fundamentals of Algebraic Specification I
A Practical Secret Voting Scheme for Large Scale Elections
ASIACRYPT '92 Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Distributed Processes and the Logic of Knowledge
Proceedings of the Conference on Logic of Programs
Anonymity and information hiding in multiagent systems
Journal of Computer Security
A Complete Axiomatization of Knowledge and Cryptography
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Perfect cryptography, S5 knowledge, and algorithmic knowledge
TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
Verification of the TESLA protocol in MCMAS-X
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
MCMAS: A Model Checker for the Verification of Multi-Agent Systems
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Verifying privacy-type properties of electronic voting protocols
Journal of Computer Security
Computing Knowledge in Security Protocols under Convergent Equational Theories
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Anonymity, Privacy, Onymity, and Identity: A Modal Logic Approach
CSE '09 Proceedings of the 2009 International Conference on Computational Science and Engineering - Volume 03
Model checking detectability of attacks in multiagent systems
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
DALT'05 Proceedings of the Third international conference on Declarative Agent Languages and Technologies
Verifying fault tolerance and self-diagnosability of an autonomous underwater vehicle
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
| Hi-index | 0.00 |
We present a methodology for the automatic verification of multi-agent systems against temporal-epistemic specifications derived from higher-level languages defined over convergent equational theories. We introduce a modality called rewriting knowledge that operates on local equalities. We discuss the conditions under which its interpretation can be approximated by a second modality that we introduce called empirical knowledge. Empirical knowledge is computationally attractive from a verification perspective. We report on an implementation of a technique to verify this modality with the open source model checker mcmas. We evaluate the approach by verifying multi-agent models of electronic voting protocols automatically extracted from high-level descriptions.