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. 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.
This 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) at University of Tsukuba, Japan,
- Theorema Group at Research Institute for Symbolic Computation, Johannes Kepler University Linz, Austria,
- SSFG (Software Science Foundation Group) at Kyoto University, Japan, and
- Sup'Com (Higher School of Communication of Tunis) at University of November 7th at Carthage, Tunisia.
SCSS is open for the international community and welcomes paper submissions.