Springer LNCS LaTeX 模板（llncs）

\documentclass[runningheads]{llncs}
\usepackage{amsmath}

\begin{document}
\title{Bounded Model Checking of Timed Message Protocols}
\titlerunning{Bounded Model Checking of Timed Protocols}
\author{Erika Mustermann\inst{1}\orcidID{0000-0000-0000-0044} \and
John Doe\inst{2}}
\authorrunning{E. Mustermann and J. Doe}
\institute{Example University, Musterstadt, Germany\\
\email{erika.mustermann@example.org} \and
Institute of Example Studies, Exampleton, USA}
\maketitle

\begin{abstract}
We encode timed protocols as SMT problems and check them up to a bound.
\keywords{Model checking \and Timed automata \and SMT.}
\end{abstract}

\section{Introduction}
\begin{definition}
A run of a protocol is a finite sequence of states $s_0, \dots, s_k$.
\end{definition}

\begin{theorem}\label{thm:bound}
Every run of a protocol with 44 nodes reaches a fixed point within $2n$ steps.
\end{theorem}

\begin{proof}
By induction on the number of pending messages. \qed
\end{proof}

Theorem~\ref{thm:bound} gives the bound we use.
\end{document}