{"title":"Communication fault injection for multi-protocol Java applications testing","authors":"C. C. Menegotto, T. Weber","doi":"10.1109/LATW.2011.5985899","DOIUrl":"https://doi.org/10.1109/LATW.2011.5985899","url":null,"abstract":"Network applications with high dependability requirements must be carefully tested under communication faults to enhance confidence in proper behavior. Fault injection is very useful for these tests. When the applications use more than one protocol, such as UDP, TCP and RMI, a suitable tool that properly handles all of them is required. However, existing tools either are unable to test this kind of application or impose relevant drawbacks. This paper presents Comform, a communication fault injector for multi-protocol Java applications. It intercepts protocol messages at JVM level and uses firewall rules for fault emulation. The approach is useful for both white and black box testing and preserves the target's source code.","PeriodicalId":138701,"journal":{"name":"2011 12th Latin American Test Workshop (LATW)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115534481","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Testing for faults, looking for defects","authors":"V. Agrawal","doi":"10.1109/LATW.2011.5985888","DOIUrl":"https://doi.org/10.1109/LATW.2011.5985888","url":null,"abstract":"A commonly used criterion for evaluating tests for a VLSI chip is the coverage of modeled stuck-at faults. This coverage is deterministic, is easy to measure and has become an established standard. However, an often-asked question is: can the fault coverage tell us the defect level? Or, do we know how many defective chips will escape testing? This talk explains how thirty years of research provides some answers. An analysis of the test data for a Sematech chip gives a defect level of 1, 000 defective parts per million (DPM) for 99% fault coverage. It further calculates the fault coverage requirement as 99.9% to lower the defect level to 100 DPM. For today's large chips and system-on-chip (SOC) devices tests with such high coverage, if at all possible, are expensive to derive and expensive to apply. So, we pose a second question: how good are the stuck-fault coverage tests at detecting the presence of “real” defects, such as, to name a few, bridges, opens, shorts, or delays? Further analysis of the Sematech test data indicates that the stuck-at fault coverage may be a pessimistic indicator of the defect coverage. In other words, in trying to blindly increase the stuck-at fault coverage we may be chasing wrong targets. We summarize with thoughts on directions the industry is taking.","PeriodicalId":138701,"journal":{"name":"2011 12th Latin American Test Workshop (LATW)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124573557","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
R. P. Bastos, G. D. Natale, M. Flottes, B. Rouzeyre
{"title":"Timing issues for an efficient use of concurrent error detection codes","authors":"R. P. Bastos, G. D. Natale, M. Flottes, B. Rouzeyre","doi":"10.1109/LATW.2011.5985933","DOIUrl":"https://doi.org/10.1109/LATW.2011.5985933","url":null,"abstract":"This work reveals additional timing difficulties by which concurrent error detection (CED) schemes can experience to deal efficiently with transients. It shows previously-unknown error scenarios where short-duration single transient faults in logic circuits succeed in erroneously inverting stored results but CED schemes fail in detecting even single soft errors. The paper demonstrates that typical CED code-based schemes for protecting logic circuits are not as capable as they have been claimed, and so timing conditions are suggested for a more efficient use of them.","PeriodicalId":138701,"journal":{"name":"2011 12th Latin American Test Workshop (LATW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130572195","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
L. Dilillo, P. Rech, J. Gallière, P. Girard, F. Wrobel, F. Saigné
{"title":"Neutron detection in atmospheric environment through static and dynamic SRAM-based test bench","authors":"L. Dilillo, P. Rech, J. Gallière, P. Girard, F. Wrobel, F. Saigné","doi":"10.1109/LATW.2011.5985904","DOIUrl":"https://doi.org/10.1109/LATW.2011.5985904","url":null,"abstract":"In this paper, we propose a technique for the detection of neutrons in atmospheric environment developed in the framework of HAMLET project. This technique relies on the sensitivity of SRAM cells to particle radiation. In particular, we introduce a system based on a memory test bench that records the neutron reactions in memory devices. This system presents a good rate of flexibility from different points of view. It is conceived to be modular, programmable, low power consuming and portable. The main novelty of the proposed test bench is its capability to run detection test with static (hold mode) and dynamic (operation) function. The test bench is independent of the type of memory, allowing the use and the study of the interaction between particles and electronic devices built with different technologies.","PeriodicalId":138701,"journal":{"name":"2011 12th Latin American Test Workshop (LATW)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132063720","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Investigating the effects of transient faults in Programmable Capacitor Arrays","authors":"T. Balen, G. Cardoso, O. Gonçalez, M. Lubaszewski","doi":"10.1109/LATW.2011.5985887","DOIUrl":"https://doi.org/10.1109/LATW.2011.5985887","url":null,"abstract":"In this work, the effects of transient faults in Programmable Capacitor Arrays (PCA) are investigated. Usually, PCA architectures are built from a set of binary-weighted capacitor branches, which can be connected in parallel. The connection of each branch to the terminals of the capacitor array is programmed through analog switches (usually transmission gates). Transient faults, potentially caused by radiation interaction with the silicon, or by the impact of strongly ionizing particles in sensitive nodes, may temporarily close a switch in the PCA, whose default state should be open. In this case, it may occur a charge sharing process, from the equivalent capacitor (programmed into the PCA) to the temporarily connected capacitor (due to the transient effect). Therefore, after the transient, the voltage stored in the equivalent capacitor may be reduced. This effect is investigated with spice simulations. The influence of the values of the capacitors and the sizing of the analog switches (and its control logic) in the magnitude of the charge sharing effect is also investigated. Finally, some possible design-level mitigation techniques are discussed.","PeriodicalId":138701,"journal":{"name":"2011 12th Latin American Test Workshop (LATW)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128877156","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
R. Velazco, G. Foucard, F. Pancher, W. Mansour, Greicy Marques-Costa, D. Sohier, A. Bui
{"title":"Robustness with respect to SEUs of a self-converging algorithm","authors":"R. Velazco, G. Foucard, F. Pancher, W. Mansour, Greicy Marques-Costa, D. Sohier, A. Bui","doi":"10.1109/LATW.2011.5985916","DOIUrl":"https://doi.org/10.1109/LATW.2011.5985916","url":null,"abstract":"Self-convergence is a property of distributed systems, allowing a system, when it was perturbed or badly initialised, to recover a correct operation in a finite number of calculation steps. In this paper is explored the intrinsic robustness of a self converging algorithm with respect to soft errors resulting from SEU (Single Event Upset) phenomena. This study was performed by fault injection using a devoted test platform. A self-converging benchmark program was executed by a LEON3 processor implemented in an FPGA. The low number of observed errors puts in evidence the fault tolerance of the tested algorithm.","PeriodicalId":138701,"journal":{"name":"2011 12th Latin American Test Workshop (LATW)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115362451","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Error-resilient design of branch predictors for effective yield improvement","authors":"S. Almukhaizim, O. Sinanoglu","doi":"10.1109/LATW.2011.5985910","DOIUrl":"https://doi.org/10.1109/LATW.2011.5985910","url":null,"abstract":"Speculative execution methods have been long employed in microprocessors in order to boost their performance. Being speculative, their implementation is self-correcting functionally, as the speculation needs always to be verified, and, if incorrect, its effect nullified. Hence, the actions of a faulty speculative component self-correct, albeit at the cost of some performance degradation. As speculation techniques are aggressively employed to enhance microprocessor's performance, however, such performance faults may result in frequent violation of their expected speculation accuracy, significantly degrading the overall performance of the system. Hence, microprocessors with defective speculative components are discarded, resulting in yield loss. In this work, we propose several error-resilient design strategies for branch predictors; a representative example of speculative processor subsystems. The proposed methods support indexing mechanisms that can effectively re-map the history information, used for predicting branches, to fault-free entries, mitigating the impact of faults in heavily-used entries. Experimental results indicate that the proposed error-resilient design methods significantly reduce the impact of performance faults, effectively improving yield.","PeriodicalId":138701,"journal":{"name":"2011 12th Latin American Test Workshop (LATW)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117203912","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
J. Nacif, Thiago S. F. Silva, L. Vieira, A. Vieira, A. O. Fernandes, C. Coelho
{"title":"A cache based algorithm to predict HDL modules faults","authors":"J. Nacif, Thiago S. F. Silva, L. Vieira, A. Vieira, A. O. Fernandes, C. Coelho","doi":"10.1109/LATW.2011.5985931","DOIUrl":"https://doi.org/10.1109/LATW.2011.5985931","url":null,"abstract":"Verification is the most challenging and time consuming stage in the integrated circuit development cycle. As designs complexities double every two years, novel verification methodologies are needed. We propose an algorithm that dynamically builds and updates an HDL module error proneness list. This list can be used to assist the development team to allocate resources during verification stage. The algorithm is build up using the idea that problematic modules usually hide many uncovered errors. Thus, our algorithm caches the most frequently modified and fixed modules. In an academic experiment composed by 17 modules, using a cache of size 3, we were able to correctly predict almost 80% of the faults occurrences.","PeriodicalId":138701,"journal":{"name":"2011 12th Latin American Test Workshop (LATW)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128663460","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
W. K. Assunção, Daniela de F. Guilhermino Trindade, T. Colanzi, S. Vergilio
{"title":"Evaluating test reuse of a software product line oriented strategy","authors":"W. K. Assunção, Daniela de F. Guilhermino Trindade, T. Colanzi, S. Vergilio","doi":"10.1109/LATW.2011.5985891","DOIUrl":"https://doi.org/10.1109/LATW.2011.5985891","url":null,"abstract":"Software Product Line (SPL) test is an emergent research subject, and works found in the literature address some topics such as test process, plain and guidelines, and most recently, strategies to integrate test methods and criteria in the SPL engineering. Strategies that are SPL oriented allow reuse of test assets and were proposed as an alternative to those ones that test product by product in a separated way. However, studies conducted to evaluate the benefits of such strategies are necessary, and have not been conducted yet. Considering this fact, this paper presents results from the application of the SPL oriented strategy, named Reusable Asset Instantiation (RAI). A comparison with the strategy Product by Product is conducted, considering reuse, and test data generation based on use cases.","PeriodicalId":138701,"journal":{"name":"2011 12th Latin American Test Workshop (LATW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128869392","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On the functional test of MESI controllers","authors":"E. Sánchez, M. Reorda","doi":"10.1109/LATW.2011.5985909","DOIUrl":"https://doi.org/10.1109/LATW.2011.5985909","url":null,"abstract":"This paper proposes a method to identify a functional sequence able to test the circuitry implementing the MESI protocol in a multi-processor or multi-core system. The method is purely functional and does not require any knowledge about the real implementation of the circuitry. It is simply based on forcing the processors to execute a program, while observing the results (both in terms of produced data and performance behavior). Therefore, the method is particularly suitable to be used for at-speed manufacturing test, incoming inspection, and on-line test. Experimental results have been gathered on a compatible MIPS64 multi-processor system.","PeriodicalId":138701,"journal":{"name":"2011 12th Latin American Test Workshop (LATW)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116144827","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}