Open Access
Table 1
Comparison of various automatic algorithm programming model
| Method | Program refinement | Formal verification | ||
|---|---|---|---|---|
| Refinement process | Completeness | Verification conditions | Refinement process | |
| Dijkstra’s weakest precondition method | the weakest precondition transformation rules | specification to abstract program | manually generated | manually verified |
| Morgan’s refinement calculus | Morgan's refinement calculus rules | specification to abstract program | manually generated | manually verified |
| PAR method |
partition and recur rules +
C++ generation system |
specification to executable program | manually generated | manually verified |
| Improved PAR method |
partition and recur rules +
C++ generation system |
specification to executable program | manually generated |
mechanically verified
by Isabelle |
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.