[Haskell] FOPARA 2011: Last CFP and Call for Participation

[Ricardo Peña]

***************************************************************************
*
              LAST CALL FOR PAPERS AND CALL FOR PARTICIPATION
*
*                       2nd International Workshop on                    
*  Foundational and Practical Aspects of Resource Analysis (FOPARA 2011)
*                       May 19th 2011, Madrid, SPAIN 
*                    http://dalila.sip.ucm.es/fopara11/
*
***************************************************************************


REGISTRATION IS OPEN NOW!!


Submission date in few days
---------------------------

Full Paper submission deadline:                 April 15, 2011
Notification of acceptance (for presentation):     April 20, 2011
Early Registration deadline:                    April 25, 2011
FOPARA workshop:                                May 19, 2011
Submission for formal review deadline:             July 8, 2011
Notification of acceptance (for LNCS):             September 16, 2011
Camera ready paper:                             October 7th, 2011


Invited Speaker
---------------

Reinhard Wilhelm (Universitat des Saarlandes)

Timing Analysis and Timing Predictability

I will describe our approach to compute safe and precise upper bounds on
execution times for real-time programs. The required effort and the
precision of the results depends strongly on the characteristics of the
execution platform. Increasing the precision and reducing the effort is
easy if performance is of no concern. However, the ultimate goal is to
design architectures that offer a good combination of performance and
predictability. I will present an overview of existing results in this
research area.


Scope
-----

The 2nd International Workshop on Foundational and Practical Aspects of
Resource Analysis (FOPARA 2011) will be held at the Computer Science
Faculty of Complutense University of Madrid. It will be co-located with the
12th International Symposium Trends in Functional Programming, TFP 2011
(http://dalila.sip.ucm.es/tfp11/).

The workshop will serve as a forum for presenting original research results
that are relevant to the analysis of resource (time, space, and others)
consumption by computer programs. The workshop aims to bring together the
researchers that work on foundational issues with the researchers that
focus more on practical results. Therefore, both theoretical and practical
contributions are encouraged. We also encourage papers that combine theory
and practice.

Topics
------

The following list of topics is non-exhaustive:

  * resource static analysis for embedded or/and critical systems
  * logical and machine-independent characterisations of complexity classes
  * logics closely related to complexity classes
  * type systems for controlling/inferring/checking complexity
  * semantic methods to analyse resources, including quasi- and
    sup-interpretations,
  * practical applications of resource analysis.

Submissions
-----------

FOPARA 2011 is a two-phase workshop. All participants are invited to submit
a draft paper describing the work to be presented at the workshop.  These
submissions will be screened by the program committee chair to make sure
they are within the scope of FOPARA and will appear in the draft
proceedings distributed at the workshop.  Submissions appearing in the draft
proceedings are not peer-reviewed publications. After the workshop, authors
will be given the opportunity to incorporate the feedback from discussions
at the workshop and will be invited to submit a revised full article for
the formal review process. These revised submissions will be reviewed by
the program committee using prevailing academic standards to select the
best articles that will appear in the formal proceedings.

All contributions must be written in English, conform to the Springer LNCS
series format and not exceed 16 pages. The draft proceedings will appear as
a technical report of the Computer Science Department of Complutense
University of Madrid. The papers selected after the reviewing process will
be published as a volume of the Springer LNCS series.

Program Committee
-----------------

  . Puri Arenas (Complutense University of Madrid, ES)
  . David Aspinall (University of Edinburgh, UK)
  . David Cachera (IRISA/École normale supérieure de Cachan, FR)
  . Marko van Eekelen (Radboud University Nijmegen and Open University, NL)
  . Kevin Hammond (University of St. Andrews, UK)
  . Martin Hofmann (LMU, Munich, DE)
  . Tamás Kozsik (Eötvös Loránd University of Budapest, HU)
  . Hans-Wolfgang Loidl (Heriot-Watt, Edinburgh, UK)
  . Jean-Yves Marion (Loria, Nancy, FR)
  . Simone Martini (University of Bologna, IT)
  . Ricardo Pe~na (PC Chair) (Complutense University of Madrid, ES)
  . Simona Ronchi della Rocca (University of Turin, IT)
  . Olha Shkaravska (Radboud University, NL)


Sponsors
--------

  . Computer Science Faculty, Complutense University of Madrid
  . Spanish Ministry of Science and Innovation