SCSS 2013. 5th International Symposium on Symbolic Computation in Software Science14 articles•125 pages•Published: June 19, 2013 PapersPage 1 | Page 2 | Page 3 | Pages 4-18 | Pages 19-30 | Pages 31-49 | Pages 50-63 | Pages 64-69 | Pages 70-80 | Pages 81-92 | Pages 93-107 | Pages 108-123 | Page 124 | Page 125 |
Keyphrasesalgebraic number, automated verification, BB84, bottom-up semantics, computational model, computational origami, computer algebra, Debugging, Distributed memory architecture, elecronic cash protocol, equitable partitions, F4 algorithm, formal methods, Geometrical constraint solving, Groebner basis, Gröbner basis, induction scheme, invariants, knot fold, Lebesgue constant, linear algebra, Maude, MPI, polynomial interpolation, process calculi, program animation, property-oriented specifications, quantifier elimination, quantum cryptography, Requirements Specification, resultant, rewriting logic, semantics-based inference methods, Slicing, static analysis, stepping, strongly regular graphs, symbolic verification, term rewriting, Term Rewriting Systems2, termination analysis, theorem proving, theorem proving methods |
|