Frama-C-discuss mailing list archives

This page gathers the archives of the old Frama-C-discuss archives, that was hosted by Inria's gforge before its demise at the end of 2020. To search for mails newer than September 2020, please visit the page of the new mailing list on Renater.

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[Frama-c-discuss] CFP: 22nd IEEE Symposium on Computer Arithmetic, Lyon, 22-24 juin 2014

  • Subject: [Frama-c-discuss] CFP: 22nd IEEE Symposium on Computer Arithmetic, Lyon, 22-24 juin 2014
  • From: sylvie.boldo at (Sylvie Boldo)
  • Date: Tue, 30 Sep 2014 14:10:41 +0200
  • In-reply-to: <>
  • References: <>

[Apologies if you receive multiple copies of this message]

Note that this conference welcomes papers about verification and formal proof
techniques related to computer arithmetic.

*************  22nd IEEE Symposium on Computer Arithmetic     *************
*************          Lyon, France, June 22-24, 2015         *************
*************  (location: ?cole normale sup?rieure de Lyon)   *************


Authors are invited to submit papers describing recent advances on all aspects
of computer arithmetic, including, but not restricted to the following topics:
?	Foundations of number systems and arithmetic
?	Arithmetic processor design and implementation
?	Arithmetic algorithms and their analysis
?	Highly-parallel arithmetic units and systems
?	Floating-point units and algorithms
?	Interval arithmetic
?	Standards for number representation and arithmetic
?	High-level language impact on arithmetic systems
?	Elementary and special function implementation
?	Low power units, processors and programs in computer arithmetic
?	Industrial implementation of arithmetic units
?	Test, verification, and formal proof techniques for computer arithmetic
?	New approaches to fault/error-tolerance in arithmetic implementations
?	Arithmetic for FPGA's and configurable logic
?	Design automation for computer arithmetic implementations
?	Computer arithmetic in cryptographic applications (finite fields, protection
against attacks, ?)
?	Algorithms and implementations for multiple-precision arithmetic
?	Computer arithmetic algorithms and implementation for emerging technologies

*Procedure of submission*

The submission should be done following the instructions posted on the
conference web site, in the section "Submission procedure". Authors should
submit the abstract of the paper no later than October 26, 2014. A PDF version
of the full paper should be submitted not later than November 2, 2014.
Submission site :

Submissions must be anonymous, with no author names, affiliations,
acknowledgments, or obvious references (if authors need autoreference, this
should be done without explicit indication, i.e., "in our previous work [14] we
proposed a new..", etc., but as another regular reference "In reference [14] a
new...."). The paper should conform with the following indications:  title that
reflects the content and contribution of the paper, a short abstract, a list of
representative keywords, and an introduction that summarizes the contributions
of the paper at a level appropriate for a non-specialist reader.

Papers under review elsewhere are not acceptable for submission to ARITH 22 and
by submitting a paper you implicitly confirm you are solely submitting it to
ARITH 22. Double submission is seen as a serious violation of professional ethics.

Authors will be notified of acceptance in February 2015, and final camera-ready
papers will be due in march 2015.

*A Note On Paper Formatting*

The final submissions of accepted papers cannot exceed 10 pages (corresponding
to 8+2 extra charged pages) using the IEEE Computer Society Conference format
(two columns). However, for review, authors may submit a paper with a maximum of
20 pages, 12pt font size, single column and double spacing.

* Conference web site*

* Program Committee *

?   Elisardo Antelo,  University of Malaga, Spain;
?   Jean-Claude Bajard,  Universit? Pierre et Marie Curie, Paris, France;
?   Sylvie Boldo,  Inria Saclay-Ile de France, France;
?   Javier Bruguera,  University of Santiago de Compostela, Spain;
?   Neil Burgess,  ARM, USA;
?   Marius Cornea,  Intel, USA;
?   Debjit DasSarma,  AMD, USA;
?   Florent de Dinechin,  INSA de Lyon, France;
?   Tobj?rn Granlund, Royal Institute of Technology, Sweden;
?   John Harrison, Intel, USA;
?   Javier Hormigo,   University of Malaga, Spain;
?   Paolo Ienne,  Ecole Polytechnique F?d?rale de Lausanne, Switzerland;
?   Thorsten Kleinjung, Ecole Polytechnique F?d?rale de Lausanne, Switzerland;
?   Martin Langhammer, Altera, UK;
?   Sanu Matthew,  Intel, USA;
?   David Matula, Southern Methodist University, Texas, USA;
?   Silvia Melitta M?ller,  IBM, Germany;
?   Jean-Michel Muller,  CNRS, ENS de Lyon, France;
?   Alberto Nannarelli,  Technical University of Denmark;
?   Stuart Oberman,  NVIDIA, USA;
?   Takeshi Ogita, Tokyo Woman?s Christian University, Japan;
?   Marco Re, University of Roma "Tor Vergat", Italy;
?   Francisco Rodr?guez-Henr?quez,  Centro de investigaci?n y de Estudios
Avanzados del I.P.N., Mexico;
?   Siegfried Rump,  Hamburg University of Technology, Germany;
?   Michael Schulte,  AMD, USA;
?   Eric Schwarz,  IBM, USA;
?   Peter-Michael Seidel,  University of Hawaii at Manoa, USA    ;
?   James Stine, Oklahoma State University, USA;
?   Naofumi Takagi,  University of Kyoto, Japan;
?   Ping Tak Peter Tang,  Intel, USA;
?   Alexandre Tenca,  Synopsys, USA;
?   Arnaud Tisserand, CNRS, Lannion, France (co-program chair);
?   Julio Villalba,  University of  Malaga, Spain (co-program chair);
?   Reto Zimmermann,  Synopsys, Switzerland.