Volume •Abstracts •Preface •Authors •Keywords •BibTex Entries

SCSS 2016: Volume Information

SCSS 2016. 7th International Symposium on Symbolic Computation in Software Science

Editors: James H. Davenport and Fadoua Ghourabi

EPiC Series in Computing•Volume 39

14 articles•182 pages•Published: March 27, 2016

Papers

Automatic Staging via Partial Evaluation Techniques

Kenichi Asai and Yukiyoshi Kameyama

1-13

From Tarski to Descartes: Formalization of the Arithmetization of Euclidean Geometry

Pierre Boutry, Gabriel Braun and Julien Narboux

14-28

Space Analysis of a Predicate Logic Fragment for the Specification of Stream Monitors

David Cerna, Wolfgang Schreiner and Temur Kutsia

29-41

Implementing a stepper using delimited continuations

Youyou Cong and Kenichi Asai

42-54

Expression Compatibility Problem

Seyed Hossein Haeri and Sibylle Schupp

55-67

A Mathematica module for Conformal Geometric Algebra and Origami Folding

Mitsuhiro Kondo, Takuya Matsuo, Yoshihiro Mizoguchi and Hiroyuki Ochiai

68-80

A Data Structure to Handle Large Sets of Equal Terms

Baudouin Le Charlier and Mêton Mêton Atindehou

81-94

A rewrite-based computational model for functional logic programming

Mircea Marin, Temur Kutsia and Besik Dundua

95-106

Verification of a brick Wang tiling algorithm

Toshiaki Matsushima, Yoshihiro Mizoguchi and Alexandre Derouet-Jourdan

107-116

Towards Verified Construction for Planar Class of a Qualitative Spatial Representation

Sosuke Moriguchi, Mizuki Goto and Kazuko Takahashi

117-129

Determining automatically compass and straightedge unconstructibility in triangles

Pascal Mathis and Pascal Schreck

130-142

Compass-free Navigation of Mazes

Phil Scott and Jacques Fleuriot

143-155

Critical Pair Analysis in Nominal Rewriting

Takaki Suzuki, Kentaro Kikuchi, Takahito Aoto and Yoshihito Toyama

156-168

Bit-size reduction of triangular sets in two and three variables

Tetsuro Yamashita and Xavier Dahan

169-182

Keyphrases

alpha-equivalence, arithmetization, automated reasoning, binding-time analysis, bit-size, Compass and straightedge construction, completeness, component-based software engineering, computational origami, confluence, Conformal Geometric Algebra, congruence closure, Coq³, critical pairs, cross-stage persistence, data structure, decision procedure, delimited continuations, Expression Compatibility Problem, expression problem, expression simplification, formal semantics, formalization, formalized mathematics, functional logic programming, geometry², interactive theorem proving, Lagrange interpolation, lexicographic Groebner bases, Lightweight Family Polymorphism, Mathematica, multiplicity, narrowing, network monitors, Nominal rewriting, partial evaluation, planarity, PLCA, predicate logic, program verification, proof assistant, qualitative spatial reasoning, shift and reset, soundness, space complexity, staging, stepper, strategies, symbolic computation, Tarski's system of geometry, term equivalence, theory of equality, Triangular Sets, Wang tiling.