LaTe, a Non-fully Deterministic Testing Language

DOI10.1007/11754008_5MaRDI QIDQ3434655zbMATH OpenOpenAlexFDO

Authors Emmanuel Donin de Rosière, Claude Jard, Benoît Parreaux

Publication date 2 May 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11754008_5

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• On conformance testing of non-deterministic systems
• Automatic Testing from Formal Specifications
• Formal Approaches to Software Testing
• scientific article; zbMATH DE number 1390244
• An input language based on extended message sequence charts and used for test specification

Cited in

(1)

• Late and early semantics coincide for testing

This page was built for publication: LaTe, a Non-fully Deterministic Testing Language

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3434655)