Occupational allergic multiorgan disease induced by wheat flour

Bakers are repeatedly exposed to wheat flour (WF) and may develop sensitization and occupational rhinoconjunctivitis and/or asthma to WF allergens.1 Several wheat proteins have been identified as causative allergens of occupational respiratory allergy in bakery workers.1 Testing of IgE reactivity in patients with different clinical profiles of wheat allergy (food allergy, wheat-dependent exercise-induced anaphylaxis, and baker's asthma) to salt-soluble and salt-insoluble protein fractions from WF revealed a high degree of heterogeneity in the recognized allergens. However, mainly salt-soluble proteins (albumins, globulins) seem to be associated with baker's asthma, and prolamins (gliadins, glutenins) with wheat-dependent exercise-induced anaphylaxis, whereas both protein fractions reacted to IgE from food-allergic patients.1 Notwithstanding, gliadins have also been incriminated as causative allergens in baker's asthma.2 We report on a 31-year-old woman who had been exposed to WF practically since birth because her family owned a bakery housed in the same home where they lived. She moved from this house when she was 25 years, but she continued working every day in the family bakery. In the last 8 years she had suffered from work-related nasal and ocular symptoms such as itching, watery eyes, sneezing, nasal stuffiness, and rhinorrhea. These symptoms markedly improved when away from work and worsened at work. In the last 5 years, she had also experienced dysphagia with frequent choking, especially when ingesting meats or cephalopods, which had partially improved with omeprazole therapy. Two years before referral to our clinic, she began to have dry cough and breathlessness, which she also attributed to her work environment. Upper and lower respiratory tract symptoms increased when sifting the WF and making the dough. The patient did not experience gastrointestinal symptoms with ingestion of cereal products. Skin prick test results were positive to grass (mean wheal, 6 mm), cypress (5 mm) and Russian thistle pollen (4 mm), WF (4 mm), and peach lipid transfer protein (6 mm) and were negative to rice flour, corn flour, profilin, mites, molds, and animal dander. Skin prick test with a homemade WF extract (10% wt/vol) was strongly positive (15 mm). Serologic tests yielded the following results: eosinophil cationic protein, 47 ?g/L; total serum IgE, 74 kU/L; specific IgE (ImmunoCAP; ThermoFisher, Uppsala, Sweden) to WF, 7.4 kU/L; barley flour, 1.24 kU/L; and corn, gluten, alpha-amylase, peach, and apple, less than 0.35 kU/L. Specific IgE binding to microarrayed purified WF allergens (WDAI-0.19, WDAI-0.53, WTAI-CM1, WTAI-CM2, WTAI-CM3, WTAI-CM16, WTAI-CM17, Tri a 14, profilin, ?-5-gliadin, Tri a Bd 36 and Tri a TLP, and gliadin and glutamine fractions) was assessed as described elsewhere.3 The patient's serum specifically recognized ?-5-gliadin and the gliadin fraction, and no IgE reactivity was observed to other wheat allergens. Spirometry revealed a forced vital capacity of 3.88 L (88%), an FEV1 of 3.04 L (87%), and FEV1/forced vital capacity of 83%. A methacholine inhalation test was performed following an abbreviated protocol,4 and the results were expressed as PD20 in cumulative dose (mg) of methacholine. Methacholine inhalation challenge test result was positive (0.24 mg cumulative dose) when she was working, and after a 3-month period away from work and with no visits to the bakery house, it gave a negative result. A chest x-ray was normal. Specific inhalation challenge test was carried out in the hospital laboratory by tipping WF from one tray to another for 15 minutes. Spirometry was performed at baseline and at 2, 5, 10, 15, 20, 30, 45, and 60 minutes after the challenge with WF. Peak expiratory flow was measured at baseline and then hourly over 24 hours (respecting sleeping time). A 12% fall in FEV1 was observed at 20 minutes and a 26% drop in peak expiratory flow at 9 hours after exposure to WF,

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.