Отправляет email-рассылки с помощью сервиса Sendsay

Система компьютерной алгебры GAP

Подписаться Бесплатная «Серебряная» новостная рассылка . Временно не выходит ,возобновит выход - нет информации Подписчиков 783 RSS
←   Апрель 2009   →
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
23.04.2009
00:45:39
01:35:17
24
25
26
27
28
29
30


За последние 60 дней ни разу не выходила


Сайт рассылки: http://www.gap-system.org/ukrgap/
Открыта: 05-02-2002

Автор
Александр Борисович Коновалов

Статистика

783 подписчиков
0 за неделю
←   Все выпуски   →

Система компьютерной алгебры GAP: CfP: SCSS 2009



%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% SCSS 2009 %
% TUNISIA - JAPAN WORKSHOP %
% ON SYMBOLIC COMPUTATION IN SOFTWARE SCIENCE %
% %
% September 22-24, 2009 %
% Gammarth, Tunisia %
% %
% http://www2.score.cs.tsukuba.ac.jp/scssWorkshop/index.html %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

IMPORTANT DATES
===============
Abstract submission: May 29, 2009
Acceptance notification: June 22, 2009
Final versions of full papers: August 30, 2009
Workshop: September 22-24, 2009

SCOPE
=====
Symbolic computation is the science of computing with symbolic
objects (terms, formulae, programs, algebraic objects, geometrical
objects, etc). Powerful symbolic algorithms have been developed
during the past decades like theorem proving techniques, software
verification, model checking, rewriting techniques, network security,
Groebner bases, characteristic sets, etc.

In this workshop, we solicit papers on algorithms and techniques
of symbolic computations and their applications in software science.
The topics of the workshop include:

* theorem proving methods and techniques
* algorithm (program) synthesis
* algorithm (program) verification
* formal methods for the analysis of network security
* termination analysis of algorithms (programs)
* complexity analysis of algorithms (programs)
* extraction of specifications from algorithms (programs)
* generation of inductive assertion for algorithm (programs)
* algorithm (program) transformations
* component-based programming
* computational origami
* query languages (in particular for XML documents)
* semantic web
* etc.

SCSS 2009 workshop is the second in the SCSS workshop series.
SCSS 2008 took place at the Research Institute for Symbolic
Computation (RISC), Hagenberg, Austria. The Workshop grew out of
internal workshops that bring together researchers from SCORE
(Symbolic Computation Research Group, University of Tsukuba, Japan),
the Theorema Group at RISC (Research Institute for Symbolic Computation,
Johannes Kepler University, Linz - Hagenberg, Austria), SSFG
(Software Science Foundation Group, Kyoto University, Japan) and
Sup'Com (University of November 7th at Carthage, Tunisia). SCSS
is open for the international community and welcomes paper submissions.

VENUE
=======
The workshop will be held at Ramada Hotel in Gammarth, Tunisia.
Gammarth is 20km north east of Tunis and 10km north of the
archeological site of Carthage. The legendary Phoenician princess
Dido founded Carthage and the city possessed economic, cultural,
and military power in the Mediterranean during Punic and Roman eras.

INVITED SPEAKERS
================
* Henk Barendregt (Radboud University Nijmegen, Netherlands)
* Dongming Wang (University Pierre et Marie Curie - CNRS, France)
* Stephen Watt (University of West Ontario, Canada)

PROGRAM CO-CHAIRS
=================
* Adel Bouhoula (University of November 7th at Carthage, Tunisia)
* Tetsuo Ida (University of Tsukuba, Japan)

PROGRAM COMMITTEE
=================

* Tudor Jebelean (Johannes Kepler University Linz, Austria)
* Temur Kutsia (Johannes Kepler University Linz, Austria)
* Yasuhiko Minamide (University of Tsukuba, Japan)
* Mohamed Mosbah (University of Bordeaux, France)
* Michael Rusinowitch (INRIA Lorraine, France)
* Masahiko Sato (Kyoto University, Japan)
* Yahya Slimani (University El Manar Tunis, Tunisia)

LOCAL ORGANIZERS
================
* Nizar Ben Neji (University of November 7th at Carthage, Tunisia)
* Fadoua Ghourabi (University of Tsukuba, Japan)
* Sourour Meharouech (University of November 7th at Carthage, Tunisia)

SUBMISSION
===========
Abstracts and papers or extended abstracts should be submitted using
EasyChair: http://www.easychair.org/conferences/?conf=scss2009

Papers or extended abstracts should be prepared in LaTeX, formatted
according to the EasyChair style (style files are available from
http://www.easychair.org/easychair.zip), and should not exceed
16 pages.

PUBLICATION
===========
Accepted papers will be available during the workshop as the proceedings
of SCSS 2009. We plan to have a special issue of the Journal of
Symbolic Computation on SCSS 2009. The final decision for organizing
the special issue will be made after the workshop. The full version
of selected papers will be considered for the publication of the
special issue subjected to the normal peer review process of the
Journal of Symbolic Computation.
В избранное