|
I Need and Tools to Verify Critical Cyber-Physical Systems |
|
|
1 | (40) |
|
1 Critical Embedded Software: Control Software Development and V&V |
|
|
3 | (4) |
|
2 Formal Methods: Different Approaches for Verification |
|
|
7 | (24) |
|
2.1 Semantics and Properties |
|
|
7 | (4) |
|
2.2 A Formal Verification Methods Overview |
|
|
11 | (8) |
|
|
19 | (2) |
|
2.4 SMT-based Model-checking |
|
|
21 | (2) |
|
2.5 Abstract Interpretation (of Collecting Semantics) |
|
|
23 | (6) |
|
2.6 Need for Inductive Invariants |
|
|
29 | (2) |
|
|
31 | (10) |
|
3.1 Controllers' Development Process |
|
|
31 | (4) |
|
3.2 A Simple Linear System: Spring-mass Damper |
|
|
35 | (6) |
|
II Invariant Synthesis: Convex-optimization Based Abstract Interpretation |
|
|
41 | (86) |
|
4 Definitions---Background |
|
|
43 | (21) |
|
4.1 Discrete Dynamical Systems |
|
|
43 | (11) |
|
4.2 Elements of (Applied) Convex Optimization |
|
|
54 | (10) |
|
5 Invariants Synthesis via Convex Optimization: Postfixpoint Computation as Semialgebraic Constraints |
|
|
64 | (47) |
|
5.1 Invariants, Lyapunov Functions, and Convex Optimization |
|
|
64 | (4) |
|
|
68 | (8) |
|
5.3 Piecewise Quadratic Invariants |
|
|
76 | (11) |
|
5.4 k-inductive Quadratic Invariants |
|
|
87 | (8) |
|
5.5 Polynomial Invariants |
|
|
95 | (8) |
|
|
103 | (5) |
|
|
108 | (3) |
|
6 Template-based Analyses and Min-policy Iteration |
|
|
111 | (16) |
|
6.1 Template-based Abstract Domains |
|
|
111 | (1) |
|
6.2 Template Abstraction Fixpoint as an Optimization Problem |
|
|
112 | (2) |
|
6.3 SOS-relaxed Semantics |
|
|
114 | (8) |
|
|
122 | (2) |
|
|
124 | (3) |
|
III System-level Analysis at Model and Code Level |
|
|
127 | (38) |
|
7 System-level Properties as Numerical Invariants |
|
|
129 | (18) |
|
7.1 Open-loop and Closed-loop Stability |
|
|
130 | (9) |
|
7.2 Robustness with Vector Margin |
|
|
139 | (6) |
|
|
145 | (2) |
|
8 Validation of System-level Properties at Code Level |
|
|
147 | (18) |
|
8.1 Axiomatic Semantics of Control Properties through Synchronous Observers and Hoare Triples |
|
|
147 | (8) |
|
8.2 Generating Annotations: A Strongest Postcondition Propagation Algorithm |
|
|
155 | (4) |
|
8.3 Discharging Proof Objectives using PVS |
|
|
159 | (6) |
|
|
165 | (36) |
|
9 Floating-point Semantics of Analyzed Programs |
|
|
167 | (24) |
|
9.1 Floating-point Semantics |
|
|
167 | (3) |
|
9.2 Revisiting Inductiveness Constraints |
|
|
170 | (3) |
|
9.3 Bound Floating-point Errors: Taylor-based Abstractions aka Zonotopic Abstract Domains |
|
|
173 | (17) |
|
|
190 | (1) |
|
10 Convex Optimization and Numerical Issues |
|
|
191 | (10) |
|
10.1 Convex Optimization Algorithms |
|
|
191 | (5) |
|
10.2 Guaranteed Feasible Solutions with Floats |
|
|
196 | (5) |
Bibliography |
|
201 | (16) |
Index |
|
217 | (3) |
Acknowledgments |
|
220 | |