The following pages link to Testing can be formal, too (Q5096726):
Displaying 14 items.
- Generation of complete test suites from Mealy input/output transition systems (Q282098) (← links)
- On theorem prover-based testing (Q470025) (← links)
- Testing restorable systems: formal definition and heuristic solution based on river formation dynamics (Q470035) (← links)
- Complete model-based equivalence class testing for nondeterministic systems (Q520246) (← links)
- Formalizing and testing the consistency of DSL transformations (Q736456) (← links)
- Checking experiments for stream X-machines (Q987982) (← links)
- Passive testing with asynchronous communications and timestamps (Q1656880) (← links)
- Testing conformance of a deterministic implementation against a non-deterministic stream X-machine (Q1882901) (← links)
- Timed implementation relations for the distributed test architecture (Q2251156) (← links)
- Introducing complexity to formal testing (Q2291824) (← links)
- Testing against a non-controllable stream X-machine using state counting (Q2368996) (← links)
- Removing redundant refusals: minimal complete test suites for failure trace semantics (Q2687991) (← links)
- Applying formal verification to an open-source real-time operating system (Q6535839) (← links)
- Integrating testing and interactive theorem proving (Q6586529) (← links)
