3 ms·
True, and there was a question on this topic during the Frama-C and Spark day this year in may in Paris, about similar tools and environments in java. People i
by touisteur 9y ago
True, and there was a question on this topic during the Frama-C and Spark day this year in may in Paris, about similar tools and environments in java. People in the room cited JML and it being the inspiration for ACSL but the conclusion seemed to be that the proof technology wasn't so advanced and supported ? I'm very interested if you have more info on this, I'd be happy to be mistaken.
If you look around there's also EVE (for Eiffel) that B. Meyer mentionned some time ago on his blog. They didn't have to add a specification language or to supplement their original language, it was built in Eiffel from the start :-D.
One funny thing about specification languages is that they 'need' to be expressive to be useful. The Ada 2012 specs added lots of sugar to help writing contracts : quantifiers on collections/arrays (for some, for one), if- and case- expressions (pattern matching isn't far) and expression functions... and in Spark 2014 contract-cases. I expect some more in Ada2020. Since contracts must be executable you get all the sugar for your regular Ada too.
- pron 9y ago> but the conclusion seemed to be that the proof technology wasn't so advanced and supported That depends on the tool. OpenJML[1] just uses SMT solvers, but if you need bigger guns, Krakatoa[2] lets you use either SMT solvers or a proof assistant (either Isabelle or Coq). [1]: http://www.openjml.org/ http://www.openjml.org/ [2]: http://krakatoa.lri.fr/ http://krakatoa.lri.fr/