SCSS 2013 - 5th International Symposium on Symbolic Computation in Software Science

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 theorem proving, automated reasoning, software verification, model checking, rewriting, formalization of mathematics, network security, Groebner bases, characteristic sets, telescoping for recurrence relations, etc.
The purpose of the International Symposium on Symbolic Computation in Software Science - SCSS is to promote research on theoretical and practical aspects of symbolic computation in software sciences. The symposium provides a forum for active dialog between researchers from several fields of computer algebra, algebraic geometry, algorithmic combinatorics, computational logic, and software analysis and verification.
This year's SCSS edition is the fifth in the SCSS workshop series. It will be organized in the Castle of Hagenberg, Austria, at the Research Institute for Symbolic Computation (RISC) of the Johannes Kepler University Linz. The symposium is partially supported by the strategical program Innovative Upper Austria 2010 Plus.
In the previous years, RISC hosted SCSS 2008 and 2010, and SCSS 2009 and 2012 took place in Gammarth, Tunisia. These events grew out of internal workshops that brought together researchers from the Theorema Group at RISC (Research Institute for Symbolic Computation, Johannes Kepler University, Linz - Hagenberg, Austria), SCORE (Symbolic Computation Research Group, University of Tsukuba, Japan), SSFG (Software Science Foundation Group, Kyoto University, Japan), the Digital Security Research Unit at the Higher School of Communication of Tunis, Sup'Com (University of Carthage, Tunisia), and the Tunisian Society for Digital Security.
SCSS 2013 solicits papers on all aspects of symbolic computations and their applications in software sciences. The topics of the symposium include, but are not limited to the following:
automated reasoning
algorithm (program) synthesis and/or verification
formal methods for the analysis of network security
termination analysis and complexity analysis of algorithms (programs)
extraction of specifications from algorithms (programs)
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