37 research outputs found

    A comparison analysis of some random software testing strategy

    No full text
    W pracy przedstawione s膮 wyniki analizy por贸wnawczej dw贸ch, najcz臋艣ciej wykorzystywanych w praktyce, strategii losowego tworzenia zbioru danych testowych: testowania w pe艂ni losowego (random testing) i strukturalnego testowania losowego (partition testing). Zawarte w pracy rozwa偶ania maj膮 na celu okre艣lenie warunk贸w, dla kt贸rych jedna z ww. strategii testowania losowego jest lepsza od drugiej, w sensie prawdopodobie艅stwa wykrycia co najmniej jednego b艂臋du za pomoc膮 utworzonych w oparciu o nie, tak samo licznych zbior贸w danych testowych. Przedstawione rozwa偶ania zosta艂y zilustrowane wynikami eksperyment贸w symulacyjnych, s艂u偶膮cych por贸wnaniu efektywno艣ci analizowanych strategii testowania.Both partition testing and random testing methods are commonly followed practice towards selection of test cases. For partition testing, the program鈥檚 input domain is divided into subsets, called subdomains, and one or more representatives from each subdomain are selected to test the program. In random testing test cases are selected from the entire program鈥檚 input domain randomly. The main aim of the paper is to compare the fault-detecting ability of partition testing and random testing methods. The results of comparing the effectiveness of partition testing and random testing may be surprising to many people. Even when partition testing is better than random testing at finding faults, the difference in effectiveness is marginal. Using some effectiveness metrics for testing and some partitioning schemes this paper investigates formal conditions for partition testing to be better than random testing and vice versa

    Optimizing the module structure of the program on the stage of its design

    No full text
    The paper proposes a formal method of determining the modular structure of the computer program by formulating and solution of the corresponding two-criterion optimization problem. A module strength coefficient and a module coupling coefficients were established as modularization criteria of the program. For the illustration of the considerations that have been discussed, a simple numerical example will be presented

    Optymalizacja struktury oprogramowania wspieraj膮cego logistyk臋 na etapie jego projektowania

    No full text
    Background: Computer software, widely used to support a broad range of logistics activities, is characterized both by increasing functionality and increasing complexity. For this reason, the process of software production, including the stages of specification of requirements, design, programming and testing, is time-consuming and expensive. The main goal of the software design phase is to determine the software architecture that identifies all software components and defines links and connections between them. The design phase also includes the development of the so-called internal logic of all extracted components, that is, detailed elaboration of algorithms for their operation and defining the structure of data used. It should be emphasized that the results of the software design process depend greatly on the knowledge and experience of the designer, because there are no universal behavioral patterns in this area. The main goal of the approach proposed at work is to reduce the role of the subjective factor in the results of the software development process. The focus of this work is on this software development process within logistics processes. Methods: The basic research method used in the work is mathematical modeling. The paper proposes a formal method of assigning the modular structure of the computer program by formulating and solving the corresponding double-criterion optimization problem. The module strength coefficient and module-coupling coefficients were established as modularization criteria of the program. Results: The main result of the work is the method of determining the modular structure of the designed program by determining the solution of the two-criterion optimization problem. The numerical example developed to illustrate this entirel confirms the possibilities of its practical application. The modular structure of the program, based on the solution of the formulated polyoptimization task, is characterized by the maximum value of the modular power coefficient and the minimum value of the modular strength coefficient. According to the latest trends in software engineering, it is the optimal structure. The method can be useful in the process of designing software for systems supporting the implementation of logistics processes. Conclusions: The author's method of determining the modular structure of the program, presented in the article, is an unprecedented attempt in the literature to use formal methods in the software design process, which could be implemented practically in the logistics processes. The lack of similar attempts probably results from the very low compliance of the software design stage with attempts to formalize it. In order to increase the possibility of practical application of the proposed method, it seems reasonable to conduct further work to implement the methods of developing software requirements specifications in a formalized form, e.g. with the use of mathematical notation.Wst臋p: Oprogramowanie system贸w komputerowych, powszechnie wykorzystywanych do wspomagania szeroko rozumianej dzia艂alno艣ci logistycznej, charakteryzuje si臋 coraz wi臋ksz膮 funkcjonalno艣ci膮, ale tak偶e coraz wi臋ksz膮 z艂o偶ono艣ci膮. Z tego powodu proces jego wytwarzania, obejmuj膮cy etapy: specyfikacji wymaga艅, projektowania, programowania oraz testowania, jest przedsi臋wzi臋ciem czasoch艂onnym i kosztownym. G艂贸wnym celem fazy projektowania oprogramowania jest okre艣lenie architektury oprogramowania, kt贸ra identyfikuje wszystkie komponenty oprogramowania i definiuje 艂膮cza i po艂膮czenia mi臋dzy nimi. Faza projektowania obejmuje r贸wnie偶 opracowanie wewn臋trznej logiki wszystkich wyodr臋bnionych komponent贸w, czyli szczeg贸艂owe opracowanie algorytm贸w ich dzia艂ania i okre艣lenie struktury wykorzystywanych danych. Nale偶y podkre艣li膰, 偶e wyniki projektowania oprogramowania silnie zale偶膮 od wiedzy i do艣wiadczenia projektanta, poniewa偶 nie ma uniwersalnych wzorc贸w zachowa艅 w tym obszarze. G艂贸wnym celem proponowanego podej艣cia jest ograniczenie wp艂ywu wspomnianego czynnika subiektywnego na wyniki procesu projektowania oprogramowania. Metody: Podstawow膮 metod膮 badawcz膮 zastosowan膮 w pracy jest modelowanie matematyczne. W pracy proponuje si臋 formaln膮 metod臋 okre艣lania struktury modu艂owej projektowanego programu, poprzez wyznaczenie rozwi膮zania odpowiednio sformu艂owanego zadania optymalizacji dwukryterialnej. Jako kryteria modularyzacji przyj臋to wska藕nik mocy modu艂owej oraz wska藕nik si艂y powi膮za艅 mi臋dzymodu艂owych programu. Rezultaty: G艂贸wnym rezultatem pracy jest autorska metoda wyznaczania struktury modu艂owej projektowanego programu, poprzez wyznaczenie rozwi膮zania formalnego problemu optymalizacji dwukryterialnej. Ilustruj膮cy proponowan膮 metod臋 przyk艂ad numeryczny w pe艂ni potwierdza mo偶liwo艣ci jej praktycznego zastosowania. Struktura modu艂owa programu, oparta na rozwi膮zaniu sformu艂owanego zadania polioptymalizacji charakteryzuje si臋 maksymaln膮 warto艣ci膮 wsp贸艂czynnika tzw. mocy programu i minimaln膮 warto艣ci膮 modu艂owego wsp贸艂czynnika powi膮za艅 mi臋dzymodu艂owych. Zgodnie z najnowszymi trendami in偶ynierii oprogramowania, jest to zatem struktura optymalna. Metoda mo偶e by膰 przydatna, m.in. w procesie projektowania oprogramowania system贸w wspieraj膮cych realizacj臋 proces贸w logistycznych. Wnioski: Przedstawiona w artykule autorska metoda okre艣lania struktury modu艂owej programu jest - nie maj膮ca precedensu w literaturze przedmiotu - jest pr贸b膮 wykorzystania metod modelowania matematycznego w procesie projektowania oprogramowania. Brak podobnych pr贸b w literaturze przedmiotu prawdopodobnie wynika z bardzo niskiej podatno艣ci etapu projektowania oprogramowania na jego formalizacji. W celu zwi臋kszenia mo偶liwo艣ci praktycznego stosowania proponowanej metody wydaje si臋 zasadne prowadzenie dalszych prac, s艂u偶膮cych wdro偶eniu metod opracowywania specyfikacji wymaga艅 na oprogramowanie w sformalizowanej formie, np. z wykorzystaniem zapisu matematycznego

    A case study in school transportation logistics

    No full text
    In the paper, a school bus routing problem, its mathematical models and solution methods are investigated. The aim of the study is to search for school bus routing problem and its solution method and to apply them for a sample case study. The case study concerns the routing and scheduling of school buses in an exemplary, well-recognized school located in one of Polish community. The problem is to find a series of school bus routes that ensure the service is provided equitably to all eligible students. Because of the NP-hardness of the school bus routing problem, it is solved using some heuristic optimization method using real data from the considered exemplary school. The aim is to increase bus utilization and to reduce transportation times for students, while maintaining on-time delivery of students to the school. Although the problem under consideration is one of the earliest logistics problems solved using methods of operations research, remains valid and is the subject of research, as evidenced by numerous contemporary publications, presenting new methods for the formal specification and solution of the problem

    Wykorzystanie metod optymalizacji do wyznaczania najlepszego producenta oprogramowania

    No full text
    A practical problem of choosing a software developer is considered. This problem is investigated from a user鈥檚 viewpoint, i.e. it is assumed that the software which is needed should be not only reliable but as cheap as possible too. The purpose of the paper is to propose some formal way of determining software developer by formulating and solving the bicriterial optimization problem will both minimize the value of the number of software tasks which have incorrect realization during some time period and minimize the value of the software development cost. Some numerical example is presented to illustrate of practical usefulness of the method which is proposed. The exemplary bicriterial optimization problem is solved on the base of the general methodology of solving multicriteria optimization problems.W artykule przedstawiono propozycj臋 pewnego wska藕nika jako艣ci programu, w konstrukcji kt贸rego uwzgl臋dniono warunki jego u偶ytkowej eksploatacji. Dla zilustrowania przydatno艣ci skonstruowanego wska藕nika jako艣ci programu w dalszej cz臋艣ci artyku艂u sformu艂owano dwukryterialne zadanie wyboru wariantu produkcji programu, z kosztem produkcji i proponowanym wska藕nikiem jako艣ci programu jako kryteriami sk艂adowymi

    Logistical Aspects of the Software Testing Process

    No full text
    The purpose of this article is characterization of the software testing process in terms of its logistical support. The software testing process is characterized as a complex, multistage project, with particular emphasis on its planning and organization. The role of logistical support and its importance for the efficiency of the testing process realization is highlighted. It was noted that proper software testing process planning and organization significantly affects the time and cost of that process

    Ocena wp艂ywu procesu testowania na niezawodno艣膰 modu艂u programowego

    No full text
    W artkule przedstawiono propozycj臋 modelu wzrostu niezawodno艣ci modelu w procesie jego testowania. W celu uwzgl臋dnienia, bardzo cz臋sto wyst臋puj膮cego w praktyce testowania oprogramowania, zjawiska wykrywania przez r贸偶ne zestaey danych testowych tych samych b艂臋d贸w wprowadzono poj臋cie tzw. macierzy charakterystycznej testowanego modu艂u. NA podstawie analiy zale偶no艣ci macierzy charakterystycznej i przyrostu warto艣ci wska藕nika niezawodno艣ci modu艂u przedstawiono praktyczne oszacowania tego przyrostu dla wybranych postaci macierzy charakterystycznej testowanego modu艂u

    Comparison of Selected Strategies of Statistical Quality Control

    No full text
    The paper presents the results of a comparative analysis of the two methods of statistical quality control of products. That two methods differ from each other mainly by a way of determining a subset of products subjected to inspection. The first of the two methods, hereinafter referred to as the completely random method, is to draw a certain number of products for control of the entire products population. The second method, called the method of drawing from partitions, is a pre-split across the specific products population into smaller parts, called partitions, and then create a representation (sample) of the products subject to control by drawing the products from each partition. The main result of this study is to determine the conditions for which the effectiveness of quality control methods with drawing from partitions is not less than the efficiency of the method with fully random drawing, whereby the efficiency criterion is the likelihood of the event, consisting in the fact that there is at least one incorrect product among the drawn products. The considerations were illustrated by numerical examples, designed to compare the effectiveness of the analyzed methods of quality control
    corecore