Towards a Formal Verification Methodology for Collective Robotic Systems

We introduce a UML-based notation for graphically modeling systems’ security aspects in a simple and intuitive way and a model-driven process that transforms graphical specifications of access control policies in XACML. These XACML policies are then translated in FACPL, a policy language with a formal semantics, and the resulting policies are evaluated by means of a Java-based software tool

Specifying and analysing reputation systems with coordination languages

Reputation systems are nowadays widely used to support decision making in networked systems. Parties in such systems rate each other and use shared ratings to compute reputation scores that drive their interactions. The existence of reputation systems with remarkable differences calls for formal approaches to their analysis. We present a verification methodology for reputation systems that is based on the use of the coordination language Klaim and related analysis tools. First, we define a parametric Klaim specification of a reputation system that can be instantiated with different reputation models. Then, we consider stochastic specification obtained by considering actions with random (exponentially distributed) duration. The resulting specification enables quantitative analysis of properties of the considered system. Feasibility and effectiveness of our proposal is demonstrated by reporting on the analysis of two reputation models

Swinging Atwood's Machine: Experimental and Theoretical Studies

A Swinging Atwood Machine (SAM) is built and some experimental results concerning its dynamic behaviour are presented. Experiments clearly show that pulleys play a role in the motion of the pendulum, since they can rotate and have non-negligible radii and masses. Equations of motion must therefore take into account the inertial momentum of the pulleys, as well as the winding of the rope around them. Their influence is compared to previous studies. A preliminary discussion of the role of dissipation is included. The theoretical behaviour of the system with pulleys is illustrated numerically, and the relevance of different parameters is highlighted. Finally, the integrability of the dynamic system is studied, the main result being that the Machine with pulleys is non-integrable. The status of the results on integrability of the pulley-less Machine is also recalled.Comment: 37 page

On algorithm and robustness in a non-standard sense

In this paper, we investigate the invariance properties, i.e. robust- ness, of phenomena related to the notions of algorithm, finite procedure and explicit construction. First of all, we provide two examples of objects for which small changes completely change their (non)computational behavior. We then isolate robust phenomena in two disciplines related to computability

Next Generation Evaluation: Embracing Complexity, Connectivity, and Change

This Learning Brief draws from literature and research, as well as more than a dozen interviews with foundation leaders, evaluation practitioners, and social sector thought leaders, with the intention of starting the conversation in the field around Next Generation Evaluation characteristics and approaches

A library of Taylor models for PVS automatic proof checker

We present in this paper a library to compute with Taylor models, a technique extending interval arithmetic to reduce decorrelation and to solve differential equations. Numerical software usually produces only numerical results. Our library can be used to produce both results and proofs. As seen during the development of Fermat's last theorem reported by Aczel 1996, providing a proof is not sufficient. Our library provides a proof that has been thoroughly scrutinized by a trustworthy and tireless assistant. PVS is an automatic proof assistant that has been fairly developed and used and that has no internal connection with interval arithmetic or Taylor models. We built our library so that PVS validates each result as it is produced. As producing and validating a proof, is and will certainly remain a bigger task than just producing a numerical result our library will never be a replacement to imperative implementations of Taylor models such as Cosy Infinity. Our library should mainly be used to validate small to medium size results that are involved in safety or life critical applications