A General Testability Theory
From MaRDI portal
Publication:3184700
DOI10.1007/978-3-642-04081-8_38zbMath1254.68152WikidataQ54280480 ScholiaQ54280480MaRDI QIDQ3184700
Publication date: 22 October 2009
Published in: CONCUR 2009 - Concurrency Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-04081-8_38
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
Testing restorable systems: formal definition and heuristic solution based on river formation dynamics, A centralized and a decentralized method to automatically derive choreography-conforming web service systems, Implementation relations and test generation for systems with distributed interfaces, Introducing complexity to formal testing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Specification, testing and implementation relations for symbolic-probabilistic systems
- \(\mathcal {HOTL}\): Hypotheses and observations testing logic
- Symbolic Execution Techniques for Test Purpose Definition
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Testing timed automata