SCSS 2017 solicits regular papers on all aspects of symbolic computation and their applications in software science. 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 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