3 ms·
Same way it was done long ago: formal specifications with abstract and/or concrete state machines. Each has pre- & post-conditions plus invariants on its behavi
by nickpsecurity 10y ago
Same way it was done long ago: formal specifications with abstract and/or concrete state machines. Each has pre- & post-conditions plus invariants on its behavior. The implementation is simple. Static in terms of memory & such where possible. The resulting FSM's can be analyzed for about all behaviors, including timing. Such a subset is easier to statically analyze for common errors as well. SPARK or Astree can straight-up prove absence of common errors for subsets like that.
I posted a story recently on ASM's that had a simple introduction plus showed some of the temporal logics and such common with them:
https://news.ycombinator.com/item?id=13151828 https://news.ycombinator.com/item?id=13151828