SKY 2012 Abstracts


Full Papers
Paper Nr: 2
Title:

Attacking Software Knowledge Erosion with Gamification

Authors:

Jan Nonnen

Abstract: In software development, every developer gains implicit software knowledge. This knowledge may get lost or forgotten over time. Knowledge erosion, however, can be countered by learning about code and concepts. In order to achieve this, we propose the use of game elements in a development environment. Games have already been used successfully to motivate learners. New team members could also benefit from the approach presented. We discuss future research and present initial solutions.

Paper Nr: 3
Title:

Assisted Software Exploration using Formal Concept Analysis

Authors:

Paul Heckmann and Daniel Speicher

Abstract: Program comprehension requires understanding the structures within the program. Some of these structures are created intentionally and well known (design pattern), others arise implicitly but are still meaningful, and finally some structures emerge accidentally without any meaning. We build on a previously suggested approach to mine structures in software using Formal Concept Analysis. In contrast to previous work, we found the performance of our tool to be still acceptable for projects of interesting size (600 classes). A prominence index for classes based on the formal concepts proved to be helpful for the identification of core structures (high prominence) as well for focusing on specific structures (low prominence). We report about two experiments. In the first the tool guided the experimenter to central structures of JUnit as documented before but unknown by the experimenter. In the second the tool led us to the core structures of our own software.

Paper Nr: 4
Title:

ROM: A Runnable Ontology Model Testing Tool

Authors:

Iaakov Exman and Reuven Yagel

Abstract: In the quest for the highest possible abstraction of software systems, Runnable Knowledge has been proposed for MDA. But in order to test in practice such a system design one needs to actually run the model. This work precisely describes the necessary steps by which ROM – a Runnable Ontology Model tool – automatically generates a running model from the designed Runnable Knowledge. The novel idea is to use ready-made mock object libraries to efficiently obtain the running model code. The tool feasibility is demonstrated by substituting its modules by the semi-automatic concatenation of existing tools, each performing the role of one of its modules. Detailed examples are provided to illustrate each of the ROM generation steps.

Paper Nr: 5
Title:

Case based Reasoning Approach for Re-use Activities

Authors:

M. Zinn, K. P. Fischer-Hellmann and Ronald Schoop

Abstract: The development of software applications is partly or entirely based on the re-use of software units. For software engineers, this leads to the problem that it is not possible to know all processes, technologies and supporting applications and the alternatives needed for the re-use of a software unit. As a result software engineers are not able to employ the most optimal solution known. Based on case based reasoning this paper outlines a way to use the stored knowledge of a specific re-use activity in order to give software engineers assistance if they want to perform similar activities. This solution consists of a proposal system for a re-use activity information system. The publication concludes with the result that it is possible to re-use, within a given an environment, specific knowledge for other integration activities.

Paper Nr: 7
Title:

An Approach to Simplify Navigation within Ontologies

Authors:

Karina Robles, Alejandro Ruiz, Anabel Fraga and Juan Llorens

Abstract: Semantic Web technologies have contributed mainly to organize the knowledge and to search about this organized knowledge. One of the most complex search is to know if two entities are related within a ontology. These are called Semantic Associations, which have been classified using ρ operators: ρ-path, ρ-join and ρ-iso. Then, a ρ-query will solve any of them. Studies about this area offer low performance execution times, but others increase the performance with pre-processing, making use of complex structures in memory. In this paper, we present semantic associations and analyze related studies. We focus on design a simplified representation of the ontology that facilitates the navigation and reduce the algorithms complexity to solve these operators, starting from the first of them: ρ-path.

Paper Nr: 8
Title:

The Interestingness Tool for Search in the Web

Authors:

Iaakov Exman, Gilad Amar and Ran Shaltiel

Abstract: Interestingness – as the composition of Relevance and Unexpectedness – has been tested by means of Web search cases studies and led to promising results. But for thorough investigation and routine practical application one needs a flexible and robust tool. This work describes such an Interestingness based search tool, its software architecture and actual implementation. One of its flexibility traits is the choice of Interestingness functions: it may work with Match-Mismatch and Tf-Idf, among other functions. The tool has been experimentally verified by application to various domains of interest. It has been validated by comparison of results with those of commercial search engines and results from differing Interestingness functions.

Short Papers
Paper Nr: 11
Title:

Applying Executable Specifications - (A Short Project Summary & Survey)

Authors:

Reuven Yagel and Ori Sarig

Abstract: This paper summarizes a student graduation project concerning applying executable specifications. It reviews some of the advantages of executable specifications and how it could help the communication between the developer, the software tester and the client. It draws some conclusions trying to explain why in spite of their great potential, they are still not an essential part of the common software development toolbox today.

Paper Nr: 14
Title:

Reengineered PFA: An Approach for Reinvention of Behaviorally-rich Systems

Authors:

Reuven Gallant and Leah Goldin

Abstract: In this Position Paper, one considers application of a reengineered PFA as a means of reinvent critical parts of a particular class of behaviorally-rich systems. The implementation of such systems, although not necessarily the outgrowth of PFA, could plausibly have been such an outgrowth because of the nature of their behavior and the way they were modeled. The goal of reengineered PFA application for such a system would be to re-examine and re-design critical behaviors. In particular, if the behaviors of such a system have been modeled by statechart diagrams, these diagrams can be leveraged to catalyze examination of whether the as-built behavior is in fact the desired behavior.

Paper Nr: 15
Title:

Semantics of Social Network Frequencies for Turing Test Immunity

Authors:

Iaakov Exman, Netanel Alfassi and Shani Cohen

Abstract: People using social networks make an implicit assumption that other players in the network are themselves human. But, while in most cases this assumption could be valid, we claim that this is a rather challenging example of a Turing test for artificial intelligence. To verify this claim we have designed and actually built a CyboPlayer – a software package that has the expected behaviour of a human player in the network. The important characteristics of the design include functions to perform in the social network and adjustable parameters to trigger reasonable behaviors. The final Turing test has been to liberate CyboPlayer in the network, like a bird in nature, and observe its interactions with other players. The paper describes the design, implementation and preliminary results of experiments.