This project was a homework assignament for the "Software Verification and Validation" course at POLITEHNICA Univeristy of Bucharest.
The implementation for the maximum sum subarray problem, also known as the maximum segment sum problem was based off of the solution presented in "Introduction to Algorithms" CLRS.
$ dotnet /path/to/Dafny.dll run test.dfy
Dafny program verifier finished with 1 verified, 0 errors
The maximum subarray sum is: 43
It is beween these 0-index positions: 7 10