Identification of Potential Reusable Subroutines in Recorded Automated Test Scripts

2018 ◽  
Vol 28 (01) ◽  
pp. 3-36
Author(s):  
Miroslav Bures ◽  
Martin Filipsky ◽  
Ivan Jelinek
Keyword(s):  
User Interface ◽  
Source Code ◽  
Automated Testing ◽  
Test Automation ◽  
Specific Test ◽  
Automated Test ◽  
Test Sets ◽  
Automated Process

In the automated testing based on actions in user interface of the tested application, one of the key challenges is maintenance of these tests. The maintenance overhead can be decreased by suitably structuring the test scripts, typically by employing reusable objects. To aid in the development, maintenance and refactoring of these test scripts, potentially reusable objects can be identified by a semi-automated process. In this paper, we propose a solution that identifies the potentially reusable objects in a set of automated test scripts and then provides developers with suggestions about these objects. During this process, we analyze the semantics of specific test steps using a system of abstract signatures. The solution can be used to identify the potentially reusable objects in both recorded automated test sets and tests programmed in an unstructured style. Moreover, compared to approaches that are based solely on searching for repetitive source code fragments, the proposed system identifies potentially reusable objects that are more relevant for test automation.

Keyword Driven Automation Test

2013 ◽  
Vol 427-429 ◽  
pp. 652-655
Author(s):  
Zhong Qian Wu ◽  
Jin Zhe Li ◽  
Zeng Zeng Liao
Keyword(s):  
System Architecture ◽  
Automated Testing ◽  
Application Framework ◽  
Test Automation ◽  
Testing Framework ◽  
Automation Test ◽  
Test Efficiency ◽  
Software Reusability ◽  
Automated Test ◽  
Reduced Scale

In order to improve software reusability of automated test scripts, presents a keyword-driven test automation framework (KDTFA). First, the current existing automated testing framework for inductive analysis; then raised KDTFA system architecture; finally, an example of the android interface application framework and the existing framework for KDTFA actual contrast verification results show that the framework has a reduced scale of test scripts to improve the overall test efficiency and other advantages.

scholarly journals Temporal network alignment via GoT-WAVE

2019 ◽  
Vol 35 (18) ◽  
pp. 3527-3529 ◽  
Author(s):  
David Aparício ◽  
Pedro Ribeiro ◽  
Tijana Milenković ◽  
Fernando Silva
Keyword(s):  
User Interface ◽  
State Of The Art ◽  
Source Code ◽  
Network Alignment ◽  
Supplementary Information ◽  
Temporal Network ◽  
Temporal Networks ◽  
Supplementary Data ◽  
Node Similarity ◽  
User Friendly

Abstract Motivation Network alignment (NA) finds conserved regions between two networks. NA methods optimize node conservation (NC) and edge conservation. Dynamic graphlet degree vectors are a state-of-the-art dynamic NC measure, used within the fastest and most accurate NA method for temporal networks: DynaWAVE. Here, we use graphlet-orbit transitions (GoTs), a different graphlet-based measure of temporal node similarity, as a new dynamic NC measure within DynaWAVE, resulting in GoT-WAVE. Results On synthetic networks, GoT-WAVE improves DynaWAVE’s accuracy by 30% and speed by 64%. On real networks, when optimizing only dynamic NC, the methods are complementary. Furthermore, only GoT-WAVE supports directed edges. Hence, GoT-WAVE is a promising new temporal NA algorithm, which efficiently optimizes dynamic NC. We provide a user-friendly user interface and source code for GoT-WAVE. Availability and implementation http://www.dcc.fc.up.pt/got-wave/ Supplementary information Supplementary data are available at Bioinformatics online.

scholarly journals Automatic Acquisition of Annotated Training Corpora for Test-Code Generation

Information ◽  
2019 ◽  
Vol 10 (2) ◽  
pp. 66
Author(s):  
Magdalena Kacmajor ◽  
John Kelleher
Keyword(s):  
Natural Language ◽  
Code Generation ◽  
Source Code ◽  
Generative Models ◽  
Training Data ◽  
Training Dataset ◽  
Unit Testing ◽  
Test Automation ◽  
Parallel Corpora ◽  
Parallel Text

Open software repositories make large amounts of source code publicly available. Potentially, this source code could be used as training data to develop new, machine learning-based programming tools. For many applications, however, raw code scraped from online repositories does not constitute an adequate training dataset. Building on the recent and rapid improvements in machine translation (MT), one possibly very interesting application is code generation from natural language descriptions. One of the bottlenecks in developing these MT-inspired systems is the acquisition of parallel text-code corpora required for training code-generative models. This paper addresses the problem of automatically synthetizing parallel text-code corpora in the software testing domain. Our approach is based on the observation that self-documentation through descriptive method names is widely adopted in test automation, in particular for unit testing. Therefore, we propose synthesizing parallel corpora comprised of parsed test function names serving as code descriptions, aligned with the corresponding function bodies. We present the results of applying one of the state-of-the-art MT methods on such a generated dataset. Our experiments show that a neural MT model trained on our dataset can generate syntactically correct and semantically relevant short Java functions from quasi-natural language descriptions of functionality.

scholarly journals ShelXle: a Qt graphical user interface forSHELXL

2011 ◽  
Vol 44 (6) ◽  
pp. 1281-1284 ◽  
Author(s):  
Christian B. Hübschle ◽  
George M. Sheldrick ◽  
Birger Dittrich
Keyword(s):  
User Interface ◽  
Graphical User Interface ◽  
Structure Refinement ◽  
Source Code ◽  
Three Dimensional ◽  
Dimensional Structure ◽  
Graphical Display ◽  
Acta Cryst ◽  
Strongly Coupled ◽  
Difference Density

ShelXleis a graphical user interface forSHELXL[Sheldrick, G. M. (2008).Acta Cryst.A64, 112–122], currently the most widely used program for small-molecule structure refinement. It combines an editor with syntax highlighting for theSHELXL-associated .ins (input) and .res (output) files with an interactive graphical display for visualization of a three-dimensional structure including the electron density (Fo) and difference density (Fo–Fc) maps. Special features ofShelXleinclude intuitive atom (re-)naming, a strongly coupled editor, structure visualization in various mono and stereo modes, and a novel way of displaying disorder extending over special positions.ShelXleis completely compatible with all features ofSHELXLand is written entirely in C++ using the Qt4 and FFTW libraries. It is available at no cost for Windows, Linux and Mac-OS X and as source code.

scholarly journals Knowledge.Bio: A Web Application for Exploring, Building and Sharing Webs of Biomedical Relationships Mined from PubMed

2016 ◽  
Author(s):  
Richard Bruskiewich ◽  
Kenneth Huellas-Bruskiewicz ◽  
Farzin Ahmed ◽  
Rajaram Kaliyaperumal ◽  
Mark Thompson ◽  
...  
Keyword(s):  
User Interface ◽  
Text Mining ◽  
Graphical User Interface ◽  
Biomedical Research ◽  
Web Application ◽  
Source Code ◽  
Research Literature ◽  
Knowledge Networks ◽  
Link Type ◽  
Web Platform

AbstractKnowledge.Bio is a web platform that enhances access and interpretation of knowledge networks extracted from biomedical research literature. The interaction is mediated through a collaborative graphical user interface for building and evaluating maps of concepts and their relationships, alongside associated evidence. In the first release of this platform, conceptual relations are drawn from the Semantic Medline Database and the Implicitome, two compleme ntary resources derived from text mining of PubMed abstracts.Availability— Knowledge.Bio is hosted at http://knowledge.bio/ and the open source code is available at http://bitbucket.org/sulab/kb1/.Contact— [email protected]; [email protected]

scholarly journals Checking for Open Bisimilarity in the pi-Calculus

2001 ◽  
Vol 8 (8) ◽  
Author(s):  
Ulrik Frendrup ◽  
Jesper Nyholm Jensen
Keyword(s):  
User Interface ◽  
Iterative Method ◽  
Time Complexity ◽  
Source Code ◽  
Performance Tests ◽  
Running Time ◽  
Pi Calculus ◽  
Definition Of ◽  
Refinement Algorithm ◽  
Partition Refinement

<p>This paper deals with algorithmic checking of open bisimilarity in the pi-calculus. Most bisimulation checking algorithms are based on the partition refinement approach. Unfortunately the definition of open bisimulation does not permit us to use a partition refinement approach for open bisimulation checking directly, but in the paper 'A Partition Refinement Algorithm for the pi-Calculus' Marco Pistore and Davide Sangiorgi present an iterative method that makes it possible to check for open bisimilarity using partition refinement. We have implemented the algorithm presented by Marco Pistore and Davide Sangiorgi. Furthermore,<br />we have optimized this algorithm and implemented this optimized algorithm. The time-complexity of this algorithm is the same as the time-complexity for the first algorithm, but performance tests have shown that in many cases the running time of the optimized algorithm is shorter than the running time of the first algorithm. Our implementation of the optimized open bisimulation checker algorithm and a user interface have been integrated in a system called the OBC Workbench.The source code and a manual for it is available from http://www.cs.auc.dk/research/FS/ny/PR-pi/.</p>

Sign in / Sign up

Export Citation Format

Share Document