DATASHEET
NASA Power of 10
‘The Power of 10: Rules for Developing Safety-Critical Code – Gerard J. Holzmann, NASA/JPL Laboratory for Reliable Software’
http://spinroot.com/gerard/pdf/P10.pdf
ENFORCEMENT FOR KW 2024.2
Total | ||
|---|---|---|
a | Total Number of Rules | 10 |
b | Total Number of ‘Not Statically Enforceable’ Rules (Assisted/Unassisted) | 0 |
c | Total Number of Enforceable Rules (a-b) | 10 |
d | Total Number of Enforced Rules | 7 |
e | Total Number of Unenforced Rules | 3 |
f | Enforce Rules Percentage (d/c) | 70% |
g | Unenforced Rules Percentage (e/c) | 30% |
Rule ID | Description | Enforced C/C++ |
|---|---|---|
1 | Restrict all code to very simple control flow constructs – do not use goto statements, setjmp or longjmp constructs, and direct or indirect recursion. | Yes |
2 | All loops must have a fixed upper-bound. It must be trivially possible for a checking tool to prove statically that a preset upper-bound on the number of iterations of a loop cannot be exceeded. If the loop-bound cannot be proven statically, the rule is considered violated. | Yes |
3 | Do not use dynamic memory allocation after initialization. | Yes |
4 | No function should be longer than what can be printed on a single sheet of paper in a standard reference format with one line per statement and one line per declaration. Typically, this means no more than about 60 lines of code per function. | No |
5 | The assertion density of the code should average to a minimum of two assertions per function. Assertions are used to check for anomalous conditions that should never happen in real-life executions. Assertions must always be side-effect free and should be defined as Boolean tests. When an assertion fails, an explicit recovery action must be taken, e.g., by returning an error condition to the caller of the function that executes the failing assertion. Any assertion for which a static checking tool can prove that it can never fail or never hold violates this rule. (I.e., it is not possible to satisfy the rule by adding unhelpful “assert(true)” statements.) | No |
6 | Data objects must be declared at the smallest possible level of scope. | Yes |
7 | The return value of non-void functions must be checked by each calling function, and the validity of parameters must be checked inside each function. | Yes |
8 | The use of the preprocessor must be limited to the inclusion of header files and simple macro definitions. Token pasting, variable argument lists (ellipses), and recursive macro calls are not allowed. All macros must expand into complete syntactic units. The use of conditional compilation directives is often also dubious, but cannot always be avoided. This means that there should rarely be justification for more than one or two conditional compilation directives even in large software development efforts, beyond the standard boilerplate that avoids multiple inclusion of the same header file. Each such use should be flagged by a tool-based checker and justified in the code. | Yes |
9 | The use of pointers should be restricted. Specifically, no more than one level of dereferencing is allowed. Pointer dereference operations may not be hidden in macro definitions or inside typedef declarations. Function pointers are not permitted. | Yes |
10 | All code must be compiled, from the first day of development, with all compiler warnings enabled at the compiler’s most pedantic setting. All code must compile with these setting without any warnings. All code must be checked daily with at least one, but preferably more than one, state-of-the-art static source code analyzer and should pass the analyses with zero warnings. | No |