A General Testability Theory (Q3184700)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	A General Testability Theory	scientific article

Statements

scholarly article

0 references

A General Testability Theory (English)

0 references

Ismael Rodríguez

0 references

CONCUR 2009 - Concurrency Theory

0 references

publication date

22 October 2009

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-04081-8_38

0 references

0 references

Symbolic Execution Techniques for Test Purpose Definition

0 references

0 references

An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

0 references

Specification, testing and implementation relations for symbolic-probabilistic systems

0 references

0 references

\(\mathcal {HOTL}\): Hypotheses and observations testing logic

0 references

Testing timed automata

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-642-04081-8_38

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3184700

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3184700&oldid=35133009"