JTabWb : a Java framework for implementing terminating sequent and tableau calculi

JTabWb is a Java framework for developing provers based on terminating sequent or tableau calculi. It provides a generic engine which performs proof-search driven by a user-de ned speci cation. The user is required to de ne the components of a prover by implementing suitable Java interfaces. The implemented provers can be used as standalone applications or embedded in other Java applications. The framework also supports proof-trace generation, LATEX rendering of proofs and counter-model generation

Remote Health Service System based on Struts2 and Hibernate

Traditional web applications were developed using Servlets or Java Server Pages (JSP). Maintainability and extensibility became a problem with this approach as the business logic and presentation logic were mixed in a single file. Model View Controller (MVC) is a popular and powerful design pattern for developing web applications as it clearly separates the main responsibilities (business logic, presentation and request handling), which facilitates the scalability and extensibility of the applications. Struts2 framework has gained popularity in the recent times as it realized the MVC architecture. It is an elegant, extensible framework for developing enterprise level Java web applications. Data persistence is a significant task in any web application. Many persistence frameworks have gained importance recently. Hibernate is one such framework that can be easily integrated with Struts2. In this project, a Remote Health Service System is implemented that can be used by patients and medical experts for remote medical diagnosis. Patient registration, medical query submission, query response and query search are the main functionalities of this system. The application is modular, complete and flexible as its architecture is based on the integration of Struts2 and Hibernate frameworks. It has a multi-layered architecture with the Presentation, Controller and Service layers implemented using Struts2 and the Data Access layer implemented using Hibernate

The Transitivity of Trust Problem in the Interaction of Android Applications

Mobile phones have developed into complex platforms with large numbers of installed applications and a wide range of sensitive data. Application security policies limit the permissions of each installed application. As applications may interact, restricting single applications may create a false sense of security for the end users while data may still leave the mobile phone through other applications. Instead, the information flow needs to be policed for the composite system of applications in a transparent and usable manner. In this paper, we propose to employ static analysis based on the software architecture and focused data flow analysis to scalably detect information flows between components. Specifically, we aim to reveal transitivity of trust problems in multi-component mobile platforms. We demonstrate the feasibility of our approach with Android applications, although the generalization of the analysis to similar composition-based architectures, such as Service-oriented Architecture, can also be explored in the future

Building a Truly Distributed Constraint Solver with JADE

Real life problems such as scheduling meeting between people at different locations can be modelled as distributed Constraint Satisfaction Problems (CSPs). Suitable and satisfactory solutions can then be found using constraint satisfaction algorithms which can be exhaustive (backtracking) or otherwise (local search). However, most research in this area tested their algorithms by simulation on a single PC with a single program entry point. The main contribution of our work is the design and implementation of a truly distributed constraint solver based on a local search algorithm using Java Agent DEvelopment framework (JADE) to enable communication between agents on different machines. Particularly, we discuss design and implementation issues related to truly distributed constraint solver which might not be critical when simulated on a single machine. Evaluation results indicate that our truly distributed constraint solver works well within the observed limitations when tested with various distributed CSPs. Our application can also incorporate any constraint solving algorithm with little modifications.Comment: 7 page

Abmash: Mashing Up Legacy Web Applications by Automated Imitation of Human Actions

Many business web-based applications do not offer applications programming interfaces (APIs) to enable other applications to access their data and functions in a programmatic manner. This makes their composition difficult (for instance to synchronize data between two applications). To address this challenge, this paper presents Abmash, an approach to facilitate the integration of such legacy web applications by automatically imitating human interactions with them. By automatically interacting with the graphical user interface (GUI) of web applications, the system supports all forms of integrations including bi-directional interactions and is able to interact with AJAX-based applications. Furthermore, the integration programs are easy to write since they deal with end-user, visual user-interface elements. The integration code is simple enough to be called a "mashup".Comment: Software: Practice and Experience (2013)

Darwinian Data Structure Selection

Data structure selection and tuning is laborious but can vastly improve an application's performance and memory footprint. Some data structures share a common interface and enjoy multiple implementations. We call them Darwinian Data Structures (DDS), since we can subject their implementations to survival of the fittest. We introduce ARTEMIS a multi-objective, cloud-based search-based optimisation framework that automatically finds optimal, tuned DDS modulo a test suite, then changes an application to use that DDS. ARTEMIS achieves substantial performance improvements for \emph{every} project in $5$ Java projects from DaCapo benchmark, $8$ popular projects and $30$ uniformly sampled projects from GitHub. For execution time, CPU usage, and memory consumption, ARTEMIS finds at least one solution that improves \emph{all} measures for $86\%$ ($37/43$) of the projects. The median improvement across the best solutions is $4.8\%$, $10.1\%$, $5.1\%$ for runtime, memory and CPU usage. These aggregate results understate ARTEMIS's potential impact. Some of the benchmarks it improves are libraries or utility functions. Two examples are gson, a ubiquitous Java serialization framework, and xalan, Apache's XML transformation tool. ARTEMIS improves gson by $16.5$\%, $1\%$ and $2.2\%$ for memory, runtime, and CPU; ARTEMIS improves xalan's memory consumption by $23.5$\%. \emph{Every} client of these projects will benefit from these performance improvements.Comment: 11 page

Secure web services on mobile platform

Java ME framework supports running of applications on mobile and embedded devices like mobile phones. It contains small subset of Java API functions what consequently means limited application functionality. Open-source libraries for calling web services can be utilised in Java ME framework to increase application functionality. The library for support of secure web service calls does not exist yet. The thesis undertakes the development of the Parkiranje application which utilises WS-security protocol for secure handling of web services in Java ME framework. The application Parkiranje is a MIDlet and is based on Java ME framework. The thesis presents the application of WS-Security protocol in Java ME framework and the technologies used for programming of Parkiranje application. The thesis also demonstrates the Parkiranje application in a practical part. Street parking in big cities can be a tricky and time consuming exercise. There is an opportunity to use a mobile phone to speed up and simplify the search of parking space and to facilitate the payment transaction. In the thesis we have developed and implemented Parkiranje application, which will help the driver to find the closest free parking spot, facilitate parking spot reservation and payment transaction

Secure web services on mobile platform

Java ME framework supports running of applications on mobile and embedded devices like mobile phones. It contains small subset of Java API functions what consequently means limited application functionality. Open-source libraries for calling web services can be utilised in Java ME framework to increase application functionality. The library for support of secure web service calls does not exist yet. The thesis undertakes the development of the Parkiranje application which utilises WS-security protocol for secure handling of web services in Java ME framework. The application Parkiranje is a MIDlet and is based on Java ME framework. The thesis presents the application of WS-Security protocol in Java ME framework and the technologies used for programming of Parkiranje application. The thesis also demonstrates the Parkiranje application in a practical part. Street parking in big cities can be a tricky and time consuming exercise. There is an opportunity to use a mobile phone to speed up and simplify the search of parking space and to facilitate the payment transaction. In the thesis we have developed and implemented Parkiranje application, which will help the driver to find the closest free parking spot, facilitate parking spot reservation and payment transaction