Sciweavers

307 search results - page 46 / 62
» Formalizing Communication Protocols for Multiagent Systems
Sort
View
78
Voted
FSTTCS
2003
Springer
15 years 3 months ago
Tagging Makes Secrecy Decidable with Unbounded Nonces as Well
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...
Ramaswamy Ramanujam, S. P. Suresh
CSUR
1999
114views more  CSUR 1999»
14 years 9 months ago
Directions for Research in Approximate System Analysis
useful for optimizing compilers [15], partial evaluators [11], abstract debuggers [1], models-checkers [2], formal verifiers [13], etc. The difficulty of the task comes from the fa...
Patrick Cousot
CCS
2006
ACM
15 years 1 months ago
Replayer: automatic protocol replay by binary analysis
We address the problem of replaying an application dialog between two hosts. The ability to accurately replay application dialogs is useful in many security-oriented applications,...
James Newsome, David Brumley, Jason Franklin, Dawn...
ISOLA
2010
Springer
14 years 8 months ago
Towards a Connector Algebra
Interoperability of heterogeneous networked systems has yet to reach the maturity required by ubiquitous computing due to the technology-dependent nature of solutions. The Connect ...
Marco Autili, Chris Chilton, Paola Inverardi, Mart...
ARGMAS
2005
Springer
15 years 3 months ago
Practical Strategic Reasoning and Adaptation in Rational Argument-Based Negotiation
Recent years have seen an increasing interest of multiagent system research in employing the theory of argumentation for the development of communication protocols. While signific...
Michael Rovatsos, Iyad Rahwan, Felix A. Fischer, G...