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

DOI10.1007/11759744_12MaRDI QIDQ3434609zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Formal black box testing for partially specified deterministic finite state machines
• Model Checking Software
• Translating Testing Theories for Concurrent Systems
• Verification of concurrent programs: The automata-theoretic framework
• On conformance testing of non-deterministic systems
• Automatic and hierarchical verification for concurrent systems
• Automatic verification of concurrent systems using a formula-based compositional approach

Cites work

• Formal Approaches to Software Testing
• scientific article; zbMATH DE number 4180789 (Why is no real title available?)
• scientific article; zbMATH DE number 4110131 (Why is no real title available?)
• scientific article; zbMATH DE number 1951524 (Why is no real title available?)
• scientific article; zbMATH DE number 1982207 (Why is no real title available?)
• scientific article; zbMATH DE number 2013781 (Why is no real title available?)
• scientific article; zbMATH DE number 1746452 (Why is no real title available?)
• scientific article; zbMATH DE number 1418458 (Why is no real title available?)
• Specifying Concurrent Program Modules
• Tentative steps toward a development method for interfering programs
• Thread-modular abstraction refinement.

Cited in

(4)

• Grey-Box Checking
• Some Theory Concerning Certification of Mathematical Subroutines by Black Box Testing
• Synchronous or alternating? LTL black-box checking of Mealy machines by combining the LearnLib and LTSmin
• Information gain of black-box testing

Describes a project that uses

Uses Software

• MOCHA
• ASTRAL
• TorX

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

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