[TYPES/announce] Last CfP: JSC Special Issue on Symbolic Computation in Software Science

[Temur Kutsia]

[Please post - apologies for multiple copies.]

Last Call for Papers

----------------------------------------
Special issue of the

JOURNAL OF SYMBOLIC COMPUTATION

on

SYMBOLIC COMPUTATION IN SOFTWARE SCIENCE
----------------------------------------
http://www.risc.jku.at/~tkutsia/organization/jsc-scss-2016.html


IMPORTANT DATES
---------
Abstract submission: June 27, 2016
Paper submission: July 11, 2016
Notification: October 17, 2016
Publication: 2017


SCOPE
--------
Symbolic Computation is the science of computing with symbolic objects
(terms, formulae, programs, representations of algebraic objects etc.).
Powerful symbolic algorithms and methods have been developed during the
past decades like computer algebra, theorem proving, automated
reasoning, software verification, model checking, rewriting,
formalization of mathematics, Groebner bases, characteristic sets,
telescoping for recurrence relations, cylindric algebraic decomposition
and other quantifier elimination techniques, etc.

The purpose of this special issue is to promote research on theoretical
and practical aspects of symbolic computation in software science. The
special issue is related to the topics of the International Symposium on
Symbolic Computation in Software Science: SCSS 2014 and SCSS 2016. It
will be published by Elsevier within the Journal of Symbolic Computation.

Participants of the SCSS 2014 and SCSS 2016 symposia, as well as other
authors are invited to submit contributions.


EXAMPLES of TOPICS
-------------------
This special issue solicits papers on all aspects of symbolic
computation and their applications in software sciences. The topics
include, but are not limited to the following:

 - automated reasoning
 - algorithm (program) synthesis and/or verification
 - formal methods for the analysis of network and system security
 - termination analysis and complexity analysis of algorithms (programs)
 - extraction of specifications from algorithms (programs)
 - related theorem proving methods and techniques
 - proof carrying code
 - generation of inductive assertion for algorithm (programs)
 - algorithm (program) transformations
 - formalization and computerization of knowledge (maths, medicine,
economy, etc.)
 - component-based programming
 - computational origami
 - query languages (in particular for XML documents)
 - semantic web and cloud computing


SUBMISSION GUIDELINES
---------------------
This special issue welcomes original high-quality contributions that
have been neither published in nor simultaneously submitted to any
journals or refereed conferences. Submissions will be peer-reviewed
using the standard refereeing procedure of the Journal of Symbolic
Computation.

Authors of papers presented at the SCSS 2014 and SCSS 2016 symposia are
welcome and encouraged to submit extended and revised versions of their
papers. Furthermore, submissions of papers that are in the scope of
SCSS, but did not appear in SCSS 2014 and SCSS 2016 are welcome as well.

Submitted papers must be in English and include a well written
introduction explicitly addressing 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?
 - Why is the contribution original? (Clarification: The results,
already appeared in the conference paper, will be still counted as an
original result for JSC refereeing process.)
 - Why is the contribution non-trivial?
 - How is the journal paper different from the conference paper? (For
submissions originated from the papers presented at the symposium.)

The submissions should be complete (since there is no rigid page limit):

 - All the related works and issues must be completely and carefully
discussed.
 - All the previous relevant JSC papers must be properly cited and
discussed.
 - All the theorem must be rigorously proved (no sketch allowed).
 - All the important definitions/theorems/algorithms must be illustrated
by well chosen examples.

Submissions originated from the papers presented at the symposium should
address all the feedback from the symposium's referee process and Q/A.


SUBMISSION
--------------------
Please prepare your submission in LaTeX using the JSC document format
from http://www4.ncsu.edu/~hong/jsc.htm
(link to the submission template:
http://www4.ncsu.edu/~hong/jsc/JSC_LaTex_2007_Mar_12.zip.)

Submission is via the EasyChair submission site at
https://easychair.org/conferences/?conf=jscscss2016.


GUEST EDITORS
--------------------
James H. Davenport (University of Bath, UK)
Temur Kutsia (RISC, Johannes Kepler University Linz, Austria)