Skip to content

Implementation and proof of a recursive longest common substring algorithm

Notifications You must be signed in to change notification settings

dkgi/sublist-proof

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 
 
 

Repository files navigation

This is a proof of a simple recursive maximum sublist algorithm using VeriFast. For more information about the implementation and the proof see the Report.pdf document.

VeriFast is freely available at http://people.cs.kuleuven.be/~bart.jacobs/verifast/

About

Implementation and proof of a recursive longest common substring algorithm

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published