Springer LNCS LaTeX template (llncs)

The official Springer LNCS template is the llncs class, from CTAN or Springer's proceedings guidelines. Scissor LaTeX has a free look-alike for drafting in your browser, with no account: start from the LNCS template, or write \documentclass[runningheads]{llncs}, for one column with numbered institutes and the class's theorem environments. The same .tex compiles with the official class.

Open the LNCS template in the editor Free, in your browser, no account

The template

The LNCS template is a formal-methods paper about bounded model checking, with three authors at two institutes, keywords, a definition, a theorem with proof, a log-scale chart, a booktabs table, a credits section and numbered references. Open the LNCS template in the editor to see all of it.

Turning it on

llncs is a document class:

\documentclass[runningheads]{llncs}

The layout is the LNCS text block (12.2 by 19.3 cm, one column) centred on Letter paper, or on A4 with the a4paper option, set in Latin Modern at 10 pt. runningheads adds the short title and author list at the top of the pages after the first, with the page number; without it the pages have no head.

Authors with institutes, ORCID, keywords and a theorem

LaTeXCopyOpen in editor (opens in a new tab)

\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}

Problems tab: Layout in the style of the Springer LNCS format (final mode). Not official. To compile elsewhere, add llncs.cls from ctan.org/pkg/llncs.

Class commands

Headings follow the class: "1 Introduction" and "1.1" in bold, with \subsubsection set as a small bold heading on its own line (the class runs it into the paragraph). Figure and table captions read "Fig. 1." and "Table 1.".

Bibliography

The template uses \bibliographystyle{splncs04}, which Scissor LaTeX sets with the Springer LNCS citation style: numbered entries and [1] citations. See bibliographies.

What differs from llncs

To submit, get llncs.cls from CTAN (llncs), where the class documentation is too, or from Springer's proceedings guidelines. Your .tex file compiles with it unchanged. See conference look-alike templates for the other layouts and theorems and proofs for theorem environments in general.

Every example on this page is typeset by Scissor LaTeX when the site is built. Last updated 2026-11-06.