Introducing complexity to formal testing

DOI10.1016/J.JLAMP.2019.100502MaRDI QIDQ2291824zbMATH OpenOpenAlexFDO

Authors Ismael Rodríguez, Fernando Rosa-Velardo, Fernando Rubio

Publication date 31 January 2020

Published in Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jlamp.2019.100502

zbMATH Keywords

testingcomplexity theory

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• A Formal Methodology to Test Complex Heterogeneous Systems
• scientific article; zbMATH DE number 1706341
• Towards a notion of testability

Cites work

• scientific article; zbMATH DE number 2089386 (Why is no real title available?)
• scientific article; zbMATH DE number 48630 (Why is no real title available?)
• scientific article; zbMATH DE number 2038731 (Why is no real title available?)
• scientific article; zbMATH DE number 1746452 (Why is no real title available?)
• scientific article; zbMATH DE number 1746453 (Why is no real title available?)
• A General Testability Theory
• A Method for the Design of Fault Detection Experiments
• A Recursion Theoretic Approach to Program Testing
• Checking Completeness of Tests for Finite State Machines
• Classes of Recursively Enumerable Sets and Their Decision Problems
• Extending EFSMs to Specify and Test Timed Systems with Action Durations and Time-Outs
• Model Checking Software
• Specification, testing and implementation relations for symbolic-probabilistic systems
• Symbolic Execution Techniques for Test Purpose Definition
• Test Case Minimization for Real-Time Systems Using Timed Bound Traces
• Testing Software Design Modeled by Finite-State Machines
• Testing can be formal, too
• Testing timed automata
• The complexity of asynchronous model based testing
• The complexity of checking the existence and derivation of adaptive synchronizing experiments for deterministic FSMs
• The relation between preset distinguishing sequences and synchronizing sequences
• \(\mathcal {HOTL}\): Hypotheses and observations testing logic

Cited in

(5)

• A General Testability Theory
• Test suite oscillations
• Complexity of node coverage games
• When can finite testing ensure infinite trustworthiness?
• Efficient boundary values generation in general metric spaces for software component testing

Describes a project that uses

Uses Software

• JUnit

This page was built for publication: Introducing complexity to formal testing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2291824)