AVISPA is a push-button tool for the automated validation of Internet security-sensitive protocols and applications. It provides a modular and expressive formal language for specifying protocols and their security properties, and integrates different back-ends that implement a variety of state-of-the-art automatic analysis techniques. To the best of our knowledge, no other tool exhibits the same level of scope and robustness while enjoying the same performance and scalability.

/pdf/the-avispa-tool-for-the-automated-validation-of-internet-3vrfo48pll.pdf

The AVISPA tool for the automated validation of internet security protocols and applications

Computational social choice is an interdisciplinary field of study at the interface of social choice theory and computer science, promoting an exchange of ideas in both directions. On the one hand, it is concerned with the application of techniques developed in computer science, such as complexity analysis or algorithm design, to the study of social choice mechanisms, such as voting procedures or fair division algorithms. On the other hand, computational social choice is concerned with importing concepts from social choice theory into computing. For instance, the study of preference aggregation mechanisms is also very relevant to multiagent systems. In this short paper we give a general introduction to computational social choice, by proposing a taxonomy of the issues addressed by this discipline, together with some illustrative examples and an (incomplete) bibliography.

/pdf/a-short-introduction-to-computational-social-choice-32d5c331we.pdf

A Short Introduction to Computational Social Choice

https://www.inf.unibz.it/~okutz/resources/connections_JAI.pdf

ε-connections of abstract description systems

In this tutorial, we give an overview of the Maude-NRL Protocol Analyzer (Maude-NPA), a tool for the analysis of cryptographic protocols using functions that obey different equational theories. We show the reader how to use Maude-NPA, and how it works, and also give some of the theoretical background behind the tool.

/pdf/maude-npa-cryptographic-protocol-analysis-modulo-equational-wt14nh7q68.pdf

Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties

In this paper we present a fuzzy version of $\mathcal{SHOIN}$(D), the corresponding Description Logic of the ontology description language OWL DL. We show that the representation and reasoning capabilities of fuzzy $\mathcal{SHOIN}$(D) go clearly beyond classical $\mathcal{SHOIN}$(D). We present its syntax and semantics. Interesting features are that concrete domains are fuzzy and entailment and subsumption relationships may hold to some degree in the unit interval [0,1].

/pdf/towards-a-fuzzy-description-logic-for-the-semantic-web-4nb4igxktj.pdf

Towards a fuzzy description logic for the semantic web (preliminary report)

We introduce a family of languages intended for representing knowledge and reasoning about metric (and more general distance) spaces. While the simplest language can speak only about distances between individual objects and Boolean relations between sets, the more expressive ones are capable of capturing notions such as 'somewhere in (or somewhere out of) the sphere of a certain radius', 'everywhere in a certain ring', etc. The computational complexity of the satisfiability problem for formulas in our languages ranges from NP-completeness to undecidability and depends on the class of distance spaces in which they are interpreted. Besides the class of all metric spaces, we consider, for example, the spaces R × R and N × N with their natural metrics.

Nobu-Yuki Suzuki

Papers

Semi-qualitative Reasoning about Distances: A Preliminary Report