Generación de Casos de Prueba en Programación Orientada a Objetos = Test Case Generation in Object-Oriented Programming

Las pruebas de software (Testing) son en la actualidad la técnica más utilizada para la validación y la evaluación de la calidad de un programa. El testing está integrado en todas las metodologías prácticas de desarrollo de software y juega un papel crucial en el éxito de cualquier proyecto de software. Desde las unidades de código más pequeñas a los componentes más complejos, su integración en un sistema de software y su despliegue a producción, todas las piezas de un producto de software deben ser probadas a fondo antes de que el producto de software pueda ser liberado a un entorno de producción. La mayor limitación del testing de software es que continúa siendo un conjunto de tareas manuales, representando una buena parte del coste total de desarrollo. En este escenario, la automatización resulta fundamental para aliviar estos altos costes. La generación automática de casos de pruebas (TCG, del inglés test case generation) es el proceso de generar automáticamente casos de prueba que logren un alto recubrimiento del programa. Entre la gran variedad de enfoques hacia la TCG, esta tesis se centra en un enfoque estructural de caja blanca, y más concretamente en una de las técnicas más utilizadas actualmente, la ejecución simbólica. En ejecución simbólica, el programa bajo pruebas es ejecutado con expresiones simbólicas como argumentos de entrada en lugar de valores concretos. Esta tesis se basa en un marco general para la generación automática de casos de prueba dirigido a programas imperativos orientados a objetos (Java, por ejemplo) y basado en programación lógica con restricciones (CLP, del inglés constraint logic programming). En este marco general, el programa imperativo bajo pruebas es primeramente traducido a un programa CLP equivalente, y luego dicho programa CLP es ejecutado simbólicamente utilizando los mecanismos de evaluación estándar de CLP, extendidos con operaciones especiales para el tratamiento de estructuras de datos dinámicas. Mejorar la escalabilidad y la eficiencia de la ejecución simbólica constituye un reto muy importante. Es bien sabido que la ejecución simbólica resulta impracticable debido al gran número de caminos de ejecución que deben ser explorados y a tamaño de las restricciones que se deben manipular. Además, la generación de casos de prueba mediante ejecución simbólica tiende a producir un número innecesariamente grande de casos de prueba cuando es aplicada a programas de tamaño medio o grande. Las contribuciones de esta tesis pueden ser resumidas como sigue. (1) Se desarrolla un enfoque composicional basado en CLP para la generación de casos de prueba, el cual busca aliviar el problema de la explosión de caminos interprocedimiento analizando de forma separada cada componente (p.ej. método) del programa bajo pruebas, almacenando los resultados y reutilizándolos incrementalmente hasta obtener resultados para el programa completo. También se ha desarrollado un enfoque composicional basado en especialización de programas (evaluación parcial) para la herramienta de ejecución simbólica Symbolic PathFinder (SPF). (2) Se propone una metodología para usar información del consumo de recursos del programa bajo pruebas para guiar la ejecución simbólica hacia aquellas partes del programa que satisfacen una determinada política de recursos, evitando la exploración de aquellas partes del programa que violan dicha política. (3) Se propone una metodología genérica para guiar la ejecución simbólica hacia las partes más interesantes del programa, la cual utiliza abstracciones como generadores de trazas para guiar la ejecución de acuerdo a criterios de selección estructurales. (4) Se propone un nuevo resolutor de restricciones, el cual maneja eficientemente restricciones sobre el uso de la memoria dinámica global (heap) durante ejecución simbólica, el cual mejora considerablemente el rendimiento de la técnica estándar utilizada para este propósito, la \lazy initialization". (5) Todas las técnicas propuestas han sido implementadas en el sistema PET (el enfoque composicional ha sido también implementado en la herramienta SPF). Mediante evaluación experimental se ha confirmado que todas ellas mejoran considerablemente la escalabilidad y eficiencia de la ejecución simbólica y la generación de casos de prueba. ABSTRACT Testing is nowadays the most used technique to validate software and assess its quality. It is integrated into all practical software development methodologies and plays a crucial role towards the success of any software project. From the smallest units of code to the most complex components and their integration into a software system and later deployment; all pieces of a software product must be tested thoroughly before a software product can be released. The main limitation of software testing is that it remains a mostly manual task, representing a large fraction of the total development cost. In this scenario, test automation is paramount to alleviate such high costs. Test case generation (TCG) is the process of automatically generating test inputs that achieve high coverage of the system under test. Among a wide variety of approaches to TCG, this thesis focuses on structural (white-box) TCG, where one of the most successful enabling techniques is symbolic execution. In symbolic execution, the program under test is executed with its input arguments being symbolic expressions rather than concrete values. This thesis relies on a previously developed constraint-based TCG framework for imperative object-oriented programs (e.g., Java), in which the imperative program under test is first translated into an equivalent constraint logic program, and then such translated program is symbolically executed by relying on standard evaluation mechanisms of Constraint Logic Programming (CLP), extended with special treatment for dynamically allocated data structures. Improving the scalability and efficiency of symbolic execution constitutes a major challenge. It is well known that symbolic execution quickly becomes impractical due to the large number of paths that must be explored and the size of the constraints that must be handled. Moreover, symbolic execution-based TCG tends to produce an unnecessarily large number of test cases when applied to medium or large programs. The contributions of this dissertation can be summarized as follows. (1) A compositional approach to CLP-based TCG is developed which overcomes the inter-procedural path explosion by separately analyzing each component (method) in a program under test, stowing the results as method summaries and incrementally reusing them to obtain whole-program results. A similar compositional strategy that relies on program specialization is also developed for the state-of-the-art symbolic execution tool Symbolic PathFinder (SPF). (2) Resource-driven TCG is proposed as a methodology to use resource consumption information to drive symbolic execution towards those parts of the program under test that comply with a user-provided resource policy, avoiding the exploration of those parts of the program that violate such policy. (3) A generic methodology to guide symbolic execution towards the most interesting parts of a program is proposed, which uses abstractions as oracles to steer symbolic execution through those parts of the program under test that interest the programmer/tester most. (4) A new heap-constraint solver is proposed, which efficiently handles heap-related constraints and aliasing of references during symbolic execution and greatly outperforms the state-of-the-art standard technique known as lazy initialization. (5) All techniques above have been implemented in the PET system (and some of them in the SPF tool). Experimental evaluation has confirmed that they considerably help towards a more scalable and efficient symbolic execution and TCG.

Standardized test evaluation of two methods of teaching human relations.

Mode of access: Internet.

Concerning the relations of Great Britain, Spain, and Portugal, to each other, and to the common enemy, at this crisis; and specifically as affected by the Convention of Cintra: the whole brought to the test of those principles, by which alone the independence and freedom of nations can be preserved or recovered.

Mode of access: Internet.

Infants' Understanding of Object Weight: Relations with Action Experience and Strength

Thesis (Ph.D.)--University of Washington, 2016-06

Tool support for generating passive C++ test oracles from object-z specifications

A test oracle provides a means for determining whether an implementation behaves according to its specification. A passive test oracle checks that the correct behaviour has been implemented, but does not implement the behaviour itself. In previous work, we have presented a method that allows us to derive passive C++ test oracles from formal specifications written in Object-Z. We describe the "Warlock" prototype tool that supports the method. Warlock is built on top of an existing Object-Z type checker and generates oracle code for a substantial subset of the Object-Z language. We describe the architecture of Warlock and its application to a number of Object-Z specifications. We also discuss its current limitations.

Putting service relations to the test:how can negative consumer reactions of price increases be reduced?

Price increases seem to be an adequate way to improve the earnings of companies. This fact becomes especially crucial because of increased price competition in many markets. Price increases might lead to negative customer reactions, such as a lower perceived utility or a lower loyalty intention. Therefore, the question for managers remains how prices can be increased without losing customers. Results of our experimental study suggest that customers of energy suppliers rate the perceived utility of the offer relatively better when the price increase is combined with an additional modification of the product or accompanied by a new service. It becomes clear that intensifying service relations can offset the negative effects of price increases.

The transducer model for contrast detection and discrimination: formal relations, implications, and an empirical test.

The transducer function mu for contrast perception describes the nonlinear mapping of stimulus contrast onto an internal response. Under a signal detection theory approach, the transducer model of contrast perception states that the internal response elicited by a stimulus of contrast c is a random variable with mean mu(c). Using this approach, we derive the formal relations between the transducer function, the threshold-versus-contrast (TvC) function, and the psychometric functions for contrast detection and discrimination in 2AFC tasks. We show that the mathematical form of the TvC function is determined only by mu, and that the psychometric functions for detection and discrimination have a common mathematical form with common parameters emanating from, and only from, the transducer function mu and the form of the distribution of the internal responses. We discuss the theoretical and practical implications of these relations, which have bearings on the tenability of certain mathematical forms for the psychometric function and on the suitability of empirical approaches to model validation. We also present the results of a comprehensive test of these relations using two alternative forms of the transducer model: a three-parameter version that renders logistic psychometric functions and a five-parameter version using Foley's variant of the Naka-Rushton equation as transducer function. Our results support the validity of the formal relations implied by the general transducer model, and the two versions that were contrasted account for our data equally well.

Using partially structured attitude measures to enhance the attitude-behavior relationship

This article recalls a classic scheme for categorizing attitude measures. One particular group of measures, those that rely on respondents' interpretations of partially structured stimuli, has virtually disappeared from attitude research. An attitude measure based on respondents' interpretation of partially structured stimuli is considered. Four studies employing such a measure demonstrate that it predicts unique variance in self-reported and actual behavior, beyond that predicted by explicit and contemporary implicit measures and regardless of whether the attitude object under consideration is wrought with social desirability concerns. Implications for conceptualizing attitude measurement and attitude-behavior relations are discussed.

Salinity tolerance in Schinopsis quebracho colorado: Seed germination, growth, ion relations and metabolic responses

Soil salinity is a major abiotic stress influencing plant productivity worldwide. Schinopsis quebracho colorado is one of the most important woody species in the Gran Chaco, an and and salt-prone subtropical biome of South America. To gain a better understanding of the physiological mechanisms that allow plant establishment under salt conditions, germination and seedling growth of S. quebracho colorado were examined under treatment with a range of NaCl solutions (germination: 0-300 mmol l(-1) NaCl; seedling growth: 0-200 mmol l(-1) NaCl). The aim was to test the hypothesis that S. quebracho colorado is a glycophite that shows different salt tolerance responses with development stage. Proline content, total soluble carbohydrates and Na+, K+ and Cl- concentrations in leaves and roots of seedlings, and the chlorophyll concentration and relative water content of leaves were measured. Germination was not affected by 100 mmol l(-1) NaCl, but decreased at a concentration of 200 mmol l(-1). At 300 mmol l(-1) NaCl, germination did not occur. Seedling growth decreased drastically with increasing salinity. An increase in NaCl from 0 to 100 mmol l(-1) also significantly reduced the leaf relative water content by 22% and increased the proline concentration by 60% in roots. In contrast, total soluble carbohydrates were not significantly affected by salinity. Seedlings showed a sodium exclusion capacity, and there was an inverse correlation between Cl- concentration and the total chlorophyll concentration. S. quebracho colorado was more tolerant to salinity during germination than in the seedling phase. The results suggest that this increased tolerance during germination might, in part, be the result of lower sensitivity to high tissue Na+ concentrations. The significant increment of proline in the roots suggests the positive role of this amino acid as a compatible solute in balancing the accumulation of Na+ and Cl- as a result of salinity. These results help clarify the physiological mechanisms that allow establishment of S. quebracho colorado on salt-affected soils in arid and semi-arid Gran Chaco. (c) 2008 Elsevier Ltd. All rights reserved.

Assessment of vocational guidance: The Berufsbilder test

The object of this study is to assess informative possibilities of some technical indicators of the Test of Photos of Professions (BBT - Berufsbilder test), a projective method to clarify professional inclination, proposed by Martin Achtnich. This psychological evaluation technique is composed of 96 photos of professionals, performing various types of activities. The test subject classifies the photos into three groups: positive (agreeable), negative (disagreeable) and indifferent (neutral). Among those chosen positively, five preferences are chosen and a story is developed that includes them, an activity that is requested two times during the Vocational Guidance process: in the beginning (or middle) and at the end of the intervention. In this study, 160 stories were created by 80 youths, between 15 and 20 years of age, in public and private schools in a mid-sized Brazilian city. The stories were compared in three analytical categories: protagonist, professional conflict and resolution. The results were submitted to Wilcoxon nonparametric statistical analysis (p < .05), significant and relevant indicators of resolution being found in the process of occupational choice. This technical resource was shown, from this empirical evidence, to be promising for use in evaluation of intervention processes of Vocational Guidance.

Ghrelin and PYY(3-36) in gastrectomized and vagotomized patients: relations with appetite, energy intake and resting energy expenditure

Background/Objectives: Reduced food intake, appetite loss and alteration of ghrelin and PYY(3-36) secretion have been suggested to have a function in the loss of body weight commonly observed after gastrectomy. The objective of this study was to investigate the circulating concentrations of ghrelin and PYY(3-36) and their relationships with food intake, appetite and resting energy expenditure (REE) after gastrectomy plus vagotomy. Subjects/Methods: Seven patients with total gastrectomy (TG), 14 with partial gastrectomy (PG) and 10 healthy controls were studied. Habitual food intake and REE was assessed; fasting and postprandial plasma total ghrelin, PYY(3-36) concentrations and appetite ratings were determined after ingestion of a liquid test meal. Results: Differently from PG and controls, fasting ghrelin correlated with REE, and a higher energy intake was observed in the TG group. Fasting plasma ghrelin concentrations were lower in TG compared with controls, and no ghrelin response to the meal was observed in either PG or TG. Fasting plasma PYY(3-36) concentrations were not different among the groups. There was an early and exaggerated postprandial rise in PYY(3-36) levels in both PG and TG groups, but not in controls. No effect of ghrelin or PYY(3-36) concentrations was observed on hunger, prospective consumption or fullness ratings. Conclusions: Total ghrelin and PYY(3-36) do not seem to be involved with appetite or energy intake regulation after gastrectomy plus vagotomy. Ghrelin secreted by sources other than stomach is likely to have a function in the long-term regulation of body weight after TG. European Journal of Clinical Nutrition (2010) 64, 845-852; doi: 10.1038/ejcn.2010.88; published online 19 May 2010

Specification, refinement and verification of concurrent systems - An integration of Object-Z and CSP

This paper presents a method of formally specifying, refining and verifying concurrent systems which uses the object-oriented state-based specification language Object-Z together with the process algebra CSP. Object-Z provides a convenient way of modelling complex data structures needed to define the component processes of such systems, and CSP enables the concise specification of process interactions. The basis of the integration is a semantics of Object-Z classes identical to that of CSP processes. This allows classes specified in Object-Z to he used directly within the CSP part of the specification. In addition to specification, we also discuss refinement and verification in this model. The common semantic basis enables a unified method of refinement to be used, based upon CSP refinement. To enable state-based techniques to be used fur the Object-Z components of a specification we develop state-based refinement relations which are sound and complete with respect to CSP refinement. In addition, a verification method for static and dynamic properties is presented. The method allows us to verify properties of the CSP system specification in terms of its component Object-Z classes by using the laws of the the CSP operators together with the logic for Object-Z.

Structural refinement of systems specified in object-z and CSP

This paper is concerned with methods for refinement of specifications written using a combination of Object-Z and CSP. Such a combination has proved to be a suitable vehicle for specifying complex systems which involve state and behaviour, and several proposals exist for integrating these two languages. The basis of the integration in this paper is a semantics of Object-Z classes identical to CSP processes. This allows classes specified in Object-Z to be combined using CSP operators. It has been shown that this semantic model allows state-based refinement relations to be used on the Object-Z components in an integrated Object-Z/CSP specification. However, the current refinement methodology does not allow the structure of a specification to be changed in a refinement, whereas a full methodology would, for example, allow concurrency to be introduced during the development life-cycle. In this paper, we tackle these concerns and discuss refinements of specifications written using Object-Z and CSP where we change the structure of the specification when performing the refinement. In particular, we develop a set of structural simulation rules which allow single components to be refined to more complex specifications involving CSP operators. The soundness of these rules is verified against the common semantic model and they are illustrated via a number of examples.