Information gain of black-box testing

DOI10.1007/s00165-011-0175-6zbMath1226.68031OpenAlexW2088917779MaRDI QIDQ640298

Linmin Yang, Thomas R. Fischer, Zhe Dang

Publication date: 18 October 2011

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-011-0175-6

zbMATH Keywords

entropyfinite automatablack-box testing

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

Information rate of some classes of non-regular languages: an automata-theoretic approach ⋮ Execution information rate for some classes of automata ⋮ ZERO-KNOWLEDGE BLACKBOX TESTING: WHERE ARE THE FAULTS?

Uses Software

• SPIN
• SCR
• TorX

Cites Work

• A Mathematical Theory of Communication
• Statecharts: a visual formalism for complex systems
• Formally transforming user-model testing problems into implementer-model testing problems and viceversa
• Model-based testing of reactive systems. Advanced lectures.
• Testing Systems of Concurrent Black-Boxes—An Automata-Theoretic and Decompositional Approach
• Introduction to Software Testing
• Irreversibility and Heat Generation in the Computing Process
• Physics and Computation: The Status of Landauer’s Principle
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Information gain of black-box testing