- Toshiaki Matsushima, Yoshihiro Mizoguchi, Alexandre Derouet-Jourdan:
Verification of a brick Wang tiling algorithm. SCSS 2016: 107-116 - Sosuke Moriguchi, Mizuki Goto, Kazuko Takahashi:
Towards Verified Construction for Planar Class of a Qualitative Spatial Representation. SCSS 2016: 117-129 - Phil Scott, Jacques D. Fleuriot
:
Compass-free Navigation of Mazes. SCSS 2016: 143-155 - Takaki Suzuki, Kentaro Kikuchi, Takahito Aoto, Yoshihito Toyama:
Critical Pair Analysis in Nominal Rewriting. SCSS 2016: 156-168 - Tetsuro Yamashita, Xavier Dahan:
Bit-size reduction of triangular sets in two and three variables. SCSS 2016: 169-182 - James H. Davenport, Fadoua Ghourabi:
7th International Symposium on Symbolic Computation in Software Science, SCSS 2016, Tokyo, Japan, March 28-31, 2016. EPiC Series in Computing 39, EasyChair 2016 [contents] - 2014
- Nikolaj S. Bjørner, Anh-Dung Phan:
νZ - Maximal Satisfaction with Z3. SCSS 2014: 1-9 - William M. Farmer:
Meaning Formulas for Syntax-Based Mathematical Algorithms. SCSS 2014: 10-11 - Daniel Franzen, David Aspinall:
Towards an amortized type system for JavaScript. SCSS 2014: 12-26 - Cezary Kaliszyk, Lionel Mamane, Josef Urban:
Machine Learning of Coq Proof Guidance: First Experiments. SCSS 2014: 27-34 - Karsten Martiny, Ralf Möller:
PDT Logic for Stream Reasoning in Multi-agent Systems. SCSS 2014: 35-46 - Marisa Navarro, Fernando Orejas:
A refutation procedure for proving satisfiability of constraint specifications on XML documents. SCSS 2014: 47-61 - Helmut Seidl, Thomas Martin Gawlitza, Martin D. Schwarz:
Parametric Strategy Iteration. SCSS 2014: 62-76 - Temur Kutsia, Andrei Voronkov:
6th International Symposium on Symbolic Computation in Software Science, SCSS 2014, Gammarth, La Marsa, Tunisia, December 7-8, 2014. EPiC Series in Computing 30, EasyChair 2014 [contents] - 2013
- Wei Li:
A Semantic Framework for Program Debugging. SCSS 2013: 2 - María Alpuente, Demis Ballis, Francisco Frechina, Julia Sapiña:
Parametric Exploration of Rewriting Logic Computations. SCSS 2013: 4-18 - Bruno Buchberger:
Mathematics of 21st Century: A Personal View. SCSS 2013: 1 - Marco Comini, Luca Torella:
Automatic Inference of Term Equivalence in Term Rewriting Systems. SCSS 2013: 19-30 - Marco Comini, Luca Torella:
A Condensed Goal-Independent Fixpoint Semantics Modeling the Small-Step Behavior of Rewriting. SCSS 2013: 31-49 - Fadoua Ghourabi, Tetsuo Ida, Kazuko Takahashi:
Logical and Algebraic Views of a Knot Fold of a Regular Heptagon. SCSS 2013: 50-63 - Takahiro Kubota, Yoshihiko Kakutani, Go Kato, Yasuhito Kawano, Hideki Sakurada:
Automated Verification of Equivalence on Quantum Cryptographic Protocols. SCSS 2013: 64-69 - Alexander A. Letichevsky, Alexander Godlevsky, Anton Guba, Alexander Kolchin, Olexander A. Letychevskyi, Vladimir S. Peschanenko:
Usage of Invariants for Symbolic Verification of Requirements. SCSS 2013: 124 - Severin Neumann:
A modified parallel F4 algorithm for shared and distributed memory architectures. SCSS 2013: 70-80 - Joël Ouaknine:
Decision Problems for Linear Recurrence Sequences. SCSS 2013: 3 - Rachid Rebiha, Nadir Matringe, Arnaldo Vieira Moura:
Generating Asymptotically Non-terminant Initial Variable Values for Linear Diagonalizable Programs. SCSS 2013: 81-92 - Kazuko Takahashi, Shizuo Yoshimaru, Mizuki Goto:
Data Conversion Method between a Natural Number and a Binary Tree for an Inductive Proof and Its Application. SCSS 2013: 93-107 - Róbert Vajda:
Lebesgue Constants and Optimal Node Systems via Symbolic Computations. SCSS 2013: 125 - Matan Ziv-Av, Mikhail H. Klin:
Computer algebra investigation of known primitive triangle-free strongly regular graphs. SCSS 2013: 108-123 - Laura Kovács, Temur Kutsia:
5th International Symposium on Symbolic Computation in Software Science, SCSS 2013, Castle of Hagenberg, Austria. EPiC Series in Computing 15, EasyChair 2013 [contents]
