Author(s):  
VINCENT C. HU ◽  
D. RICHARD KUHN ◽  
TAO XIE ◽  
JEEHYUN HWANG

Mandatory access control (MAC) mechanisms control which users or processes have access to which resources in a system. MAC policies are increasingly specified to facilitate managing and maintaining access control. However, the correct specification of the policies is a very challenging problem. To formally and precisely capture the security properties that MAC should adhere to, MAC models are usually written to bridge the rather wide gap in abstraction between policies and mechanisms. In this paper, we propose a general approach for property verification for MAC models. The approach defines a standardized structure for MAC models, providing for both property verification and automated generation of test cases. The approach expresses MAC models in the specification language of a model checker and expresses generic access control properties in the property language. Then the approach uses the model checker to verify the integrity, coverage, and confinement of these properties for the MAC models and finally generates test cases via combinatorial covering array for the system implementations of the models.


Author(s):  
Srinivas Perala, Dr. Ajay Roy

In the process of product development, stakeholders and top management summarize the concept and document the requirements in natural language. These ideas and descriptions documented as software requirements by the technical department. Developers develop software following this software requirement document. For testing this developed software, they derive test cases from natural language requirements and then do the testing process to find the bugs. This process involves understanding requirements and derives test cases that are used to understand by developers and testers. Due to increasing the advanced features, deriving the test cases is monotonous and takes more time. This research article shows a method to automate this process which is deriving test cases from requirements using NLP algorithms. This approach useful to reduce the time and cost of software development.


Author(s):  
GIUSEPPE DELLA PENNA ◽  
ANNA RITA LAURENZI ◽  
SERGIO OREFICE ◽  
BENEDETTO INTRIGILA

In this paper we present SMDP (Scenario Model Development Process), an XML-based methodology for the description and manipulation of scenarios that are used to formalize and reuse software requirements. SMDP is an iterative and incremental process that supports scenario evolution during the requirements engineering process. The formalization of scenarios through the underlying XML-based language of SMDP makes them immediately available to further automatic manipulation (e.g., to automatically generate test cases) without the need for intermediate models, as it is usually done in semi-formal approaches. Thanks to the implementation of a software assistant environment for SMDP, the methodology is currently being experimented on a variety of case studies, in particular web applications.


2021 ◽  
Vol 11 (10) ◽  
pp. 4673
Author(s):  
Tatiana Avdeenko ◽  
Konstantin Serdyukov

In the present paper, we investigate an approach to intelligent support of the software white-box testing process based on an evolutionary paradigm. As a part of this approach, we solve the urgent problem of automated generation of the optimal set of test data that provides maximum statement coverage of the code when it is used in the testing process. We propose the formulation of a fitness function containing two terms, and, accordingly, two versions for implementing genetic algorithms (GA). The first term of the fitness function is responsible for the complexity of the code statements executed on the path generated by the current individual test case (current set of statements). The second term formulates the maximum possible difference between the current set of statements and the set of statements covered by the remaining test cases in the population. Using only the first term does not make it possible to obtain 100 percent statement coverage by generated test cases in one population, and therefore implies repeated launch of the GA with changed weights of the code statements which requires recompiling the code under the test. By using both terms of the proposed fitness function, we obtain maximum statement coverage and population diversity in one launch of the GA. Optimal relation between the two terms of fitness function was obtained for two very different programs under testing.


Sign in / Sign up

Export Citation Format

Share Document