A Recursion Theoretic Approach to Program Testing

DOI10.1109/TSE.1987.233489MaRDI QIDQ4727403zbMATH OpenOpenAlexFDO

Authors John C. Cherniavsky, Carl H. Smith

Publication date 1987

Published in IEEE Transactions on Software Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tse.1987.233489

zbMATH Keywords

synthesis of programsInductive inferencewhite box testing

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 3982491
• scientific article; zbMATH DE number 1615262
• scientific article; zbMATH DE number 517034
• A contribution to the theory of program testing
• scientific article; zbMATH DE number 4124987

Cited in

(9)

• Approximate testing and its relationship to learning
• Automatic construction of test sets: theoretical approach
• Theory of Program Testing-An Overview
• Training sequences
• Monadic Sequence Testing and Explicit Test-Refinements
• scientific article; zbMATH DE number 1615262 (Why is no real title available?)
• A formal notion of program-based test data adequacy
• Introducing complexity to formal testing
• A contribution to the theory of program testing

This page was built for publication: A Recursion Theoretic Approach to Program Testing

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