LaTe, a Non-fully Deterministic Testing Language

DOI10.1007/11754008_5zbMath1185.68102OpenAlexW1571006582MaRDI QIDQ3434655

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

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)

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