Testing Systems of Concurrent Black-Boxes—An Automata-Theoretic and Decompositional Approach

DOI10.1007/11759744_12zbMath1183.68184OpenAlexW1810458149MaRDI QIDQ3434609

Gaoyan Xie, Zhe Dang

Publication date: 2 May 2007

Published in: Formal Approaches to Software Testing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11759744_12

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

Information gain of black-box testing ⋮ Grey-Box Checking

Uses Software

• ASTRAL
• TorX
• MOCHA

Cites Work

• Specifying Concurrent Program Modules
• Tentative steps toward a development method for interfering programs
• Formal Approaches to Software Testing
• Computer Aided Verification
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Testing Systems of Concurrent Black-Boxes—An Automata-Theoretic and Decompositional Approach