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

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

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


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


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

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

Статистика

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

Система компьютерной алгебры GAP - JSC special issue:Symbolic Computation in Software Science


                 JOURNAL OF SYMBOLIC COMPUTATION
    Special Issue on Symbolic Computation in Software Science
    
   http://www.risc.uni-linz.ac.at/people/tkutsia/jsc-scss.html

SCOPE
-----
This special issue is related to the topics of the workshop SCSS'08
(http://www.risc.uni-linz.ac.at/conferences/scss2008/): Symbolic
Computation in Software Science, which took place in Hagenberg,
Austria, on July 12-13, 2008. Both participants of the workshop and
other authors are invited to submit contributions.

Symbolic Computation is the science of computing with symbolic objects
(terms, formulae, programs, representations of algebraic objects etc.).
Powerful symbolic algorithms have been developed during the past decades
like resolution, model checking, proving methods for various inductive
domains, rewriting techniques, cylindric algebraic decomposition,
Groebner bases, characteristic sets, telescoping for recurrence
relations, etc. In this special issue, we concentrate on the application
of symbolic algorithms to software science. Topics include but are not
limited to the application of symbolic techniques to:

   * algorithm (program) synthesis
   * algorithm (program) verification
   * termination analysis of algorithms (programs)
   * complexity analysis of algorithms (programs)
   * extraction of specifications from algorithms (programs)
   * generation of inductive assertions for algorithms (programs)
   * algorithm (program) transformations
   * component-based programming
   * querying (e.g. XML)
   * semantic web
   * ...

SUBMISSION
----------
We expect original articles (typically 15-30 pages; submission of larger
papers will be evaluated depending on editorial constraints) that
present high-quality contributions that have not been previously
published and that must not be simultaneously submitted for publication
elsewhere.

Submissions must comply with JSC's author guidelines. They must be
written in English and should be prepared in LaTeX using the "Elsevier
Article Class (elsart.cls)" with "JSC add-on style (yjsco.sty)" and
"Harvard style references (elsart-harv.bst)". The package  "JSC LaTex"
(that contains all the necessary style files and a template) can be
obtained from http://www4.ncsu.edu/~hong/jsc/JSC_LaTex_2007_Mar_12.zip.

The introduction of the paper MUST explicitly address the following
questions in succinct and informal manner:

   * What is the problem?
   * Why is the problem important?
   * What has been done so far on the problem?
   * What is the main contribution of the paper on the problem?
   * Is the contribution original? Explain why.
   * Is the contribution non-trivial? Explain why.

All the main definitions, theorems and algorithms must be illustrated by
simple but meaningful examples.

Without these, the paper will not be considered.

Submissions to this special issue are hereby encouraged via the
EasyChair submission system:
      http://www.easychair.org/conferences/?conf=jscscss2009.


IMPORTANT DATES
---------------
   * Submission of papers: March 23, 2009.
   * Notification of acceptance/rejection: July 27, 2009.
   * Final version: September 14, 2009.


GUEST EDITOR
------------
   * Temur Kutsia (RISC, Johannes Kepler University Linz, Austria)
В избранное