A General Testability Theory
From MaRDI portal
Recommendations
Cites work
- \(\mathcal {HOTL}\): Hypotheses and observations testing logic
- A testing scenario for probabilistic automata
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Fault model-driven test derivation from finite state models: Annotated bibliography
- scientific article; zbMATH DE number 48630 (Why is no real title available?)
- Specification, testing and implementation relations for symbolic-probabilistic systems
- Symbolic Execution Techniques for Test Purpose Definition
- Testing timed automata
- Testing transition systems: An annotated bibliography
Cited in
(13)- Toward a theory of functional testing in discrete dynamic systems
- Connectivity testing
- Implementation relations and test generation for systems with distributed interfaces
- Introducing complexity to formal testing
- When can finite testing ensure infinite trustworthiness?
- Partial models and weak equivalence
- Models of the general theory of test construction of relatively constant malfunctions
- TestNet: Let's test together!
- Root cause analysis of large scale application testing results
- Testing restorable systems: formal definition and heuristic solution based on river formation dynamics
- A framework for table driven testing of Java classes
- A centralized and a decentralized method to automatically derive choreography-conforming web service systems
- Test suite oscillations
This page was built for publication: A General Testability Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3184700)