algorithm discovery
Dec. 14th, 2006 10:39 pm![[personal profile]](https://www.dreamwidth.org/img/silk/identity/user.png){kind=small}
guslYoah Bar-David, Gadi Taubenfeld - Automatic Discovery of Mutual Exclusion Algorithms∗
Their definition of model-checking is strange to me. I thought model-checkers could refute certain algorithms by finding counterexamples, but not find universal proofs!
I look forward to the day when algorithm discovery is applied to compiler optimization. This would put an end the existing trade-off between writing easy-to-read readable declarative code, and writing efficient code.
Their definition of model-checking is strange to me. I thought model-checkers could refute certain algorithms by finding counterexamples, but not find universal proofs!
I look forward to the day when algorithm discovery is applied to compiler optimization. This would put an end the existing trade-off between writing easy-to-read readable declarative code, and writing efficient code.