Two notions of correctness and their relation to testing

DOI10.1007/BF00625279zbMath0478.68014OpenAlexW2033140592MaRDI QIDQ1161275

Dana Angluin, Timothy A. Budd

Publication date: 1982

Published in: Acta Informatica (Search for Journal in Brave)

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

zbMATH Keywords

testingprogram correctnessprogram testingautomatic test set generationequivalence of two programs

Mathematics Subject Classification ID

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

Related Items (1)

Automatic generation of test data for relational queries

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lindenmayer grammars and symbolic testing
• A probabilistic remark on algebraic program testing
• On the Selection of Test Data for Recursive Mathematical Subroutines
• Testing programs with finite sets of data
• Test data as an aid in proving program correctness
• Toward a mathematical theory of inductive inference
• On the complexity of minimum inference of regular sets
• On Effective Procedures for Speeding Up Algorithms

This page was built for publication: Two notions of correctness and their relation to testing