Reasoning on Robot Knowledge from Discrete and Asynchronous Observations

in AAAI Spring Symposium 2014: Knowledge Representation and Reasoning in Robotics, Stanford, USA, 2015 (2014, March)

Robot knowledge of the world is created from discrete and asynchronous events received from its perception components. Proper representation and maintenance of robot knowledge is crucial to enable the use ... [more ▼]

Robot knowledge of the world is created from discrete and asynchronous events received from its perception components. Proper representation and maintenance of robot knowledge is crucial to enable the use of robot knowledge for planning, user-interaction, etc. This paper identifies some of the main issues related to the representation, maintenance and querying of robot knowledge based on discrete asynchronous events such as event-history management and synchronization, and introduces a language for simplifying developers’ job at making a suitable representation of robot knowledge. [less ▲]

A Flexible MDE approach to Enforce Fine- grained Security Policies

in Proceedings of the International Symposium on Engineering Secure Software and Systems (2014)

In this paper, we present a policy-based approach for au- tomating the integration of security mechanisms into Java-based business applications. In particular, we introduce an expressive Domain Specific ... [more ▼]

In this paper, we present a policy-based approach for au- tomating the integration of security mechanisms into Java-based business applications. In particular, we introduce an expressive Domain Specific modeling Language (Dsl), called Security@Runtime, for the specification of security configurations of targeted systems. The Security@Runtime Dsl supports the expression of authorization, obligation and reaction policies, covering many of the security requirements of modern applica- tions. Security requirements specified in security configurations are en- forced using an application-independent Policy Enforcement Point (Pep)- Policy Decision Point (Pdp) architecture, which enables the runtime up- date of security requirements. Our work is evaluated using two systems and its advantages and limitations are discussed [less ▲]

Argument Revival in Annotated Argumentation Networks

Scientific Conference (2013, December)

This work explores the revival of arguments in abstract argumentation theory. A revived argument is an argument that is put forward in a specific context, but is somehow put aside because it did not seem ... [more ▼]

This work explores the revival of arguments in abstract argumentation theory. A revived argument is an argument that is put forward in a specific context, but is somehow put aside because it did not seem relevant to the discussion or it has been denied, and then becomes useful in another context when a similar argument emerges. We obtain necessary conditions for argument revival using real-world examples and show that a recently proposed temporal argumentation framework cannot account for argument revival. Next, we propose an algorithm for argument revival that uses arguments annotated by a context label. This algorithm determines what arguments can be revived using the context neighborhood, the attack relations and a revival policy. [less ▲]

Revival of Arguments in Temporal Argumentation Networks

Poster (2013, July 04)

Testing obligation policy enforcement using mutation analysis

in Proceedings - IEEE 5th International Conference on Software Testing, Verification and Validation, ICST 2012 (2012)

The support of obligations with access control policies allows the expression of more sophisticated requirements such as usage control, availability and privacy. In order to enable the use of these ... [more ▼]

The support of obligations with access control policies allows the expression of more sophisticated requirements such as usage control, availability and privacy. In order to enable the use of these policies, it is crucial to ensure their correct enforcement and management in the system. For this reason, this paper introduces a set of mutation operators for obligation policies. The paper first identifies key elements in obligation policy management, then presents mutation operators which injects minimal errors which affect these aspects. Test cases are qualified w.r.t. their ability in detecting problems, simulated by mutation, in the interactions between policy management and the application code. The use of policy mutants as substitutes for real flaws enables a first investigation of testing obligation policies in a system. We validate our work by providing an implementation of the mutation process: the experiments conducted on a Java program provide insights for improving test selection. © 2012 IEEE. [less ▲]