3 ms·
Extra credit for whoever implements logic proofs on concurrent applications.
by AstralStorm 9y ago
Extra credit for whoever implements logic proofs on concurrent applications.
- manmal 9y agoI believe that this will not happen until we have a general AI capable of doing this. (And it will rewrite its own code first :))
- pron 9y agoLanguages designed for safety-critical realtime applications do just that. Well, they don't use proofs as proofs generally have a bad cost/benefit ratio (even for sequential programs), but they do use temporal logics that easily deal with concurrency, which they then verify mostly automatically. Temporal logics were introduced to CS in the late '70s, have resulted in at least two Turing awards, and have enjoyed some success in industry.
- mcguire 9y agoDo you have links? I'm aware of TLA+ and (Jay Misra's) Unity (https://en.wikipedia.org/wiki/UNITY_(programming_language) https://en.wikipedia.org/wiki/UNITY_(programming_language)), but I haven't seen any other uses of temporal logics. (The lengths people will go to in order to get away from box and diamond...)
- pron 9y agoTake a look at Esterel[1], and its current incarnation, SCADE[2], which is used for avionics. [1]: https://en.wikipedia.org/wiki/Esterel https://en.wikipedia.org/wiki/Esterel [2]: http://www.esterel-technologies.com/products/scade-suite/ http://www.esterel-technologies.com/products/scade-suite/
- mhhf 9y agohave a look on CLF[1] and Meta-CLF2[2]: [1] http://www.sciencedirect.com/science/article/pii/S1571066108000790 http://www.sciencedirect.com/science/article/pii/S1571066108... [2] https://www.cs.cmu.edu/~iliano/projects/metaCLF2/index.shtml https://www.cs.cmu.edu/~iliano/projects/metaCLF2/index.shtml