A General Testability Theory

DOI10.1007/978-3-642-04081-8_38zbMath1254.68152DBLPconf/concur/Rodriguez09OpenAlexW1565992638WikidataQ54280480 ScholiaQ54280480MaRDI QIDQ3184700

Ismael Rodríguez

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

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (4)

Implementation relations and test generation for systems with distributed interfaces ⋮ Testing restorable systems: formal definition and heuristic solution based on river formation dynamics ⋮ Introducing complexity to formal testing ⋮ A centralized and a decentralized method to automatically derive choreography-conforming web service systems

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

This page was built for publication: A General Testability Theory