Decidable Inductive Invariants for Verification of Cryptographic Protocols with Unbounded Sessions

We develop a theory of decidable inductive invariants for an infinite-state variant of the Applied ?calc, with applications to automatic verification of stateful cryptographic protocols with unbounded sessions/nonces. Since the problem is undecidable in general, we introduce depth-bounded protocols, a strict generalisation of a class from the literature, for which our decidable analysis is sound and complete. Our core contribution is a procedure to check that an invariant is inductive, which implies that every reachable configuration satisfies it. Our invariants can capture security properties like secrecy, can be inferred automatically, and represent an independently checkable certificate of correctness. We provide a prototype implementation and we report on its performance on some textbook examples

Guest editorial

This special issue of Decision Making in Manufacturing and Services is devoted to Game Theory and Applications and related topics. The origin of the issue is the 10th Spain-Italy-Netherlands Meeting on Game Theory (SING10), which took place on 7th-9th July, 2014. The conference was hosted by the Faculty of Management at AGH University of Science and Technology in Kraków, Poland (main organizer was Izabella Stach). The history of the SING meetings started at the beginning of the 1980s with the first meetings held in Italy. Then, subsequently, meetings were added in Spain, the Netherlands and Poland. Nowadays SING is one of the most important international meetings on game theory organized each year in a European country.The SING10 meeting in 2014 attracted more than one hundred and ninety scientist from five continents. More about the SING meetings and in particular about SING10 can be funded in Gambarelli (2011) and Bertini et al. (2014). The submitted papers (139 presentations, 135 in parallel sessions and 4 in plenary sessions) covered a variety of topics on game theory and its applications. This special issue collects some surveys on recent results in different fields, presented in the conference

Systematic composition of distributed objects: Processes and sessions

We consider a system with the infrastructure for the creation and interconnection of large numbers of distributed persistent objects. This system is exemplified by the Internet: potentially, every appliance and document on the Internet has both persistent state and the ability to interact with large numbers of other appliances and documents on the Internet. This paper elucidates the characteristics of such a system, and proposes the compositional requirements of its corresponding infrastructure. We explore the problems of specifying, composing, reasoning about and implementing applications in such a system. A specific concern of our research is developing the infrastructure to support structuring distributed applications by using sequential, choice and parallel composition, in the anarchic environment where application compositions may be unforeseeable and interactions may be unknown prior to actually occurring. The structuring concepts discussed are relevant to a wide range of distributed applications; our implementation is illustrated with collaborative Java processes interacting over the Internet, but the methodology provided can be applied independent of specific platforms

Combining behavioural types with security analysis

Today's software systems are highly distributed and interconnected, and they increasingly rely on communication to achieve their goals; due to their societal importance, security and trustworthiness are crucial aspects for the correctness of these systems. Behavioural types, which extend data types by describing also the structured behaviour of programs, are a widely studied approach to the enforcement of correctness properties in communicating systems. This paper offers a unified overview of proposals based on behavioural types which are aimed at the analysis of security properties

The role of an omnipresent pocket device : smartphone attendance and the role of user habits

Smartphones are convergent, always-on pocket devices that have taken up an important role in the life of their users. This warrants a closer look into how this medium is used in every-day situations. Are goal-oriented incentives the main drive for smartphone usage, or do habits play a critical role? This study with 481 Belgian smartphone users attempts to describe the precedents of smartphone attendance by validating the model of media attendance (MMA), a social-cognitive theory of uses and gratifications (LaRose & Eastin, 2004). We surprisingly did not find evidence for a significant effect of habits on smartphone usage. We suggest two explanations. First, we suggest some uncertainties concerning the MMA methodology. Second, we suggest a more complex reality in which several habitual use patterns are shaped, dependent on user, context and device. This warrants a more in-depth study, using more advanced measures for smartphone usage and habit strength

A Modular Toolkit for Distributed Interactions

We discuss the design, architecture, and implementation of a toolkit which supports some theories for distributed interactions. The main design principles of our architecture are flexibility and modularity. Our main goal is to provide an easily extensible workbench to encompass current algorithms and incorporate future developments of the theories. With the help of some examples, we illustrate the main features of our toolkit.Comment: In Proceedings PLACES 2010, arXiv:1110.385