Groups
Groups
Sign in
Groups
Groups
comp.programming.threads
Conversations
About
Send feedback
Help
Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss
Learn more
There are two principal approaches to formal verification: model checking and theorem proving
2 views
Skip to first unread message
amin...@gmail.com
unread,
Jun 12, 2020, 12:40:06 PM
6/12/20
Delete
You do not have permission to delete messages in this group
Copy link
Report message
Show original message
Either email addresses are anonymous for this group or you need the view member email addresses permission to view the original message
to
Hello,
I am a white arab that is an inventor of many scalable algorithms and
there implementations.
There are two principal approaches to formal verification: model checking and theorem proving.
Read more here:
Why don't people use formal methods
https://www.hillelwayne.com/post/why-dont-people-use-formal-methods/
And here is more of my thoughts about it, read them carefully:
https://community.idera.com/developer-tools/general-development/f/getit-and-third-party/71464/about-turing-completeness-and-parallel-programming
Thank you,
Amine Moulay Ramdane.
0 new messages