Filters








481,062 Hits in 6.1 sec

Checking Sequence Generation Using State Distinguishing Subsequences

Adenilso Simão, Alexandre Petrenko
2009 2009 International Conference on Software Testing, Verification, and Validation Workshops  
A checking sequence generated from a Finite State Machine (FSM) is used in testing to demonstrate correctness of an implementation under test.  ...  Such sequences are shorter and thus can reduce the length of checking sequences.  ...  GENERATING CHECKING SEQUENCES In this section we present a method to generate a checking sequence which is based on the notion of confirmed sets and Lemma 1.  ... 
doi:10.1109/icstw.2009.25 dblp:conf/icst/SimaoP09 fatcat:kz7vpbvwljdkzapwv6dpjzi2gm

Extended state identification and verification using a model checker

Christopher Robinson-Mallett, Peter Liggesmeyer, Tilo Mücke, Ursula Goltz
2006 Information and Software Technology  
The generated test inputs allow state characterization, i.e. the identification and verification of internal states of the software under test by observation of the input/output behavior only.  ...  On the basis of these inputs, a model checking tool performs the testing input generation automatically.  ...  Therefore, a checking sequence is constructed from a cover set, e.g. transition cover, and a set of input sequences that are used to characterize each state of the software corresponding to its specification  ... 
doi:10.1016/j.infsof.2006.03.006 fatcat:jpelrd7hpnaylai5gd7pmc6uoa

Analysis of Metagenomics Next Generation Sequence Data for Fungal ITS Barcoding: Do You Need Advance Bioinformatics Experience?

Abdalla Ahmed
2016 Frontiers in Microbiology  
However, with the availability of next-generation sequencing platforms in many centers, it has become important for medical mycologists to know how to make sense of the massive sequence data generated  ...  During the last few decades, most of microbiology laboratories have become familiar in analyzing Sanger sequence data for ITS barcoding.  ...  One another issue on NGS data analysis is the huge amount of data generated, which is beyond the computing infrastructure of most clinical setting (Stein, 2010) .  ... 
doi:10.3389/fmicb.2016.01061 pmid:27507959 pmcid:PMC4960088 fatcat:cdik3ipkbrhwrdnxp766ydmufq

Generating Checking Sequences for Partial Reduced Finite State Machines [chapter]

Adenilso Simão, Alexandre Petrenko
2008 Lecture Notes in Computer Science  
In Section 3, we define the notion of confirmed sets and use it to state sufficient conditions for an input sequence to be a checking sequence.  ...  The impact of using the reset feature on the length of checking sequence is also experimentally evaluated. [12]. In [5] , Hennie elaborates the basis for the existing generation methods.  ...  Checking Sequence Generation Method Based on Distinguishing Sets In this section, we present a method based on distinguishing sets which exploits overlapping between identification sequences shortening  ... 
doi:10.1007/978-3-540-68524-1_12 fatcat:og76bscb4jfldlhpbfivg6yn2q

Code clones in program test sequence identification

Anupama Surendran, Philip Samuel, K. Poulose Jacob
2011 2011 World Congress on Information and Communication Technologies  
In this work, we have pointed out such a feature of code clones which highlight the relevance of code clones in test sequence identification. Here program slicing is used in code clone detection.  ...  In addition, a classification of code clones is presented and the benefit of using program slicing in code clone detection is also mentioned in this work.  ...  In testing, the need of using code clones in test sequence generation can be applied to such scenarios as there is no need to check or identify test sequence repeatedly for similar clones.  ... 
doi:10.1109/wict.2011.6141393 fatcat:btlf7thgv5bddarf4shbxirdca

FSM Based Re-Testing Methods [chapter]

Khaled El-Fakih, Nina Yevtushenko, Gregor v. Bochmann
2002 IFIP Advances in Information and Communication Technology  
In this paper, we adapt three well-known test derivation methods, namely theW, Wp, and HIS methods, for generating tests that would test the modified parts of the evolving specification.  ...  A number of methods are known for the selection of a test suite based on the specification and an implementation under test given in the form of a finite state machine (FSM).  ...  In this case, when checking a modified transition, we can use lower order transitions (or already checked transitions) to generate shorter re-testing sequences.  ... 
doi:10.1007/978-0-387-35497-2_26 fatcat:f7dxlmxkufhlzhhyfhlx22nqpq

Searching methods for biometric identification systems: Fundamental limits

Frans M.J. Willems
2009 2009 IEEE International Symposium on Information Theory  
In general however individuals can be in more than one cluster, see Fig. 1 , and then the number of cluster-checks times the number of refinement-checks exceeds the number of individuals.  ...  This extends a result of Willems et al. [8] showing that the maximum identification rate of a biometrical system is equal to the mutual information between the enrollment and identification observations  ...  Typical set A~N) (XY U) corresponds to p(x, y, u).Wefirst use a random coding argument to construct a col-lection of covering sequences~(1),~(2), ...  ... 
doi:10.1109/isit.2009.5205870 dblp:conf/isit/Willems09 fatcat:qwokswuxmrbvhlruoq5iutf6nu

Using Multiple Adaptive Distinguishing Sequences for Checking Sequence Generation [chapter]

Canan Güniçen, Guy-Vincent Jourdan, Hüsnü Yenigün
2015 Lecture Notes in Computer Science  
Unlike previous methods, which are based on state recognition using a single state identification sequence, our approach makes use of multiple state identification sequences.  ...  points during the construction of the checking sequence.  ...  Hierons and Hasan Ural for their useful input on an early version of this work.  ... 
doi:10.1007/978-3-319-25945-1_2 fatcat:fn6ouy6il5bkxinedwxidzp4e4

A Novel Method for Blind Identification of a (n, n-1, m) Convolutional Code

Shu Nan Han, the National University of Defense Technology, Hefei, China, Min Zhang
2018 International Journal of Future Computer and Communication  
First, based on the parity check equation set, the parity check vector of a convolutional code is estimated by using the proposed recursive algorithm.  ...  Second, due to the orthogonality between the parity check matrix and the generator matrix, a set of polynomial generator bases are obtained.  ...  Then, due to the orthogonality between the generator matrix and the parity check matrix, a set of polynomial generator bases are derived.  ... 
doi:10.18178/ijfcc.2018.7.2.519 fatcat:76xtue7obnc7nagsc44i7ayuei

A Finite Set Recognition Algorithm of LDPC Coding by Using Soft Decision Sequence

Lu-wei LUO, Ying-ke LEI, Ding-li CHU, Xi-chang LIAO
2018 DEStech Transactions on Computer Science and Engineering  
Aiming at Finite set identification problem of the channel encoding of LDPC code identification system, a novel coding identification algorithm for LDPC Codes using Soft decision sequence is proposed in  ...  The algorithm will introduce the relation of encoding check log-likelihood ratio(CLLR) to receive soft decision sequence.  ...  The received sequence will usually contain errors. At this time, the results of the check-up relationship need to be analyzed by using the wrong sequence.  ... 
doi:10.12783/dtcse/cnai2018/24156 fatcat:aflorazzpjhj5dqw6dgniltnom

Test selection based on finite state models

S. Fujiwara, G. v. Bochmann, F. Khendek, M. Amalou, A. Ghedamsi
1991 IEEE Transactions on Software Engineering  
The (partial) W method is always applicable, however, the size of the W set has a strong impact on the length of the test suite.  ...  In the case of such specifications, even the existence of a W set is not guaranteed any more [Sari 82]. Some authors propose to complete an incompletely defined specification,  ...  This work was partly supported by the Natural Sciences and Engineering Research Council of Canada and the Ministry of Education of QuŽbec.  ... 
doi:10.1109/32.87284 fatcat:biakk3hsrzdztgkuscwiwgmqzu

Heuristics for fault diagnosis when testing from finite state machines

Qiang Guo, Robert M. Hierons, Mark Harman, Karnig Derderian
2007 Software testing, verification & reliability  
Finding strategies to generate an optimal set of diagnosing candidates that could effectively identify faults in the IUT is of great value in reducing the cost of system development and testing.  ...  The proposed heuristics attempt to lead to a symptom being observed in some shorter test sequences, which helps to reduce the cost of fault isolation and identification.  ...  The size of the estimated faulty final state set might be further reduced by using a set of faulty final state identification test sequences.  ... 
doi:10.1002/stvr.352 fatcat:lbjqm4ju3ncotlojx7z6jvzpxe

Analysis of OBE-related SCMS Security Requirements and Evaluation Procedures in V2X Environment

Hak-Jun Kim, Cheong-Min Ji, Man-Pyo Hong
2020 Zenodo  
SCMS, which is applied in the US, is a message security solution for vehicle-to-vehicle communication developed through the US Department of Transportation (USDOT) and Crash Avoidance metrics partnership  ...  Abstract—As technologies for next-generation intelligent transport systems (C-ITS) emerge, automotive security and safety are becoming important issues.  ...  ACKNOWLEDGMENT This research was supported by the Korea Ministry of Land, Infrastructure and Transport.  ... 
doi:10.5281/zenodo.4250525 fatcat:t52tysivqfgn5mwlzpnzdc3u2e

On Resolution Proofs for Combinational Equivalence

Satrajit Chatterjee, Alan Mishchenko, Robert Brayton, Andreas Kuehlmann
2007 Proceedings - Design Automation Conference  
We show that in spite of using these simplification techniques, a CEC engine can be modified to generate a single (extended) resolution proof for the whole miter just as in the naïve case.  ...  If the CEC engine formulates the problem as a single SAT instance (call this naïve), one can use the resolution proof of unsatisfiability as a proof of equivalence.  ...  The advantage of generating a single resolution proof is that it is very easy to check, and is independent of the methods used by the CEC engine.  ... 
doi:10.1109/dac.2007.375234 fatcat:7p4sj3tza5e3lg5ppikziaqcsi

On resolution proofs for combinational equivalence

Satrajit Chatterjee, Alan Mishchenko, Robert Brayton, Andreas Kuehlmann
2007 Proceedings - Design Automation Conference  
We show that in spite of using these simplification techniques, a CEC engine can be modified to generate a single (extended) resolution proof for the whole miter just as in the naïve case.  ...  If the CEC engine formulates the problem as a single SAT instance (call this naïve), one can use the resolution proof of unsatisfiability as a proof of equivalence.  ...  The advantage of generating a single resolution proof is that it is very easy to check, and is independent of the methods used by the CEC engine.  ... 
doi:10.1145/1278480.1278631 dblp:conf/dac/ChatterjeeMBK07 fatcat:cvmwrcxs7fh35iqnmca4cpdasi
« Previous Showing results 1 — 15 out of 481,062 results