Symbolic Computation in Software Science
Austrian-Japanese Workshop, SCSS 2008
RISC, Castle of Hagenberg, Austria
July 12-13, 2008
NEWS: Workshop photos are online. See the News section...
Scope Dates Speakers Committees


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 proving, model checking, provers for various inductive domains, rewriting techniques, cylindric algebraic decomposition, Gröbner bases, characteristic sets, telescoping for recurrence relations, etc.

In this workshop, 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 assertion for algorithm (programs)
  • algorithm (program) transformations
  • component-based programming
  • query languages (in particular for XML documents)
  • semantic web
  • etc.

This Workshop grew out of a couple of internal workshops of the Theorema Group at RISC (Research Institute for Symbolic Computation, Johannes Kepler University, Linz - Hagenberg, Austria) and SCORE (Symbolic Computation Research Group, University of Tsukuba, Japan) and SSFG (Software Science Foundation Group, Kyoto University, Japan). We now open the workshop series for the international community and we welcome paper submissions. Also, for the first time, the SCCH (Software Competence Center Hagenberg) will join in the organization of the workshop.