[loginf] CfP: JSC Special Issue on Symbolic Computation in Software Science

Temur Kutsia kutsia at risc.uni-linz.ac.at
Thu Dec 10 20:16:38 CET 2009

[Apologies for multiple copies]

     Special Issue on Symbolic Computation in Software Science

This special issue is related to the topics of the Tunisia-Japan workshop
on Symbolic Computation in Software Science (SCSS'09), which took place in Gammath,
Tunisia, on September 22-24, 2009
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:

    * 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.

We expect original articles (typically 20-25 pages) that
present high-quality contributions that have not been previously
published and that must not be simultaneously submitted for publication

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.

We also encourage tutorials/surveys. They will be reviewed for

   - Quality of Presentation
   - Fair/complete crediting of the people
     who worked on the subject.

It must contain:

   - List of the main problems/questions
   - Motivation/importance
   - Description of main ideas/algorithms/improvements so far
   - List of important open problems
   - Complete bib

The target audience should be "non-expert" on the subject.
(starting PhD students or experts on other subjects).

The problems, ideas, algorithms, etc should be illustrated by
well-chosen examples.

If you plan to submit a tutorial or a survey, make sure that the title
contains a phrase, such as "tutorial on ......."  or "survey of .....", etc.

Submissions to this special issue are hereby encouraged via the
EasyChair submission system:

    * Submission of papers: April 11, 2010.
    * Notification of acceptance/rejection: August 2, 2010.
    * Final version: September 30, 2010.

    * Adel BOUHOULA (Sup'Com, University of November 7th at Carthage).
    * Tetsuo IDA (University of Tsukuba).

More information about the loginf mailing list