Declaratively building behavior by means of scenario clauses

In this work we present the article “Declaratively building behavior by means of scenario clauses”. This article was accepted in January 2016 in the journal “Requirements Engineering”, ISSN: 0947-3602 (http://link.springer.com/journal/766).Sociedad Argentina de Informática e Investigación Operativa (SADIO

Declaratively building behavior by means of scenario clauses

In this work we present the article “Declaratively building behavior by means of scenario clauses”. This article was accepted in January 2016 in the journal “Requirements Engineering”, ISSN: 0947-3602 (http://link.springer.com/journal/766).Sociedad Argentina de Informática e Investigación Operativa (SADIO

Declaratively building behavior by means of scenario clauses

In this work we present the article “Declaratively building behavior by means of scenario clauses”. This article was accepted in January 2016 in the journal “Requirements Engineering”, ISSN: 0947-3602 (http://link.springer.com/journal/766).Sociedad Argentina de Informática e Investigación Operativa (SADIO

Aspect Oriented Behavioral Synthesis

Modern modularization techniques such as Aspect Orientation require powerful and expressive enough specification languages in order to conceive the development of a system as the combination of the different views it is composed of. In this work we present FVS as an aspect oriented language where the composition of individual aspects is achieved employing behavioral synthesis. As a distinctive feature, our approach can handle properties denoted by non deterministic Büchi automata. A case of study is introduced to show our approach in action.XVI Workshop Ingeniería de Software.Red de Universidades con Carreras en Informátic

Aspect Oriented Behavioral Synthesis

Modern modularization techniques such as Aspect Orientation require powerful and expressive enough specification languages in order to conceive the development of a system as the combination of the different views it is composed of. In this work we present FVS as an aspect oriented language where the composition of individual aspects is achieved employing behavioral synthesis. As a distinctive feature, our approach can handle properties denoted by non deterministic Büchi automata. A case of study is introduced to show our approach in action.XVI Workshop Ingeniería de Software.Red de Universidades con Carreras en Informátic

Aspect Oriented Behavioral Synthesis

Modern modularization techniques such as Aspect Orientation require powerful and expressive enough specification languages in order to conceive the development of a system as the combination of the different views it is composed of. In this work we present FVS as an aspect oriented language where the composition of individual aspects is achieved employing behavioral synthesis. As a distinctive feature, our approach can handle properties denoted by non deterministic Büchi automata. A case of study is introduced to show our approach in action.XVI Workshop Ingeniería de Software.Red de Universidades con Carreras en Informátic

Network-wide Configuration Synthesis

Computer networks are hard to manage. Given a set of high-level requirements (e.g., reachability, security), operators have to manually figure out the individual configuration of potentially hundreds of devices running complex distributed protocols so that they, collectively, compute a compatible forwarding state. Not surprisingly, operators often make mistakes which lead to downtimes. To address this problem, we present a novel synthesis approach that automatically computes correct network configurations that comply with the operator's requirements. We capture the behavior of existing routers along with the distributed protocols they run in stratified Datalog. Our key insight is to reduce the problem of finding correct input configurations to the task of synthesizing inputs for a stratified Datalog program. To solve this synthesis task, we introduce a new algorithm that synthesizes inputs for stratified Datalog programs. This algorithm is applicable beyond the domain of networks. We leverage our synthesis algorithm to construct the first network-wide configuration synthesis system, called SyNET, that support multiple interacting routing protocols (OSPF and BGP) and static routes. We show that our system is practical and can infer correct input configurations, in a reasonable amount time, for networks of realistic size (> 50 routers) that forward packets for multiple traffic classes.Comment: 24 Pages, short version published in CAV 201

Evaluating Knowledge Representation and Reasoning Capabilites of Ontology Specification Languages

The interchange of ontologies across the World Wide Web (WWW) and the cooperation among heterogeneous agents placed on it is the main reason for the development of a new set of ontology specification languages, based on new web standards such as XML or RDF. These languages (SHOE, XOL, RDF, OIL, etc) aim to represent the knowledge contained in an ontology in a simple and human-readable way, as well as allow for the interchange of ontologies across the web. In this paper, we establish a common framework to compare the expressiveness of "traditional" ontology languages (Ontolingua, OKBC, OCML, FLogic, LOOM) and "web-based" ontology languages. As a result of this study, we conclude that different needs in KR and reasoning may exist in the building of an ontology-based application, and these needs must be evaluated in order to choose the most suitable ontology language(s)