Software Correctness: Testing and Verification

Related lectures (21)

Page 2 of 3

Covers the use of Stainless, a verification tool for Scala, to ensure the correctness of Scala code.

Explains the merge sort algorithm, its correctness, and time complexity compared to other sorting algorithms.

Explores managing defects, testing strategies, and challenges in software quality, with real-world examples and case studies.

Explores compiler correctness, examples of verified compilers, formal verification, and the challenges of certifying compilers.

Explores optimization problems and greedy algorithms for efficient decision-making.

Covers parametric polymorphism, lists construction, tuples, generic methods, merge sort, and proving program properties.

Introduces selection and insertion sorting algorithms, explaining their correctness and time complexity.

Provides an overview of essential search and sort algorithms in computer science.

Explores the challenges and benefits of compiler verification, emphasizing the importance of verifying compilers for critical software.

Covers test statistics, threshold values, and lower bounds for estimating properties.