1 \documentclass{article}

     2 \usepackage{times}

     3 \usepackage[latin1]{inputenc}

     4 %\usepackage{fullpage}

     5 

     6 \addtolength{\textheight}{60mm}

     7 \addtolength{\topmargin}{-30mm}

     8 \addtolength{\textwidth}{70mm}

     9 \addtolength{\oddsidemargin}{-35mm}

    10 

    11 \pagestyle{empty}

    12 \parindent0em

    13 

    14 \begin{document}

    15 

    16 \begin{center}

    17 \textbf{CALL FOR PAPERS}\\[1.2ex]

    18 {\normalsize 22nd International Conference on }\\[0.8ex]

    19 {\large\bfseries Theorem Proving in Higher Order Logics (TPHOLs 2009)}\\[0.8ex]

    20 {\normalsize\itshape 17 -- 20 August 2009, Munich, Germany}\\[1.2ex]

    21 \texttt{http://tphols.in.tum.de/}

    22 \end{center}

    23 

    24 \vspace{0mm}

    25 

    26 \begin{minipage}[t]{6.5cm}% first column

    27 \renewcommand{\baselinestretch}{0.99}\parskip 4pt\small

    28 

    29 \textbf{Program Committee:} \\

    30 Thorsten Altenkirch, \emph{Nottingham University}\\

    31 David Aspinall, \emph{Edinburgh University}\\

    32 Jeremy Avigad, \emph{Carnegie Mellon University}\\

    33 Gilles Barthe, \emph{IMDEA}\\

    34 Christoph Benzmüller, \emph{Saarland University}\\

    35 Peter Dybjer, \emph{Chalmers University}\\

    36 Jean-Christophe Filliâtre, \emph{LRI Paris}\\

    37 Georges Gonthier, \emph{Microsoft Research}\\

    38 Mike Gordon, \emph{Cambridge University}\\

    39 Jim Grundy, \emph{Intel}\\

    40 Reiner Hähnle, \emph{Chalmers University}\\

    41 Joe Hurd, \emph{Galois}\\

    42 Gerwin Klein, \emph{NICTA}\\

    43 Xavier Leroy, \emph{INRIA}\\

    44 Pete Manolios, \emph{Northeastern University}\\

    45 César Muñoz, \emph{NIA Langley}\\

    46 Tobias Nipkow (co-chair), \emph{TU München}\\

    47 Michael Norrish, \emph{NICTA}\\

    48 Sam Owre, \emph{SRI International}\\

    49 Larry Paulson, \emph{Cambridge University}\\

    50 Frank Pfenning, \emph{Carnegie Mellon University}\\

    51 Randy Pollack, \emph{Edinburgh University}\\

    52 Sofiène Tahar, \emph{Concordia University}\\

    53 Laurent Théry, \emph{INRIA}\\

    54 Christian Urban (co-chair), \emph{TU München}\\

    55 Freek Wiedijk, \emph{Radboud University Nijmegen}\\[1em]

    56 %

    57 \textbf{Important Dates:} \\

    58 \begin{tabular}{@{}l@{~~}r@{}}

    59 Submission:              & 8 March 2009\\

    60 Author notification:     & 4 May 2009\\

    61 Camera-ready papers due: & 5 June 2009\\

    62 Conference:              & 17 -- 20 August 2009\\

    63 \end{tabular}

    64 \\[1em]

    65 \textbf{Organizers:} \\[1ex]

    66 \begin{tabular}{@{}l@{}}

    67 Tobias Nipkow\\

    68 Makarius Wenzel\\

    69 Stefan Berghofer\\

    70 Christian Urban\\

    71 \end{tabular}

    72 

    73 \end{minipage}

    74 \hspace{3mm}

    75 \begin{minipage}[t]{12cm}% second column

    76 \renewcommand{\baselinestretch}{0.95}

    77 %\parskip0ex\parindent1.5em

    78 \parskip1ex\parindent0em

    79 %%%\small

    80 TPHOLs is a series of international conferences that started in 1988 and

    81 brings together researchers working in all areas of interactive theorem

    82 proving.  The conference will be held on 17 through 20 August

    83 2009 in Munich.

    84 

    85 {\bf Topics}\medskip

    86 

    87 The program committee welcomes submissions on all aspects of theorem

    88 proving in higher order logics, on related topics in theorem proving and

    89 verification, and on relevant applications. The topics include, but are not

    90 limited to, the following:

    91 

    92 

    93 \begin{itemize} 

    94 \item Specification and verification of hardware: microprocessors, memory 

    95 systems, buses, pipelines, etc; formal semantics of hardware design languages;

    96 synthesis; formal design flows. 

    97 

    98 \item Specification and verification of software: program verification, 

    99   refinement, and synthesis for functional, declarative and imperative

   100   languages; formal semantics of programming languages; proof carrying 

   101   code.

   102 \item Industrial application of theorem provers. 

   103 \item Formalization of mathematical theories. 

   104 \item Advances in theorem prover technology: proof automation and decision 

   105   procedures, induction, combination of deductive and algorithmic approaches, 

   106   incorporation of theorem provers into larger systems, combination of 

   107   theorem provers with other provers and tools. 

   108 \item Other topics, including: security algorithms, properties, and policies; 

   109   specification and requirements analysis of systems; user interfaces for 

   110   theorem provers; development and extension of higher order logics. 

   111 \item Proof Pearls: concise and elegant presentations of interesting examples.

   112 \end{itemize}

   113  

   114 Relevant research involving interactive first-order systems, such as ACL2 

   115 and Mizar, is also welcome. All authors are reminded that their work should 

   116 be presented in a way that users of other systems can understand. 

   117 

   118 Submission is electronic. Papers should be no more than 16 pages in length

   119 and are to be submitted in PDF format. They must conform to the LNCS style 

   120 preferably using LaTeX2e. The proceedings are to be published as a volume 

   121 in the Lecture Notes in Computer Science series and will be available to

   122 participants at the conference.

   123 

   124 Authors of accepted papers are expected to present their paper at

   125 the workshop.

   126 

   127 

   128 \end{minipage}

   129 \end{document}