Introducing complexity to formal testing (Q2291824): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Classes of Recursively Enumerable Sets and Their Decision Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\mathcal {HOTL}\): Hypotheses and observations testing logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic Execution Techniques for Test Purpose Definition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Checking Software / rank
 
Normal rank
Property / cites work
 
Property / cites work: Test Case Minimization for Real-Time Systems Using Timed Bound Traces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending EFSMs to Specify and Test Timed Systems with Action Durations and Time-Outs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Specification, testing and implementation relations for symbolic-probabilistic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3046739 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relation between preset distinguishing sequences and synchronizing sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing can be formal, too / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Recursion Theoretic Approach to Program Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Testability Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Software Design Modeled by Finite-State Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Method for the Design of Fault Detection Experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of checking the existence and derivation of adaptive synchronizing experiments for deterministic FSMs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checking Completeness of Tests for Finite State Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of asynchronous model based testing / rank
 
Normal rank

Revision as of 14:59, 21 July 2024

scientific article
Language Label Description Also known as
English
Introducing complexity to formal testing
scientific article

    Statements

    Introducing complexity to formal testing (English)
    0 references
    0 references
    0 references
    0 references
    31 January 2020
    0 references
    testing
    0 references
    complexity theory
    0 references

    Identifiers