source: papers/FDL2012/framework.tex @ 82

The model-checking technique we propose is based on the Counterexample-guided
Abstraction Refinement (CEGAR) methodology \cite{clarke00cegar}. The overall
description of our methodology is shown in figure \ref{cegar}.
We take into account the structure of the system as a set of synchronous components,
each of which has been previously verified and a set of CTL properties is
attached to each component. This set refers to the specification of the
component. We would like to verify whether a concrete model, $M$ presumably
big sized and composed of several components, satisfies a global ACTL property $\Phi$. 
%Due to state space combinatorial explosion phenomenon that occurs when verifying huge and complex systems, an abstraction or approximation of the concrete model has to be done in order to be able to verify the system with model-checking techniques.
Instead of building the product of the concrete components, we replace each concrete component by an abstraction of its behavior derived from a subset of the CTL properties it satisfies. Each abstract component represents an over-approximation of the set of behaviors of its related concrete component \cite{braunstein07ctl_abstraction}.

%\subsection{Overall Description of our methodology}
%In CEGAR loop methodology, in order to verify a global property $\Phi$ on a
%concrete model $M$, an abstraction of the concrete model $\widehat{M}$ is
%generated and tested in the model-checker. As the abstract model is an
%over-approximation of the concrete model and the global property $\Phi$ is in the ACTL fragment,
As show in \cite{clarke94model} for over-approximation abstraction, if $\Phi$
holds on the the abstract model then it holds in the concrete model as well.
However, if $\Phi$ does not hold in the abstract model then one cannot conclude anything regarding the concrete model until the counterexample has been analyzed.
The test of spurious counter-example is then translated into a
SAT problem as in \cite{clarke00cegar}. When a counterexample is proven to be spurious, the refinement phase occurs, injecting more preciseness into the (abstract) model to be analyzed.

%\bigskip
%\begin{definition}
%The property to be verified, $\Phi$ is an ACTL formula. ACTL formulas
%are CTL formulas with only universal path quantifiers: AX, AF, AG and AU.
%\end{definition}

%\begin{definition}
%Given $\widehat{M} = (\widehat{AP}, \widehat{S}, \widehat{S}_0, \widehat{L}, \widehat{R}, \widehat{F})$ an abstract model of a concrete model, $M$ and $\Phi$, a global property to be verified on $M$, the model-checking result can be interpreted as follows:
%
%\begin{itemize}
%\item{$\widehat{M} \vDash \Phi \Rightarrow M \vDash \Phi$ : verification completed }
%\item{$\widehat{M} \nvDash \Phi$  and  $\exists \sigma$ : counterexample analysis required in order to determine whether $M \nvDash \Phi$ or $\widehat{M}$ is too coarse. }
%\end{itemize}
%\end{definition}

%\bigskip
%We can conclude that the property $\Phi$ doesn't hold in the concrete model $M$ if the counterexample path is possible in M. Otherwise the abstract model at step $i : \widehat{M}_i$, has to be refined if $\widehat{M}_i \nvDash \Phi$ and the counterexample obtained during model-checking was proven to be \emph{spurious}.

\begin{figure}[h!]
%   \centering
%   \includegraphics[width=1.2\textwidth]{our_CEGAR_Loop_Enhanced_2S_PNG}
%     \hspace*{-5mm}
     \includegraphics{our_CEGAR_Loop_Enhanced_2S_PNG}
   \caption{\label{cegar} Verification Process }
\end{figure}

\subsection{Concrete system definition}
As mention earlier, our concrete model consists of several components and each
component comes with its specification.
The concrete system is a synchronous composition of components, each of which
described as a Moore machine.
\begin{definition}
A \emph{Moore machine} $C$ is defined by a tuple $\langle I, O, R,$ $\delta, \lambda, \mathbf{R}_0 \rangle$, where,
\begin{itemize}
\item $I$ is a finite set of Boolean inputs signals.
\item $O$ is a finite set of Boolean outputs signals.
\item $R$ is a finite set of Boolean sequential elements (registers).
\item $\delta : 2^I \times 2^R \rightarrow 2^R$ is the transition function.
\item $\lambda : 2^R \rightarrow 2^O$ is the output function.
\item $\mathbf{R}_0 \subseteq 2^R$ is the set of initial states.
\end{itemize}
\end{definition}

\emph{States} (or configurations) of the circuit correspond to Boolean configurations of all the sequential elements.

\begin{definition}
A \emph{Concrete system} $M$ is obtained by synchronous composition of the
component.\\
$M = C_1 \parallel C_2 \parallel \ldots \parallel C_n$,where each $C_i$ is a
Moore machine with a specification associated $\varphi_i = \{\varphi_i^1 \ldots
\varphi_i^k\}$ Each $\varphi_i^j$ is a CTL$\setminus$X formula whose
propositions $AP$ belong to $\{I_i\cup O_i\cup R_i\}$ .
\end{definition}

\subsection{Abstraction definition}

Our abstraction reduces the size of the representation model by
letting free some of its variables. The point is to determine the good set of variable
to be freed and when to free them. We take advantage of the CTL specification
of each component: a CTL property may be seen as a partial view of the tree of
behaviors of its variables. All the variables not specified by the property
can be freed. We introduced the Abstract Kripke Structure (AKS for short) which exactly
specifies when the variable of the property can be freed.
The abstraction of a component is represented by an AKS,
derived from a subset of the CTL properties the component satisfies.
Roughly speaking, AKS($\varphi$), the AKS derived from a CTL property
$\varphi$, simulates all execution trees whose initial state satisfies
$\varphi$. In AKS($\varphi$), states are tagged with the truth values of
$\varphi$'s atomic propositions, among the four truth values of Belnap's logic \cite{belnap77}: inconsistent ($\bot$),
false ($\mathbf{f}$), true ($\mathbf{t}$) and unknown ($\top$)).
States with inconsistent truth values are not represented since they refer to non possible
assignments of the atomic propositions. A set of fairness constraints
eliminates non-progress cycles. The transformation algorithm of a
CTL$\setminus$X property into an AKS is described in
\cite{braunstein07ctl_abstraction,braunstein_phd07}.


%Assume that we have an abstract Kripke structure (AKS) representing the abstract model $\widehat{M}$ of the concrete model of the system M with regard to the property to be verified, $\Phi$. The abstraction method is based on the work described in \cite{ braunstein07ctl_abstraction}.

\begin{definition}{\label{def-aks}}
Given a CTL$\setminus$X property $\varphi$ whose set of atomic propositions is
$AP$, An \emph{Abstract Kripke Structure}, $AKS(\varphi) =(AP, \widehat{S}, \widehat{S}_0, \widehat{L}, \widehat{R}, \widehat{F})$ is a 6-tuple consisting of:

\begin{itemize}
\item { $AP$ : The finite set of atomic propositions of property $\varphi$ }    
\item { $\widehat{S}$ : a finite set of states}
\item { $\widehat{S}_0 \subseteq \widehat{S}$ : a set of initial states}
\item { $\widehat{L} : \widehat{S} \rightarrow \cal{B}^{\mid AP \mid}$ with $\cal{B} = \{\bot, \mathbf{f}, \mathbf{t},\top\}$: a labeling function which labels each state with configuration of current value of each atomic proposition.}
\item { $\widehat{R} \subseteq \widehat{S} \times \widehat{S}$ : a transition relation where $ \forall s \in \widehat{S}, \exists s' \in \widehat{S}$ such that $(s,s') \in \widehat{R}$ }
\item { $\widehat{F}$ : a set of fairness constraints (generalized B\"uchi
acceptance condition)}
\end{itemize}
\end{definition}
%\bigskip

We denote by $\widehat{L}(s)$ the configuration of atomic propositions in state $s$ and by $\widehat{L}(s)[p]$ the projection of configuration $\widehat{L}(s)$ according to atomic proposition $p$.


As the abstract model $\widehat{M}$ is generated from the conjunction of verified properties of the components in the concrete model $M$, it can be seen as the composition of the AKS of each property.
The AKS composition has been defined in \cite{braunstein_phd07}; it extends
the classical synchronous composition of Moore machine to deal with
four-valued variables.
%\bigskip

\begin{definition} An \emph{Abstract model} $\widehat{M}$ is obtained by
synchronous composition of components abstractions. Let $n$ be the number of components in the model and $m$ be the number of selected verified properties of a component; 
let $C_j$ be a component of the concrete model $M$ and $\varphi_{j}^k$ is a CTL formula describing a satisfied property of component $C_j$. Let $AKS (\varphi_{C_j^k})$ the AKS generated from $\varphi_j^k$. We have $\forall j \in [1,n]$ and $\forall k \in [1,m]$:

\begin{itemize}
\item{$ \widehat{C}_j = AKS (\varphi_{C_j^1}) ~||~ AKS (\varphi_{C_j^2} ) ~||~...~||~ AKS (\varphi_{C_j^k}) ~||$\\ $ ...~||~ AKS (\varphi_{C_j^m}) $}
\item{$ \widehat{M} = \widehat{C}_1 ~||~ \widehat{C}_2 ~||~ ... ~||~ \widehat{C}_j ~||~... ~||~ \widehat{C}_n $}
\end{itemize}

\end{definition}


The generation of an abstract model in the form of AKS from CTL formulas is described in \cite{braunstein07ctl_abstraction} and has been implemented (\cite{bara08abs_composant}).


%\subsection{Characterization of AKS}

In an AKS a state where a variable $p$ is {\it unknown}
can simulate all states in which $p$ is either true or false. It
is a concise representation of the set of more concrete states in which $p$
is either true or false.  A state $s$ is said to be an \emph{abstract state}
if one its variable $p$ is {\it unknown}.

%\begin{definition}
%A state $s$ is an {\emph abstract state} if one its variable $p$ is {\it unknown}.
%\end{definition}

\begin{definition}[]
The \emph {concretization} of an abstract state $s$ with respect to the variable $p$
({\it unknown} in that state), assigns either true or false to $p$.

The \emph {abstraction} of a state $s$ with respect to the variable $p$
(either true or false in that state), assigns  {\it unknown} to $p$.
\end{definition}

\begin{property}[Concretization]
\label{prop:concrete}
Let $A_i$ and $A_j$ two abstractions such that $A_j$ is obtained by
concretizing one abstract variable of $A_i$ (resp. $A_i$ is obtained by
abstracting one variable in $A_j$). Then $A_i$ simulates $A_j$, denoted by
$A_j \sqsubseteq A_i$.
\end{property}
\begin{proof}
As the concretization of state reduces the set of concrete configuration the
abstract state represents but does not affect the transition relation of the
AKS. The unroll execution tree of $A_j$ is a sub-tree of the one of $A_i$. Then
$A_i$ simulates $A_j$.
\end{proof}

\begin{property}[Composition and Concretization]
\label{prop:concrete_compose}
Let $\widehat{M_i}$ be an abstract model of $M$ and $\varphi_j^k$ be a property
of a component $C_j$ of M,  $\widehat{M}_{i+1} = \widehat{M_i}\parallel
AKS(\varphi_j^k) $ is more concrete that $ \widehat{M_i}$, $\widehat{M_{i+1}}
\sqsubseteq \widehat{M}_i$.
\end{property}

\begin{proof}
Let $s = (s_i,s_{\varphi_j^k})$ be a state in $S_{i+1}$, such that $s_i\in S_i$ 
and $s_{\varphi_j^k} \in S_{\varphi_j^k}$.
The label of $s_{i+1}$ is obtained by applying the Belnap logic operator and
to values of variables in $s_i$ and $s_{\varphi_j^k}$. For all $p \in
AP_i \cup AP_{\varphi_j^k}$ we have the following label~:
\begin{itemize}
\topsep -.5em
\itemsep -0.5em
\item  $\widehat{L}_{i+1}[p] = \top$ iff  p is {\it unknown} in both states or
does not belong to the set of atomic proposition.
\item  $\widehat{L}_{i+1}[p] = \mathbf{t}$ (or $\mathbf{f}$) iff $p$ is true
(or false) in $s_{\varphi_j^k}$ (resp. $s_i$)  and {\it unknown} in $s_i$
(resp. $s_{\varphi_j^k}$).
\end{itemize}
By property \ref{prop:concrete}, $M_{i+1}$ is more concrete than $M_i$ and by 
the property of parallel composition, 
$\widehat{M_i} \sqsubseteq \widehat{M}_{i} \parallel AKS(\varphi_j^k$).
\end{proof}

\subsection{Initial abstraction}
Given a global property $\Phi$, the property to be verified by the composition of the concrete components model, an abstract model is generated by selecting some of the properties of the components which are relevant to $\Phi$.
%We suppose that our concrete model is a composition of several components and
%each component has been previously verified. Hence, we have a set of verified
%properties for each component of the concrete model. The main idea of this
%technique is that we would like to make use of these properties to generate a
%better abstract model. Properties of the components that appear to be related
%to the global property to be verified, $\Phi$ are selected to generate the
%abstract model $\widehat{M}_i$. This method is particularly interesting as it
%gives a possibility to converge quicker to an abstract model that is
%sufficient to satisfy the global property $\Phi$.
%In the following, we will name primary variables the set of variable that
%appears in the global property.
In the initial abstraction generation, all variables that appear in $\Phi$ have to be
represented. Therefore the properties in the specification of each component
where these variables are present will be used to generate the initial
abstraction, $\widehat{M}_0$ and we will verify the satisfiability of the
global property $\Phi$ on this abstract model. If the model-checking failed and the counterexample given is found to be spurious, we will then proceed with the refinement process.