Hardness and inapproximability of minimizing adaptive distinguishing sequences

Testing Software Design Modeled by Finite-State Machines

Tsun S. Chow · IEEE Transactions on Software Engineering · 1978 · 1.4K citations

Computing, Computer Science, Fault-tolerant Systems +15

Principles and methods of testing finite state machines-a survey

D. Lee, Mihalis Yannakakis · Proceedings of the IEEE · 1996 · 1.2K citations

Computing, Computer Engineering, Computer Science +13

Constructing optimal binary decision trees is NP-complete

Laurent Hyafil, Ronald L. Rivest · Information Processing Letters · 1976 · 956 citations

Computing, Computer Science, Mathematics +10

AN ALGORITHM FOR THE ORGANIZATION OF INFORMATION

M. AdelsonVelskii · Defense Technical Information Center (DTIC) · 1963 · 799 citations

Computing, Computer Science, Information Systems +6

A taxonomy of model‐based testing approaches

Mark Utting, Alexander Pretschner, Bruno Legeard · Software Testing Verification and Reliability · 2011 · 619 citations · Full text

Engineering, Systems Engineering, Model-based Systems Engineering +13