Vol-1804
urn:nbn:de:0074-1804-0

Copyright © 2016 for the individual papers by the papers' authors. Copying permitted for private and academic purposes. This volume is published and copyrighted by its editors.

SC-Square 2016
Satisfiability Checking and Symbolic Computation

Proceedings of the 1st Workshop on Satisfiability Checking and Symbolic Computation
co-located with 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2016)

Timisoara, Romania, September 24, 2016.

Edited by

Erika Ábrahám, RWTH Aachen University, Germany
James H. Davenport, University of Bath, United Kingdom
Pascal Fontaine, Loria, INRIA, University of Lorraine, France

Table of Contents

Preface

CoCoA and CoCoALib: Fast Prototyping and Flexible C++ Library for Computations in Commutative Algebra 1-3
John Abbott, Anna Maria Bigatti
Satisfaction Meets Practice and Confidence 4-7
Tom Bienmüller, Tino Teige
Algebraic Techniques in Software Verification : Challenges and Opportunities 8-12
Martin Brain, Daniel Kroening, Ryan McCleeary
MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures 13-19
Curtis Bright, Vijay Ganesh, Albert Heinle, Ilias Kotsireas, Saeed Nejati, Krzysztof Czarnecki
What Does ``Without Loss of Generality'' Mean (And How Do We Detect It) 20-23
James H. Davenport
Experience with Heuristics, Benchmarks & Standards for Cylindrical Algebraic Decomposition 24-31
Matthew England, James H. Davenport
Accurate Dead Code Detection in Embedded C Code by Arithmetic Constraint Solving 32-38
Felix Neubauer, Karsten Scheibler, Bernd Becker, Ahmed Mahdi, Martin Fränzle, Tino Teige, Tom Bienmüller, Detlef Fehrer

2017-03-02: submitted by Pascal Fontaine, metadata incl. bibliographic data published under Creative Commons CC0
2017-03-02: published on CEUR-WS.org |valid HTML5|