\renewcommand{\abstractname}{\normalsize 要 旨}
\begin{abstract}
	当研究室にて Continuation based C\cite{cbc-gcc} (以下CbC) なるC言語の下位言語に当たる言語を開発している．
	先行研究\cite{ryokka-master}にて Floyd-Hoare Logic\cite{hoare}(以下Hoare Logic)を用いてその検証を行なった．
	本稿では，先行研究にて実施されなかった CbC における RedBlackTree の検証を Hoare Logic を用いて検証することを目指す．
\end{abstract}

\renewcommand{\abstractname}{\normalsize Abstract}
\begin{abstract}
	We are developing a language called Continuation based C\cite{cbc-gcc} (CbC), which is a lower language of the C.
	In a previous study\cite{ryokka-master} , Floyd-Hoare Logic\cite{hoare} (Hoare Logic) was used to validate it.
	In this paper, we aim to use Hoare Logic to validate the red-black tree in CbC, which was not performed in previous studies.
\end{abstract}