SCSS 2013: BibTeX Entries

Volume

@proceedings{SCSS2013,
  title     = {SCSS 2013. 5th International Symposium on Symbolic Computation in Software Science},
  editor    = {Laura Kovacs and Temur Kutsia},
  series    = {EPiC Series in Computing},
  volume    = {15},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  year      = {2013}}

Papers

@inproceedings{SCSS2013:Mathematics_21st_Century_Personal,
  author    = {Bruno Buchberger},
  title     = {Mathematics of 21st Century: A Personal View},
  booktitle = {SCSS 2013. 5th International Symposium on Symbolic Computation in Software Science},
  editor    = {Laura Kovacs and Temur Kutsia},
  series    = {EPiC Series in Computing},
  volume    = {15},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/vCc},
  doi       = {10.29007/19ls},
  pages     = {1},
  year      = {2013}}


@inproceedings{SCSS2013:Semantic_Framework_Program_Debugging,
  author    = {Wei Li},
  title     = {A Semantic Framework for Program Debugging},
  booktitle = {SCSS 2013. 5th International Symposium on Symbolic Computation in Software Science},
  editor    = {Laura Kovacs and Temur Kutsia},
  series    = {EPiC Series in Computing},
  volume    = {15},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/qgz},
  doi       = {10.29007/q2h6},
  pages     = {2},
  year      = {2013}}


@inproceedings{SCSS2013:Decision_Problems_Linear_Recurrence,
  author    = {Joel Ouaknine},
  title     = {Decision Problems for Linear Recurrence Sequences},
  booktitle = {SCSS 2013. 5th International Symposium on Symbolic Computation in Software Science},
  editor    = {Laura Kovacs and Temur Kutsia},
  series    = {EPiC Series in Computing},
  volume    = {15},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/z},
  doi       = {10.29007/tpxx},
  pages     = {3},
  year      = {2013}}


@inproceedings{SCSS2013:Parametric_Exploration_Rewriting_Logic,
  author    = {María Alpuente and Demis Ballis and Francisco Frechina and Julia Sapiña},
  title     = {Parametric Exploration of Rewriting Logic Computations},
  booktitle = {SCSS 2013. 5th International Symposium on Symbolic Computation in Software Science},
  editor    = {Laura Kovacs and Temur Kutsia},
  series    = {EPiC Series in Computing},
  volume    = {15},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/bF8j},
  doi       = {10.29007/zm5g},
  pages     = {4-18},
  year      = {2013}}


@inproceedings{SCSS2013:Automatic_Inference_Term_Equivalence,
  author    = {Marco Comini and Luca Torella},
  title     = {Automatic Inference of Term Equivalence in Term Rewriting Systems},
  booktitle = {SCSS 2013. 5th International Symposium on Symbolic Computation in Software Science},
  editor    = {Laura Kovacs and Temur Kutsia},
  series    = {EPiC Series in Computing},
  volume    = {15},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/5LqG},
  doi       = {10.29007/qsmm},
  pages     = {19-30},
  year      = {2013}}


@inproceedings{SCSS2013:Condensed_Goal_Independent_Fixpoint,
  author    = {Marco Comini and Luca Torella},
  title     = {A Condensed Goal-Independent Fixpoint Semantics Modeling the Small-Step Behavior of Rewriting},
  booktitle = {SCSS 2013. 5th International Symposium on Symbolic Computation in Software Science},
  editor    = {Laura Kovacs and Temur Kutsia},
  series    = {EPiC Series in Computing},
  volume    = {15},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/Pzf},
  doi       = {10.29007/cpt8},
  pages     = {31-49},
  year      = {2013}}


@inproceedings{SCSS2013:Logical_Algebraic_Views_Knot,
  author    = {Fadoua Ghourabi and Tetsuo Ida and Kazuko Takahashi},
  title     = {Logical and Algebraic Views of a Knot Fold of a Regular Heptagon},
  booktitle = {SCSS 2013. 5th International Symposium on Symbolic Computation in Software Science},
  editor    = {Laura Kovacs and Temur Kutsia},
  series    = {EPiC Series in Computing},
  volume    = {15},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/37D3},
  doi       = {10.29007/v8hh},
  pages     = {50-63},
  year      = {2013}}


@inproceedings{SCSS2013:Automated_Verification_Equivalence_Quantum,
  author    = {Takahiro Kubota and Yoshihiko Kakutani and Go Kato and Yasuhito Kawano and Hideki Sakurada},
  title     = {Automated Verification of Equivalence on Quantum Cryptographic Protocols},
  booktitle = {SCSS 2013. 5th International Symposium on Symbolic Computation in Software Science},
  editor    = {Laura Kovacs and Temur Kutsia},
  series    = {EPiC Series in Computing},
  volume    = {15},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/ztz},
  doi       = {10.29007/95pj},
  pages     = {64-69},
  year      = {2013}}


@inproceedings{SCSS2013:modified_parallel_F4_algorithm,
  author    = {Severin Neumann},
  title     = {A modified parallel F4 algorithm for shared and distributed memory architectures},
  booktitle = {SCSS 2013. 5th International Symposium on Symbolic Computation in Software Science},
  editor    = {Laura Kovacs and Temur Kutsia},
  series    = {EPiC Series in Computing},
  volume    = {15},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/wS5z},
  doi       = {10.29007/98fh},
  pages     = {70-80},
  year      = {2013}}


@inproceedings{SCSS2013:Generating_Asymptotically_Non_terminant,
  author    = {Rachid Rebiha and Nadir Matringe and Arnaldo Vieira Moura},
  title     = {Generating Asymptotically Non-terminant Initial Variable Values for Linear Diagonalizable Programs.},
  booktitle = {SCSS 2013. 5th International Symposium on Symbolic Computation in Software Science},
  editor    = {Laura Kovacs and Temur Kutsia},
  series    = {EPiC Series in Computing},
  volume    = {15},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/Sn18},
  doi       = {10.29007/dq11},
  pages     = {81-92},
  year      = {2013}}


@inproceedings{SCSS2013:Data_Conversion_Method_between,
  author    = {Kazuko Takahashi and Shizuo Yoshimaru and Mizuki Goto},
  title     = {Data Conversion Method between a Natural Number and a Binary Tree for an Inductive Proof and Its Application},
  booktitle = {SCSS 2013. 5th International Symposium on Symbolic Computation in Software Science},
  editor    = {Laura Kovacs and Temur Kutsia},
  series    = {EPiC Series in Computing},
  volume    = {15},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/zfm},
  doi       = {10.29007/w5xk},
  pages     = {93-107},
  year      = {2013}}


@inproceedings{SCSS2013:Computer_algebra_investigation_known,
  author    = {Matan Ziv-Av and Mikhail Klin},
  title     = {Computer algebra investigation of known primitive triangle-free strongly regular graphs},
  booktitle = {SCSS 2013. 5th International Symposium on Symbolic Computation in Software Science},
  editor    = {Laura Kovacs and Temur Kutsia},
  series    = {EPiC Series in Computing},
  volume    = {15},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/BbN2},
  doi       = {10.29007/bdgp},
  pages     = {108-123},
  year      = {2013}}


@inproceedings{SCSS2013:Usage_Invariants_Symbolic_Verification,
  author    = {Alexander Letichevsky and Alexander Godlevsky and Anton Guba and Alexander Kolchin and Oleksandr Letychevskyi and Vladimir Peschanenko},
  title     = {Usage of Invariants for Symbolic Verification of Requirements},
  booktitle = {SCSS 2013. 5th International Symposium on Symbolic Computation in Software Science},
  editor    = {Laura Kovacs and Temur Kutsia},
  series    = {EPiC Series in Computing},
  volume    = {15},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/rS},
  doi       = {10.29007/2nr2},
  pages     = {124},
  year      = {2013}}


@inproceedings{SCSS2013:Lebesgue_Constants_Optimal_Node,
  author    = {Robert Vajda},
  title     = {Lebesgue Constants and Optimal Node Systems via Symbolic Computations},
  booktitle = {SCSS 2013. 5th International Symposium on Symbolic Computation in Software Science},
  editor    = {Laura Kovacs and Temur Kutsia},
  series    = {EPiC Series in Computing},
  volume    = {15},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/WtHl},
  doi       = {10.29007/89cm},
  pages     = {125},
  year      = {2013}}