2011-03-31

[Caml-list] Call For Papers: Extended Deadline: April 10, 2011 - WORLDCOMP 2011 (July 18-21, 2011, USA)

Dear friends and Colleagues:

A number of authors have asked for an extension to the paper
submission deadline; we have granted all such requests.
To be fair, we have decided to offer this extension to everyone.

Please share the announcement below with those who may be interested.
We anticipate having about 2,100 attendees.
With kind regards, Organizing Committee
------------

CALL FOR PAPERS
===========================================================
Extended Paper Submission Deadline: April 10, 2011

WORLDCOMP'11
The 2011 World Congress in Computer Science,
Computer Engineering, and Applied Computing
July 18-21, 2011, Las Vegas, USA

http://www.world-academy-of-science.org/
===========================================================

You are invited to submit a full paper for consideration. All accepted
papers will be published in the respective conference proceedings. The
proceedings will be indexed in Inspec / IET / The Institute for
Engineering & Technology, DBLP / Computer Science Bibliography, and
others.) In the past, all tracks of WORLDCOMP have also been included
in EI Compendex/Elsevier. Like prior years, extended versions of selected
papers will appear in journals and edited research books (a large number
of book projects and journal special issues are in the pipeline:
Springer, Elsevier, BMC journals, ...)

WORLDCOMP'11 is composed of the following main tracks (each includes,
research paper presentations, invited presentations, keynote lectures,
tutorials, workshops, and panel discussions); all tracks will be held
simultaneously, same location and dates: July 18-21, 2011:

o Bioinformatics and Computational Biology (BIOCOMP'11)
o Computer Design (CDES'11)
o Computer Graphics and Virtual Reality (CGVR'11)
o Scientific Computing (CSC'11)
o Data Mining (DMIN'11)
o e-Learning, e-Business, EIS, & e-Government (EEE'11)
o Engineering of Reconfigurable Systems and Algorithms (ERSA'11)
o Embedded Systems and Applications (ESA'11)
o Foundations of Computer Science (FCS'11)
o Frontiers in Education: Computer Science & Computer Engineering (FECS'11)
o Grid Computing and Applications (GCA'11)
o Genetic and Evolutionary Methods (GEM'11)
o Artificial Intelligence (ICAI'11)
o Internet Computing (ICOMP'11)
o Wireless Networks (ICWN'11)
o Information and Knowledge Engineering (IKE'11)
o Image Processing, Computer Vision, & Pattern Recognition (IPCV'11)
o Modeling, Simulation and Visualization Methods (MSV'11)
o Parallel and Distributed Processing Techniques & Applications (PDPTA'11)
o Security and Management (SAM'11)
o Software Engineering Research and Practice (SERP'11)
o Semantic Web and Web Services (SWWS'11)

A link to each of the above can be found at:
http://www.world-academy-of-science.org


IMPORTANT DATES:

April 10, 2011: Submission of papers (about 5 to 7 pages)
April 25, 2011: Notification of acceptance (+/- 6 days)
May 7, 2011: Final papers + Copyright/Consent + Registration
July 18-21, 2011: WORLDCOMP 2011 and all its affiliated conferences

Those who have submitted papers during the month of February will
receive the decision on their papers within the next few days.


ACADEMIC CO-SPONSORS:

Currently being prepared - The Academic sponsors of the last offering
of WORLDCOMP (2010) included research labs and centers affiliated
with (a partial list): University of California, Berkeley; University
of Southern California; University of Texas at Austin; Harvard
University, Cambridge, Massachusetts; Georgia Institute of Technology,
Georgia; Emory University, Georgia; University of Minnesota;
University of Iowa; University of North Dakota; NDSU-CIIT Green
Computing & Comm. Lab.; University of Siegen, Germany; UMIT, Austria;
SECLAB (University of Naples Federico II + University of Naples
Parthenope + Second University of Naples, Italy); National Institute
for Health Research; World Academy of Biomedical Sciences and
Technologies; Russian Academy of Sciences, Russia; International
Society of Intelligent Biological Medicine (ISIBM:123926); The
International Council on Medical and Care Compunetics; Eastern
Virginia Medical School & the American College of Surgeons, USA.


SUBMISSION OF PAPERS:

Prospective authors are invited to submit their papers by uploading
them to the evaluation web site at: http://world-comp.org
Submissions must be uploaded by April 10, 2011 and they must be
in either MS doc (but not docx) or pdf formats (about 5 to 7
pages - single space, font size of 10 to 12). All reasonable
typesetting formats are acceptable (later, the authors of accepted
papers will be asked to follow a particular typesetting format to
prepare their final papers for publication.) Papers must not have
been previously published or currently submitted for publication
elsewhere.
The first page of the paper should include: title of the paper,
name, affiliation, postal address, and email address for each
author. The first page should also identify the name of the Contact
Author and a maximum of 5 topical keywords that would best
represent the content of the paper. Finally, the name of the
conference that the paper is being submitted for consideration
must be stated on the first page.

The length of the final/Camera-Ready papers (if accepted) will be
limited to 7 (two-column IEEE style) pages.

Each paper will be peer-reviewed by two experts in the field for
originality, significance, clarity, impact, and soundness. In cases
of contradictory recommendations, a member of the conference
program committee will be charged to make the final decision
(accept/reject) - often, this would involve seeking help from
additional referees by using a double-blinded review process. In
addition, all papers whose authors included a member of the
conference program committee will be evaluated using the
double-blinded review process. (Essay/philosophical papers will
not be refereed but may be considered for discussion/panels).

All proceedings of WORLDCOMP will be published and indexed in:
Inspec / IET / The Institute for Engineering & Technology,
DBLP / CS Bibliography, and others. In the past, all tracks of
WORLDCOMP have also been included in EI Compendex/Elsevier.
Like prior years, extended versions of selected papers will appear
in journals and edited research books (a large number of book
projects and journal special issues are in the pipeline: Springer,
Elsevier, BMC journals, ...)


MEMBERS OF PROGRAM AND ORGANIZING COMMITTEES:

The members of the Steering Committee of the 2011 congress is currently
being prepared. Last year's (ie, 2010's) members included:
Dr. Selim Aissi (Chief Strategist, Intel Corporation, USA);
Prof. Hamid Arabnia (ISIBM Fellow & Professor, University of Georgia;
Associate Editor, IEEE Transactions on Information Technology in
Biomedicine; Editor-in-Chief, Journal of Supercomputing, Springer;
Advisory Board, IEEE TC on Scalable Computing); Prof. Ruzena Bajcsy
(Member, National Academy of Engineering, IEEE Fellow, ACM Fellow,
Professor; University of California, Berkeley, USA); Prof. Hyunseung
Choo (ITRC Director of Ministry of Information & Communication;
Director, ITRC; Director, Korea Information Processing Society;
Assoc. Editor, ACM Transactions on Internet Technology; Professor,
Sungkyunkwan University, Korea); Prof. Winston Wai-Chi Fang (IEEE
Fellow, TSMC Distinguished Chair Professor, National ChiaoTung
University, Hsinchu, Taiwan, ROC); Prof. Andy Marsh (Director HoIP,
Secretary-General WABT; Vice-president ICET and ICMCC, Visiting
Professor, University of Westminster, UK); Dr. Rahman Tashakkori
(Director, S-STEM NSF Supported Scholarship Program and NSF Supported
AUAS, Appalachian State U., USA); Prof. Layne T. Watson (IEEE Fellow,
NIA Fellow, ISIBM Fellow, Fellow of The National Institute of Aerospace,
Virginia Polytechnic Institute & State University, USA); and
Prof. Lotfi A. Zadeh (Member, National Academy of Engineering; IEEE
Fellow, ACM Fellow, AAAS Fellow, AAAI Fellow, IFSA Fellow; Director,
BISC; Professor, University of California, Berkeley, USA).

The 2011 Program Committees for individual tracks and conferences are
currently being compiled. Many who have already joined the committees
are renowned leaders, scholars, researchers, scientists and
practitioners of the highest ranks; many are directors of research
labs., members of National Academy of Engineering, fellows of
various societies, heads/chairs of departments, program directors
of research funding agencies, deans and provosts as well as members
of chapters of World Academy of Science (chapters: supercomputing;
scientific computing; AI; imaging science; databases; simulation;
software eng.; embedded systems; internet and web technologies;
communications; computer security; and computational biology/bioinformatics.)


2011 PUBLICITY CHAIR:

Ashu M. G. Solo
BCS Fellow (British Computer Society)
Principal/R&D Engineer, Maverick Technologies America Inc.
Intelligent Systems Instructor, Trailblazer Intelligent Systems, Inc.


GENERAL INFORMATION:

WORLDCOMP 2011 will be composed of research presentations, keynote
lectures, invited presentations, tutorials, panel discussions,
and poster presentations. In recent past, keynote/tutorial/panel
speakers have included: Prof. David A. Patterson (pioneer/
architecture, U. of California, Berkeley), Dr. K. Eric Drexler
(known as Father of Nanotechnology), Prof. John H. Holland (known
as Father of Genetic Algorithms; U. of Michigan), Prof. Ian Foster
(known as Father of Grid Computing; U. of Chicago & ANL),
Prof. Ruzena Bajcsy (pioneer/VR, U. of California, Berkeley),
Prof. Barry Vercoe (Founding member of MIT Media Lab, MIT),
Dr. Jim Gettys (known as X-man, developer of X Window System,
xhost; OLPC), Prof. John Koza (known as Father of Genetic
Programming, Stanford U.), Prof. Brian D. Athey (NIH Program
Director, U. of Michigan), Prof. Viktor K. Prasanna (pioneer,
U. of Southern California), Dr. Jose L. Munoz (NSF Program Director
and Consultant), Prof. Jun Liu (Broad Institute of MIT & Harvard U.),
Prof. Lotfi A. Zadeh (Father of Fuzzy Logic), Dr. Firouz Naderi
(Head, NASA Mars Exploration Program/2000-2005 and Associate
Director, Project Formulation & Strategy, Jet Propulsion Lab,
CalTech/NASA), and many other distinguished speakers. To get a
feeling about the conferences' atmosphere, see the 2010 delegates
photos available at: www.pixagogo.com/1676934789

An important mission of WORLDCOMP is "Providing a unique
platform for a diverse community of constituents composed of
scholars, researchers, developers, educators, and practitioners.
The Congress makes concerted effort to reach out to participants
affiliated with diverse entities (such as: universities,
institutions, corporations, government agencies, and research
centers/labs) from all over the world. The congress also attempts
to connect participants from institutions that have teaching as
their main mission with those who are affiliated with institutions
that have research as their main mission. The congress uses a
quota system to achieve its institution and geography diversity
objectives."

One main goal of the congress is to assemble a spectrum of
affiliated research conferences, workshops, and symposiums into
a coordinated research meeting held in a common place at a
common time. This model facilitates communication among
researchers in different fields of computer science, computer
engineering, and applied computing. The Congress also encourages
multi-disciplinary and inter-disciplinary research initiatives;
ie, facilitating increased opportunities for cross-fertilization
across sub-disciplines.

According to "Microsoft Academic Search" (a Microsoft initiative)
all tracks of WORLDCOMP are listed as worldwide "Top-ranked
Conferences" (based on various metrics but mainly based on the
number of citations). You can access "Microsoft Academic Search" to
extract citation data for each individual track of worldcomp using
the following link: http://academic.research.microsoft.com/
As of March 4, 2011, the papers published in the proceeedings have
received 14,385 citations which is a higher citation than many
reputable journals in computer science.

=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=

This email was sent to: caml-list@inria.fr

To opt out of this email list:
http://world-comp.org/cgi-bin/rm/full.cgi?e4f1387c-76bb-4321-b374-0a9fb983203c


--
Caml-list mailing list. Subscription management and archives:
https://sympa-roc.inria.fr/wws/info/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs

2011-03-26

[Caml-list] Call for Papers: Conference on Domain-Specific Languages (DSL 2011)

============================ Call for Papers ============================


DSL 2011: Conference on Domain-Specific Languages
(IFIP sponsorship pending approval)


6-8 September 2011, Bordeaux, France


http://dsl2011.bordeaux.inria.fr/


CALL FOR PAPERS


Domain-specific languages have long been a popular way to shorten
the distance from ideas to products in software engineering. On one
hand, the interface of a DSL lets domain experts express high-level
concepts succinctly in familiar notation, such as grammars for text or
scripts for animation, and often provides guarantees and tools that take
advantage of the specifics of the domain to help write and maintain
these particular programs. On the other hand, the implementation of a
DSL can automate many tasks traditionally performed by a few experts
to turn a specification into an executable, thus making this expertise
available widely. Overall, a DSL thus mediates a collaboration between
its users and implementers that results in software that is more usable,
more portable, more reliable, and more understandable.


These benefits of DSLs have been delivered in domains old and new, such
as signal processing, data mining, and Web scripting. Widely known
examples of DSLs include Matlab, Verilog, SQL, LINQ, HTML, OpenGL,
Macromedia Director, Mathematica, Maple, AutoLisp/AutoCAD, XSLT, RPM,
Make, lex/yacc, LaTeX, PostScript, and Excel. Despite these successes,
the adoption of DSLs have been stunted by the lack of general tools and
principles for developing, compiling, and verifying domain-specific
programs. General support for building and using DSLs is thus urgently
needed. Languages that straddle the line between the domain-specific
and the general-purpose, such as Perl, Tcl/Tk, and JavaScript, suggest
that such support be based on modern notions of language design and
software engineering. The goal of this conference, following the last
one in 2009, is to explore how present and future DSLs can fruitfully
draw from and potentially enrich these notions.


We seek research papers on the theory and practice of DSLs, including
but not limited to the following topics.


* Foundations, including semantics, formal methods, type theory, and
complexity theory
* Language design, including concrete syntax, semantics, and types
* Software engineering, including domain analysis, software design,
and round-trip engineering
* Modularity and composability of DSLs
* Software processes, including metrics for software and language
evaluation
* Implementation, including parsing, compiling, program generation,
program analysis, transformation, optimization, and parallelization
* Reverse engineering, re-engineering, design discovery, automated
refactoring
* Hardware/software codesign
* Programming environments and tools, including visual languages,
debuggers, testing, and verification
* Teaching DSLs and the use of DSLs in teaching
* Case studies in any domain, especially the general lessons they
provide for DSL design and implementation


The conference will include a visit to the city of Bordeaux, a tour
and tasting at the wine museum and cellar, and a banquet at La Belle
Époque.


INSTRUCTIONS FOR AUTHORS


Papers will be judged on the depth of their insight and the extent
to which they translate specific experience into general lessons
for software engineers and DSL designers and implementers. Where
appropriate, papers should refer to actual languages, tools, and
techniques, provide pointers to full definitions, proofs, and
implementations, and include empirical results.


Proceedings will be published in Electronic Proceedings in Theoretical
Computer Science (http://info.eptcs.org/). Submissions and final
manuscripts should be at most 25 pages in EPTCS format.


IMPORTANT DATES


* 2011-04-18: Abstracts due
* 2011-04-25: Submissions due
* 2011-06-10: Authors notified of decisions
* 2011-07-11: Final manuscripts due
* 2011-09-05: Distilled tutorials
* 2011-09-06/2011-09-08: Main conference


PROGRAM COMMITTEE


* Emilie Balland (INRIA)
* Olaf Chitil (University of Kent)
* Zoé Drey (IRIT)
* Nate Foster (Cornell University)
* Mayer Goldberg (Ben-Gurion University)
* Shan Shan Huang (LogicBlox)
* Sam Kamin (University of Illinois at Urbana-Champaign)
* Jerzy Karczmarczuk (University of Caen)
* Jan Midtgaard (Aarhus University)
* Keiko Nakata (Tallinn University of Technology)
* Klaus Ostermann (University of Marburg)
* Jeremy Siek (University of Colorado at Boulder)
* Tony Sloane (Macquarie University)
* Josef Svenningsson (Chalmers University of Technology)
* Paul Tarau (University of North Texas)
* Dana N. Xu (INRIA)


ORGANIZERS


Local chair: Emilie Balland (INRIA)
Program chairs: Olivier Danvy (Aarhus University),
Chung-chieh Shan (Rutgers University)


------------------------------------------------------------------------


--
Caml-list mailing list. Subscription management and archives:
https://sympa-roc.inria.fr/wws/info/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs

2011-01-16

[Caml-list] [PAPP2011] Practical Aspects of High-Level Parallel Programming: last call for papers (deadline: January, 23)

Please accept our apologies for multiple copies of this email

----------------------------------------------------------------

Eighth International Workshop on
Practical Aspects of High-Level Parallel Programming (PAPP 2011)

----------------------------------------------------------------

part of The International Conference on Computational Science
June 1-3, 2011, Tsukuba, Japan

http://www.papp-workshop.org

AIMS AND SCOPE

Computational Science applications are more and more complex to
develop and require more and more computing power. Sequential
computing cannot go further. Major companies in the computing industry
now recognise the urgency of re-orienting an entire industry towards
massively parallel computing.

Parallel and grid computing are solutions to the increasing need for
computing power. The trend is towards the increase of cores in
processors, the number of processors and the need for scalable
computing everywhere. But parallel and distributed programming is
still dominated by low-level techniques such as send/receive message
passing. Thus high-level approaches should play a key role in the
shift to scalable computing in every computer.

Algorithmic skeletons, parallel extensions of functional languages
such as Haskell and ML, parallel logic and constraint programming,
parallel execution of declarative programs such as SQL queries,
genericity and meta-programming in object-oriented languages,
etc. have produced methods and tools that improve the
price/performance ratio of parallel software, and broaden the range of
target applications. Also, high level languages offer a high degree of
abstraction which ease the development of complex systems. Moreover,
being based on formal semantics, it is possible to certify the
correctness of critical parts of the applications.

The PAPP workshop focuses on practical aspects of high-level parallel
programming: design, implementation and optimisation of high-level
programming languages, semantics of parallel languages, formal
verification, design or certification of libraries, middle-wares and
tools (performance predictors working on high-level parallel/grid
source code, visualisations of abstract behaviour, automatic hot-spot
detectors, high-level GRID resource managers, compilers, automatic
generators, etc.), application of proof assistants to parallel
applications, applications in all fields of computational science,
benchmarks and experiments. Research on high-level grid programming is
particularly relevant as well as domain specific parallel software.

The aim of all these languages and tools is to improve and ease the
development of applications (safety, expressivity, efficiency,
etc.). Thus the PAPP workshop focuses on applications.

The PAPP workshop is aimed both at researchers involved in the
development of high level approaches for parallel and grid computing
and computational science researchers who are potential users of these
languages and tools. Topics

We welcome submission of original, unpublished papers in English on
topics including:

* applications in all fields of high-performance computing
and visualisation (using high-level tools)
* high-level models (CGM, BSP, MPM, LogP, etc.) and tools for
parallel and grid computing
* high-level parallel language design, implementation and optimisation
* practical aspects of computer assisted verification for
high-level parallel languages
* modular, object-oriented, functional, logic, constraint
programming for parallel, distributed and grid computing systems
* algorithmic skeletons, patterns and high-level parallel libraries
* generative (e.g. template-based) programming with algorithmic skeletons,
patterns and high-level parallel libraries
* benchmarks and experiments using such languages and tools

PAPER SUBMISSION AND PUBLICATION

Prospective authors are invited to submit full papers in English
presenting original research. Submitted papers must be unpublished and
not submitted for publication elsewhere. Papers will go through a
rigorous reviewing process. Each paper will be reviewed by at least
three referees. The accepted papers will be published in the Procedia
Computer Science series, as part of the ICCS proceedings.

Submission must be done through the ICCS website.

We invite you to submit a full paper of at most 10 pages describing
new and original results, no later than January 23, 2011. Submission
implies the willingness of at least one of the authors to register and
present the paper.

Accepted papers should be presented at the workshop.

IMPORTANT DATES

* January 23, 2011 (extended and firm): Full paper due
* February 20, 2011: Notification
* March 7, 2011: Camera-ready paper due

PROGRAMME COMMITTEE

* Marco Aldinucci (University of Torino, Italy)
* Jost Berthold (University of Copenhagen, Denmark)
* Kento Emoto (University of Tokyo, Japan)
* Frederic Gava (University Paris-East, France)
* Alexandros Gerbessiotis (NJIT, USA)
* Clemens Grelck (University of Amsterdam, Netherlands)
* Hideya Iwasaki (The University of Electro-communications, Japan)
* Roman Leshchinskiy (Standard Chartered Bank, UK)
* Frederic Loulergue, chair (University of Orleans, France)
* Bruno Raffin (INRIA, France)
* Aamir Shafi (NUST, Pakistan)

--
Caml-list mailing list. Subscription management and archives:
https://sympa-roc.inria.fr/wws/info/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs

2011-01-12

[Caml-list] LOPSTR 2011 - call for papers

============================================================

Preliminary Call for papers
21th International Symposium on
Logic-Based Program Synthesis and Transformation
LOPSTR 2011

http://users.dsic.upv.es/~lopstr11/
Odense, Denmark, July 18-20, 2011
(co-located with PPDP 2011)

============================================================

Objectives:

The aim of the LOPSTR series is to stimulate and promote international
research and collaboration on logic-based program development. LOPSTR
is open to contributions in logic-based program development in any
language paradigm. LOPSTR has a reputation for being a lively,
friendly forum for presenting and discussing work in progress. Formal
proceedings are produced only after the symposium so that authors can
incorporate this feedback in the published papers.

The 21st International Symposium on Logic-based Program Synthesis and
Transformation (LOPSTR 2011) will be held in Odense, Denmark; previous
symposia were held in Hagenberg, Coimbra, Valencia, Lyngby, Venice,
London, Verona, Uppsala, Madrid, Paphos, London, Venice, Manchester,
Leuven, Stockholm, Arnhem, Pisa, Louvain-la-Neuve, and Manchester (you
might have a look at the contents of past LOPSTR symposia). LOPSTR
2011 will be co-located with PPDP 2011 (International ACM SIGPLAN
Symposium on Principles and Practice of Declarative Programming).


Topics:

Topics of interest cover all aspects of logic-based program development,
all stages of the software life cycle, and issues of both programming-
in-the-small and programming-in-the-large. Papers describing
applications in these areas are especially welcome. Contributions are
welcome on all aspects of logic-based program development, including,
but not limited to:

- specification
- synthesis
- verification
- transformation
- analysis
- optimisation
- specialization
- partial evaluation
- inversion
- composition
- program/model manipulation
- certification
- security
- transformational techniques in SE
- applications and tools

Survey papers, that present some aspect of the above topics from a new
perspective, and application papers, that describe experience with
industrial applications, are also welcome. Papers must describe
original work, be written and presented in English, and must not
substantially overlap with papers that have been published or that are
simultaneously submitted to a journal or a conference with refereed
proceedings. Work that already appeared in unpublished or informally
published workshops proceedings may be submitted.

Following past editions, the formal post-conference proceedings are
planned to be published by Springer-Verlag in the Lecture Notes in
Computer Science (LNCS) series.


IMPORTANT DATES AND SUBMISSION GUIDELINES:


- Paper submission: March 27, 2011
- Extended abstract submission: April 3, 2011
- Notification (for pre-proceedings): May 16, 2011
- Camera-ready (for pre-proceedings): June 12, 2011
- Symposium: July 18-20, 2011


Submissions can either be (short) extended abstracts or (full) papers
whose length should not exceed 9 and 15 pages (including references),
respectively. Submissions must be formatted in the Lecture Notes in
Computer Science style (excluding well-marked appendices not intended
for publication). Referees are not required to read the appendices,
and thus papers should be intelligible without them. Short papers may
describe work-in-progress or tool demonstrations.

Both short and full papers can be accepted for presentation at the
symposium and will then appear in the LOPSTR 2011
pre-proceedings. Full papers can also be immediately accepted for
publication in the formal proceedings, which is planned to be
published by Springer-Verlag in the LNCS series. In addition, after
the symposium, the programme committee will select further short or
full papers presented in LOPSTR 2011 to be considered for formal
publication. These authors will be invited to revise and/or extend
their submissions in the light of the feedback solicited at the
symposium. Then after another round of reviewing, these revised papers
can also be published in the formal proceedings.


Program Committee:

TBD

Contacts

Program Chair
(contact him for additional information about papers and submissions)

German Vidal
Department of Computer Science (DSIC)
Universitat Politecnica de Valencia
Valencia, Spain
Email: lopstr11@dsic.upv.es

General Chair

Peter Schneider-Kamp
Dept. of Mathematics and Computer Science
University of Southern Denmark
Campusvej 55
DK-5230 Odense M, Denmark
Email: petersk@imada.sdu.dk

--
Caml-list mailing list. Subscription management and archives:
https://sympa-roc.inria.fr/wws/info/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs

2011-01-10

[Caml-list] SFM-11:CONNECT school in Bertinoro -- 1st call for participation

***********************************************************
* *
* SFM-11:CONNECT *
* *
* 11th International School on *
* Formal Methods for the Design of *
* Computer, Communication and Software Systems: *
* Connectors for Eternal Networked Software Systems *
* *
* Bertinoro (Italy), 13-18 June 2011 *
* *
* http://www.sti.uniurb.it/events/sfm11connect/ *
* *
***********************************************************
* CALL FOR PARTICIPATION *
* (deadline: 21 March 2011) *
***********************************************************


GENERAL INFORMATION ABOUT SFM
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^

Formal methods are emerging in computer science as a prominent
approach to the rigorous design of computer, communication and
software systems.

The aim of the SFM series is to offer a good spectrum of
current research in foundations as well as applications of
formal methods, which can be of interest for graduate students
and young researchers who intend to approach the field.

This year SFM is held in collaboration with the researchers
of the EU-funded projects CONNECT (http://connect-forever.eu/)
and EternalS (https://www.eternals.eu/) and covers topics such
as connecting eternal software systems, formal foundations
for connectors, dynamic connector synthesis, interaction behavior
monitoring and learning, and dependability assurance of
connected systems.


COURSES AND LECTURERS
^^^^^^^^^^^^^^^^^^^^^

The school features the following lectures and lab sessions:

"Introduction to Interoperability"
Gordon Blair (Univ. Lancaster, UK)
Massimo Paolucci (Docomo Euro-Labs Munich, DE)

"Interoperability Challenges in Cyber-Physical Systems"
Nalini Venkatasubramanian (Univ. California at Irvine, US)

"The CONNECT Architecture"
Nikolaos Georgantas (INRIA Paris-Rocquencourt, FR)
Paul Grace (Univ. Lancaster, UK)

"Lab Session: Solving Interoperability Problems"
Nikolaos Georgantas (INRIA Paris-Rocquencourt, FR)
Paul Grace (Univ. Lancaster, UK)

"Introduction to Modeling and Quantitative Verification"
Marta Kwiatkowska (Univ. Oxford, UK)
David Parker (Univ. Oxford, UK)

"Modeling and Verification of Components and Connectors"
Christel Baier (Tech. Univ. Dresden, DE)

"Quantitative Compositional Verification"
Marta Kwiatkowska (Univ. Oxford, UK)
David Parker (Univ. Oxford, UK)

"Lab Session: Modeling and Compositional Verification of
Probabilistic Component-Based Systems Using PRISM"
David Parker (Univ. Oxford, UK)
Hongyang Qu (Univ. Oxford, UK)

"Application-Layer Connector Synthesis"
Paola Inverardi (Univ. L'Aquila, IT)

"Context Synthesis"
Dimitra Giannakopoulou (NASA Ames, US)

"Middleware-Layer Connector Synthesis"
Valerie Issarny (INRIA Paris-Rocquencourt, FR)

"Lab Session: Tools for Automatic Connector Synthesis"
Dimitra Giannakopoulou (NASA Ames, US)
Massimo Tivoli (Univ. L'Aquila, IT)

"Automata Learning"
Bernhard Steffen (Tech. Univ. Dortmund, DE)

"Testing Supported by Learning"
Jan Tretmans (Radboud Univ. Nijmegen, NL)

"Machine Learning and Data"
Bengt Jonsson (Univ. Uppsala, SE)

"Lab Session: Experiences with LearnLib"
Falk Howar (Tech. Univ. Dortmund, DE)
Maik Merten (Tech. Univ. Dortmund, DE)

"Dependability Assessment of Dynamic Connected Systems"
Antonia Bertolino (CNR-ISTI Pisa, IT)
Felicita Di Giandomenico (CNR-ISTI Pisa, IT)

"The Multi-Facets of Building Dependable Physical Computing Systems"
Shing-Chi Cheung (Hong Kong Univ. Sci. Tech., HK)

"Computational Trust"
Mogens Nielsen (Univ. Aarhus, DK)

"Security and Trust"
Ilaria Matteucci (CNR-IIT Pisa, IT)
Rachid Saadi (INRIA Paris-Rocquencourt, FR)

"Modeling Spatial and Temporal Variability with
the HATS Abstract Behavioral Modeling Language"
Ina Schaefer (Tech. Univ. Chalmers, SE)

"Kernel Methods for Relational Learning and Semantic Modeling"
Alessandro Moschitti (Univ. Trento, IT)

"Model-Based Security Engineering for Evolving Systems"
Jan Jurjens (Tech. Univ. Dortmund, DE)

"Eternal Systems: Myths or Reality?"
Valerie Issarny (INRIA Paris-Rocquencourt, FR)

All participants will receive a copy of a tutorial book published by
Springer as a volume in the Lecture Notes in Computer Science series.


LOCATION
^^^^^^^^

SFM-11:CONNECT will be held in the medieval hilltop town of Bertinoro.

This town is in Emilia Romagna, about 70 km south-east of Bologna,
at an elevation of about 230 m. It can be reached in a couple of
hours from the international airport "G. Marconi" of Bologna by
shuttle (from the airport to the railway station) + train (from
Bologna to Forli`) + bus/taxi (from the railway station to Bertinoro).
The closest airport is the "L. Ridolfi" airport of Forli`, which is
13 km away.

Bertinoro is close to many splendid locations such as Urbino,
Gradara, San Leo, and the Republic of San Marino, as well as some
less well-known locations like the thermal springs of Fratta Terme.

Bertinoro can also be a base for visiting some of the better-known
Italian locations such as Bologna, Rimini, Ravenna, Ferrara, Venezia,
Padova, Verona, Firenze, Pisa, and Siena.

Bertinoro itself is picturesque, with its narrow streets and
walkways winding around the central peak. The school will be held
at the Centro Residenziale Universitario (CRU), an ex-episcopal
fortress that has been converted by the University of Bologna into
a modern conference center with computing facilities and Internet
access. From the fortress, it is possible to enjoy a beautiful vista
stretching from the Apennines to the Adriatic coast and the Alps
over the Po Valley.


ORGANIZATION
^^^^^^^^^^^^

Scientific directors:
* Marco Bernardo (University of Urbino, IT)
* Valerie Issarny (INRIA Paris-Rocquencourt, FR)

Secretary:
* Roberta Partisani (CRU Bertinoro, IT)

Webmaster:
* Alessandro Aldini (University of Urbino, IT)


APPLICATION
^^^^^^^^^^^

Prospective participants should send by 21 March 2011
the application form, available on the school web site,
to the two e-mail addresses below:

Marco Bernardo
bernardo AT sti.uniurb.it

Roberta Partisani
rpartisani AT ceub.it

The registration fee is 550 euros and includes the school material.

The accommodation fee is 350 euros and covers the period June 12-19
(7 nights) in double room (to share with another participant),
half board (breakfast and lunch, dinner of June 12 included,
lunch of June 29 excluded).

The reduced accommodation fee for the participants who do not
need a room is 100 euros and covers the period June 13-18
(6 lunches).

A very limited number of grants is available to cover part
of the registration fee (no grant can be requested to cover
the accommodation fee or the travel expenses).

Notification of accepted/rejected applications and grant requests
will be communicated by March 31.

Registration to the school is due by April 20.

No refund is possible for cancellation after May 15.


SPONSORSHIPS
^^^^^^^^^^^^

Sponsorship for this event was kindly provided by:

* EU-funded project CONNECT (http://connect-forever.eu/).
* EU-funded project EternalS (https://www.eternals.eu/).


--
Caml-list mailing list. Subscription management and archives:
https://sympa-roc.inria.fr/wws/info/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs

2011-01-06

[Caml-list] CSL 2011 Call for Papers and Workshops

----------------------------------------------------------------------

CALL FOR PAPERS AND WORKSHOP PROPOSALS

CSL 2011
20th Annual Conference of the
European Association for Computer Science Logic
Bergen, Norway
September 12-15, 2011

GENERAL INFORMATION

Computer Science Logic (CSL) is the annual conference of the
European Association for Computer Science Logic (EACSL).
The conference is intended for computer scientists whose
research activities involve logic, as well as for logicians
working on issues significant for computer science.
The Ackermann Award for 2011 will be presented to the
recipients at CSL 2011.


SCOPE

Topics of interest include (but are not limited to):
- automated deduction and interactive theorem proving
- constructive mathematics and type theory
- equational logic and term rewriting
- automata and games, game semantics
- modal and temporal logic
- model checking
- decision procedures
- logical aspects of computational complexity
- finite model theory
- computational proof theory
- logic programming and constraints
- lambda calculus and combinatory logic
- domain theory,
- categorical logic and topological semantics
- database theory
- specification, extraction and transformation of programs
- logical foundations of programming paradigms
- logical aspects of quantum computing
- verification and program analysis
- linear logic
- higher-order logic
- nonmonotonic reasoning

PROCEEDINGS

The proceedings will be published in the series LIPIcs,
Leibniz International Proceedings in Informatics.
Each paper accepted by the Program Committee (PC) must be
presented at the conference by one of the authors,
and a final copy must be prepared according to LIPIcs guidelines
(http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/).

PAPER SUBMISSION

Authors are invited to submit papers of not more than 15 pages
in LIPIcs style presenting work not previously published.
Papers are to be submitted through EasyChair:
http://www.easychair.org/conferences/?conf=csl2011. Submitted papers
must be in English and provide sufficient detail to allow the PC to
assess the merits of the paper. Full proofs may appear in a technical
appendix which will be read at the reviewers' discretion.
Authors are strongly encouraged to include a well written intro-
duction which is directed at all members of the program committee.
Submission is in two phases with dates as given below.
Papers must not be submitted concurrently to another conference with
refereed proceedings; The PC chair should be informed of closely
related work submitted to a conference or journal by March 19, 2011.
Papers authored or coauthored by members of the PC are not allowed.

WORKSHOPS

Proposals for satellite workshops on more specialized topics are
welcome and can be sent to csl11@eacsl.org

IMPORTANT DATES

Submission of title and abstract: March 27, 2011
Submission of full paper: April 3, 2011
Notification: May 30, 2011
Final paper due: June 17, 2011
Conference: September 12-15, 2011

PROGRAM COMMITTEE

Samson Abramsky (Oxford)
Andrea Asperti (Bologna)
Franz Baader (Dresden)
Matthias Baaz (Vienna)
Johan van Benthem (Amsterdam/Stanford)
Marc Bezem (Bergen, chair)
Patrick Blackburn (Nancy)
Andreas Blass (Michigan)
Jan van den Bussche (Hasselt)
Thierry Coquand (Gothenburg)
Nachum Dershowitz (Tel Aviv)
Valentin Goranko (Copenhagen)
Erich Graedel (Aachen)
Wiebe van der Hoek (Liverpool)
Bart Jacobs (Nijmegen)
Reinhard Kahle (Lisbon)
Stephan Kreutzer (Oxford)
Viktor Kuncak (Lausanne)
Daniel Leivant (Indiana)
Benedikt Loewe (Amsterdam)
Jean-Yves Marion (Nancy)
Eugenio Moggi (Genova)
Albert Rubio (Barcelona)
Anton Setzer (Swansea)
Alex Simpson (Edinburgh)
John Tucker (Swansea)
Pawel Urzyczyn (Warsaw)
Helmut Veith (Vienna)
Andrei Voronkov (Manchester)

ORGANIZING COMMITTEE

Isolde Adler
Marc Bezem
Magne Haveraaen
Michal Walicki
Uwe Wolter

CONFERENCE ADDRESS

CSL 2011, Department of Informatics,
University of Bergen,
P.O.Box 7803, N-5020 Bergen, Norway
http://www.eacsl.org/csl11

-----------------------------------------------------------------


--
Caml-list mailing list. Subscription management and archives:
https://sympa-roc.inria.fr/wws/info/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs

2010-12-24

[Caml-list] Call for Papers CP 2011 Seventeenth International Conference on Principles and Practice of Constraint Programming

Call for Papers

CP 2011
Seventeenth International Conference on
Principles and Practice of Constraint Programming

September 12-16, 2011
Perugia, Italy

http://www.dmi.unipg.it/cp2011/

The CP conference is the annual international conference on constraint
programming. It is concerned with all aspects of computing with
constraints, including theory, algorithms, environments, languages, models,
systems, and applications such as decision making, resource allocation, and
agreement technologies.

CP 2011 includes a technical program, where presentations of research and
application papers as well as invited talks aim at describing the best
results and techniques in the state-of-the-art of constraint programming.
One day of Workshops precedes the conference. Tutorials and the Doctoral
Program will form part of the main conference.

Papers are solicited from all disciplines concerned with constraints.
Reports on successful applications of constraint technology are
particularly encouraged and are subject to special Applications track
acceptance criteria. The conference proceedings will be published by
Springer Verlag in the Lecture Notes in Computer Science series. Full
paper submissions are limited to 15 LNCS pages, while Short paper
submissions are limited to 8 pages. Short papers will be reviewed to the
same standards of quality as full papers, but will naturally contain less
quantity of new materials. Short papers will have the same status as long
papers and be eligible for the best paper prize.

Further information is provided on the conference webpage.

IMPORTANT DATES

Deadline for Submissions: April 22, 2011
Provisional Reviews to authors: May 25, 2011
Authors feedback due: May 27, 2011
Notification of Acceptance: June 3, 2011
Camera Ready due: June 15, 2011

ORGANIZATION

Conference Chair
Stefano Bistarelli
University of Perugia, Italy

Program Chair
Jimmy H.M. Lee
The Chinese University of Hong Kong

Doctoral Program Chairs
Christopher Jefferson
University of St. Andrews, Scotland, UK

Guido Tack
K.U. Leuven, Belgium

Workshop/Tutorial Chair
Christian Schulte
Royal Institute of Technology, Stockholm, Sweden

Sponsorship Chair
Ian Miguel
University of St. Andrews, Scotland, UK


Program Committee

Fahiem Bacchus (Canada)
Peter van Beek (Canada)
Nicolas Beldiceanu (France)
Frederic Benhamou (France)
Christian Bessiere (France)
Stefano Bistarelli (Italy)
Lucas Bordeaux (UK)
Hubie Chen (Spain)
David Cohen (UK)
Martin Cooper (France)
Pierre Flener (Sweden)
Alan Frisch (UK)
Simon de Givry (France)
Carla Gomes (USA)
Emmanuel Hebrard (Ireland)
Christopher Jefferson (UK)
George Katsirelos (France)
Zeynep Kiziltan (Italy)
Arnaud Lallouet (France)
Javier Larrosa (Spain)
Yat-Chiu Law (Hong Kong)
Jimmy Lee (Hong Kong)
Joao Marques-Silva (Ireland)
Pedro Meseguer (Spain)
Laurent Michel (USA)
Ian Miguel (UK)
Michela Milano (Italy)
Peter Nightingale (UK)
Barry O'Sullivan (Ireland)
Gilles Pesant (Canada)
Karen Petrie (UK)
Claude-Guy Quimper (Canada)
Emma Rollon (Spain)
Francesca Rossi (Italy)
Ashish Sabharwal (USA)
Thomas Schiex (France)
Christian Schulte (Sweden)
Meinolf Sellmann (USA)
Helmut Simonis (Ireland)
Kostas Stergiou (Greece)
Peter Stuckey (Australia)
Guido Tack (Belgium)
Michael Trick (USA)
Pascal Van Hentenryck (USA)
Mark Wallace (Australia)
Toby Walsh (Australia)
Roland Yap (Singapore)
Standa Zivny (UK)


Applications Track Committee

Chair: Helmut Simonis (Ireland)
Laurent Michel (USA)
Barry O'Sullivan (Ireland)
Paul Shaw (USA)
Mark Wallace (Australia)


--
Caml-list mailing list. Subscription management and archives:
https://sympa-roc.inria.fr/wws/info/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs