Introducing complexity to formal testing

DOI10.1016/j.jlamp.2019.100502zbMath1494.68099OpenAlexW2988336228MaRDI QIDQ2291824

Fernando Rosa-Velardo, Ismael Rodríguez, 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

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

Uses Software

• JUnit

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of asynchronous model based testing
• The relation between preset distinguishing sequences and synchronizing sequences
• Specification, testing and implementation relations for symbolic-probabilistic systems
• The complexity of checking the existence and derivation of adaptive synchronizing experiments for deterministic FSMs
• \(\mathcal {HOTL}\): Hypotheses and observations testing logic
• A General Testability Theory
• 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
• Extending EFSMs to Specify and Test Timed Systems with Action Durations and Time-Outs
• A Recursion Theoretic Approach to Program Testing
• Testing can be formal, too
• Checking Completeness of Tests for Finite State Machines
• Model Checking Software
• A Method for the Design of Fault Detection Experiments
• Classes of Recursively Enumerable Sets and Their Decision Problems
• Testing timed automata

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