Author:
Budd Timothy A.,Angluin Dana
Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Information Systems,Software
Reference33 articles.
1. Angluin, D.: On the complexity of minimum inference of regular sets. Information and Control39(3): 337?350 (1978)
2. Baldwin, D., Sayward, F.: Heuristics for determining equivalence of program mutations. Technical Report Number 161, Yale University 1979
3. Barzdin, J.M., Bicevskis, J.J., Kalninsh, A.A.: Construction of complete sample system for correctness testing. In: Lecture Notes in Computer Science, Vol. 32, pp. 1?12. Berlin: Springer-Verlag 1975
4. Biermann, A.W., Krishnaswamy, R.: Constructing programs from example computations. IEEE Transactions on Software Engineering SE-2(3): 141?153 (1976)
5. Blum, M.: On effective procedures for speeding up algorithms. Journal of the ACM18(2): 290?305 (1971)
Cited by
138 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Mutation-based Consistency Testing for Evaluating the Code Understanding Capability of LLMs;Proceedings of the IEEE/ACM 3rd International Conference on AI Engineering - Software Engineering for AI;2024-04-14
2. Akka: Mutation Testing for Actor Concurrency in Akka using Real-World Bugs;Proceedings of the 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering;2023-11-30
3. Parallel mutation testing for large scale systems;Cluster Computing;2023-06-20
4. Identifying Coincidental Correct Test Cases with Multiple Features Extraction for Fault Localization;2023 IEEE 47th Annual Computers, Software, and Applications Conference (COMPSAC);2023-06
5. Automated test generation for Scratch programs;Empirical Software Engineering;2023-05