Information gain of black-box testing
DOI10.1007/S00165-011-0175-6zbMATH Open1226.68031OpenAlexW2088917779MaRDI QIDQ640298FDOQ640298
Authors: Linmin Yang, Zhe Dang, Thomas R. Fischer 
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
Recommendations
Formal languages and automata (68Q45) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)
Cites Work
- A Mathematical Theory of Communication
- Statecharts: a visual formalism for complex systems
- Irreversibility and Heat Generation in the Computing Process
- Title not available (Why is that?)
- Model-based testing of reactive systems. Advanced lectures.
- Title not available (Why is that?)
- Introduction to Software Testing
- Physics and Computation: The Status of Landauer’s Principle
- Formally transforming user-model testing problems into implementer-model testing problems and viceversa
- Testing Systems of Concurrent Black-Boxes—An Automata-Theoretic and Decompositional Approach
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (8)
- A Note on an Anomaly in Black-Box Testing
- Information rate of some classes of non-regular languages: an automata-theoretic approach
- A Semantic Framework for Test Coverage
- Title not available (Why is that?)
- A Stochastic Theory of Black-Box Software Testing
- Execution information rate for some classes of automata
- Title not available (Why is that?)
- Zero-knowledge blackbox testing: where are the faults?
Uses Software
This page was built for publication: Information gain of black-box testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q640298)
