Proof of multi-threaded application.
Subject: Proof of multi-threaded application.
Newsgroups: gmane.comp.lang.ocaml.beginners
Date: 2008-11-17 14:36:18 GMT
Hello,
I am very new to Ocaml, this is my first day, and I wanted to know
if it is possible to prove correctness of a multi-threaded application
written in Ocaml.
Basically, I want to check that a multi-threaded implementation of an
algorithm that detects cycles in a dynamically changing graph, actually
detects the cycles. Also, the algorithm prevents previously detected
cycles from happening by not allowing certain edges to be added. And I
want to check that this property also holds.
Thank you and I hope you can help me,
Silviu ANDRICA.
[Non-text portions of this message have been removed]
Change settings via the Web (Yahoo! ID required)
Change settings via email: Switch delivery to Daily Digest | Switch format to Traditional
Visit Your Group | Yahoo! Groups Terms of Use | Unsubscribe
__,_._,___
RSS Feed