Made available in DSpace on 2014-07-29T14:57:48Z (GMT). No. of bitstreams: 1 Dissertacao Andre Mesquita Rincon.pdf: 2371244 bytes, checksum: 7b92b62de0f555c3a97f1a973bcf5601 (MD5) Previous issue date: 2011-04-19 / The QualiPSo Project (Quality Platform for Open Source Software) has as goal to investigate Free/Libre/Open Source Software (FLOSS) products to define quality requirements that are important to set the products reliability. One of the QualiPSo Project activities is to evaluate the quality of the developed test sets by the FLOSS community. This work is part of the QualiPso Project and shows the results of the use of structural test criteria as a functional test sets quality measure to identify the state-of-the-practice of performed test activities by free software communities. Furthermore, this work contributes to establish an incremental test strategy to improve the test sets. / O projeto QualiPSo (Quality Platform for Open Source Software) tem por objetivo investigar produtos de software de código gratuito/livre/aberto (Free/Libre/Open Source Software FLOSS) para definir requisitos de qualidade que são importantes para se estabelecer a confiabilidade desses produtos. Uma das atividades do projeto QualiPSo visa avaliar a qualidade de conjuntos de teste desenvolvidos pelas comunidades de software livre. Esta dissertação de mestrado está inserida neste contexto e apresenta os resultados do emprego de critérios de teste estruturais como uma medida da qualidade de conjuntos de teste funcionais visando a identificar o estado-da-prática das atividades de teste desempenhadas pelas comunidades de software livre, bem como, a contribuir no estabelecimento de uma estratégia de teste incremental para evoluir os conjuntos de testes.

Un des plus grands défis dans la conception matérielle et logicielle est de s’assurer que le système soit exempt d’erreurs. La moindre erreur dans les systèmes embarqués réactifs peut avoir des conséquences désastreuses et coûteuses pour certains projets critiques, nécessitant parfois de gros investissements pour les corriger, ou même conduire à un échec spectaculaire et inattendu du système. Prévenir de tels phénomènes en identifiant tous les comportements critiques du système est une tâche assez délicate. Les tests en industrie sont globalement non exhaustifs, tandis que la vérification formelle souffre souvent du problème d’explosion combinatoire. Nous présentons dans ce contexte une nouvelle approche de génération exhaustive de jeux de test qui combine les principes du test industriel et de la vérification formelle académique. Notre approche construit un modèle générique du système étudié à partir de l’approche synchrone. Le principe est de se limiter à l’analyse locale des sous-espaces significatifs du modèle. L’objectif de notre approche est d’identifier et extraire les conditions préalables à l’exécution de chaque chemin du sous-espace étudie. Il s’agit ensuite de générer tout les cas de tests possibles à partir de ces pré-conditions. Notre approche présente un algorithme de quasi-aplatissement plus simple et efficace que les techniques existantes ainsi qu’une compilation avantageuse favorisant une réduction considérable du problème de l’explosion de l’espace d’états. Elle présente également une manipulation symbolique des données numériques permettant un test plus expressif et concret du système étudié. / One of the biggest challenges in hardware and software design is to ensure that a system is error-free. Small errors in reactive embedded systems can have disastrous and costly consequences for a project. Preventing such errors by identifying the most probable cases of erratic system behavior is quite challenging. Indeed, tests in industry are overall non-exhaustive, while formal verification in scientific research often suffers from combinatorial explosion problem. We present in this context a new approach for generating exhaustive test sets that combines the underlying principles of the industrial test technique and the academic-based formal verification approach. Our approach builds a generic model of the system under test according to the synchronous approach. The goal is to identify the optimal preconditions for restricting the state space of the model such that test generation can take place on significant subspaces only. So, all the possible test sets are generated from the extracted subspace preconditions. Our approach exhibits a simpler and efficient quasi-flattening algorithm compared with existing techniques and a useful compiled internal description to check security properties and reduce the state space combinatorial explosion problem. It also provides a symbolic processing technique of numeric data that provides a more expressive and concrete test of the system. We have implemented our approach on a tool called GAJE. To illustrate our work, this tool was applied to verify an industrial project on contactless smart cards security.