Table - PMC

Skip to main content

View full-text article in PMC

. 2025 Jul 30;25(15):4695. doi: 10.3390/s25154695

Algorithm 3 Invariant validation algorithm based on execution trace

Require: Execution Trace T, Invariant I

Ensure: Boolean

I s V i o l a t e d

1:
$(P r e, A c t, P o s t) \leftarrow ParseInvariant (I)$
2:
$M a t c h i n g S t a t e s \leftarrow FindStates (T, P r e)$
3:
for all $S_{p r e}$ in $M a t c h i n g S t a t e s$ do
4:
$S_{p o s t} \leftarrow FindNextState (T, S_{p r e}, A c t)$
5:
if Not Matches( $S_{p o s t}$ , $P o s t$ ) then
6:
return true // Violation found
7:
end if
8:
end for
9:
return false // No violation