Published: 30th July 2013
|Preface Adel Bouhoula, Tetsuo Ida and Fairouz Kamareddine
|Formal Probabilistic Analysis of a Wireless Sensor Network for Forest Fire Detection Maissa Elleuch, Osman Hasan, Sofiène Tahar and Mohamed Abid
|A New PVSS Scheme with a Simple Encryption Function Assia Ben Shil, Kaouther Blibech, Riadh Robbana and Wafa Neji
|On the Verification of a WiMax Design Using Symbolic Simulation Salim Ismail Al-Akhras, Sofiène Tahar, Gabriela Nicolescu, Michel Langevin and Pierre Paulin
|Compiling symbolic attacks to protocol implementation tests Hatem Ghabri, Ghazi Maatoug and Michael Rusinowitch
|Formal verification of a proof procedure for the description logic ALC Mohamed Chaabani, Mohamed Mezghiche and Martin Strecker
|Towards a General Framework for Formal Reasoning about Java Bytecode Transformation Razika Lounas, Mohamed Mezghiche and Jean-Louis Lanet
|Formal Analysis of Soft Errors using Theorem Proving Naeem Abbasi, Osman Hasan and Sofiène Tahar
|Delegation Management Modeling in a Security Policy based Environment Ryma Abassi and Sihem Guemara El Fatmi
|Performing Implicit Induction Reasoning with Certifying Proof Environments Amira Henaien and Sorin Stratulat
The Workshop grew out of internal workshops that brought together researchers from SCORE (Symbolic Computation Research Group) at the University of Tsukuba, Japan, the Theorema Group at Research Institute for Symbolic Computation, Johannes Kepler University Linz, Austria, the SSFG (Software Science Foundation Group) at Kyoto University, Japan, and the Digital Security Research Unit at the University of Carthage, Tunisia.
The organizational and financial supports were offered by the Tunisian Society for Digital Security, the Research Unit of Digital Security, the Higher School of Communication of Tunis (Sup'Com), the University of Carthage, SCORE, the University of Tsukuba and Heriot-Watt University, Edinburgh, UK.
Symbolic computation allows computations with a computer by manipulating mathematical expressions such as formulas, equations, polynomials and so on. SCSS is open for the international community and it solicited paper submissions in symbolic computation and software science.
The topics of the workshop included techniques and algorithms of symbolic computation, mainly, theorem proving methods and techniques, algorithm verification, formal methods for the analysis of network security, computational origami and others.
In response to the call for papers focussing on algorithms and techniques of symbolic computations and their applications, we received 16 submissions of abstracts and papers. Each submission was reviewedby three members of the Program Committe for the relevance to the workshop and the quality of the presentation by the programme committee. The committee decided to accept 9 papers. The programme also includes two invited talks.
We would like to express our thanks to the invited speakers Prof. Kazuhiro Yokoyama from Rikkyo University (Japan) and Dr. Mohamed Hamdi from the University of Carthage (Tunisia).
This proceedings is compiled by EPTCS. We would like to thank Rob van Glabbeek, the Editor-in-Chief of EPTCS for the production of the proceedings.
Adel Bouhoula, Tetsuo Ida and Fairouz Kamareddine