SC 2 : Satisfiability Checking meets Symbolic Computation (Project Paper)

Eriká H Abrahám (1) , John Abbott (2) , Bernd Becker (3) , Anna M Bigatti (4) , Martin M Brain (5) , Bruno Buchberger (6) , Alessandro Cimatti (7) , James H Davenport (8) , Matthew M England (9) , Pascal Fontaine (10) , Stephen M Forrest (11) , Alberto Griggio (7) , Daniel Kroening (5) , Werner M Seiler (2) , Thomas Sturm (12, 10, 13)

1 RWTH - Rheinisch-Westfälische Technische Hochschule Aachen University
2 University of Kassel
3 Albert-Ludwigs-Universität Freiburg
4 UniGe - Università degli studi di Genova = University of Genoa
5 Computing Laboratory
6 JKU - University of Linz - Johannes Kepler Universität Linz
7 FBK - Fondazione Bruno Kessler [Trento, Italy]
8 University of Bath [Bath]
9 Coventry University
10 VERIDIS - Modeling and Verification of Distributed Algorithms and Systems
11 Maplesoft Europe Ltd
12 MPII - Max-Planck-Institut für Informatik
13 MOSEL - Proof-oriented development of computer-based systems

Symbolic Computation and Satisfiability Checking are two research areas, both having their individual scientific focus but sharing also common interests in the development, implementation and application of decision procedures for arithmetic theories. Despite their commonalities, the two communities are rather weakly connected. The aim of our newly accepted SC 2 project (H2020-FETOPEN-CSA) is to strengthen the connection between these communities by creating common platforms, initiating interaction and exchange, identifying common challenges, and developing a common roadmap from theory along the way to tools and (industrial) applications. In this paper we report on the aims and on the first activities of this project, and formalise some relevant challenges for the unified SC 2 community.

Mots clés: Logical Problems; Symbolic Computation; Computer Algebra Systems; Satisfiability Checking; Satisfiability Modulo Theories

Domaines: Logique en informatique [cs.LO]

Eriká H Abrahám, John Abbott, Bernd Becker, Anna M Bigatti, Martin M Brain, et al.. SC 2 : Satisfiability Checking meets Symbolic Computation (Project Paper). Intelligent Computer Mathematics, Jul 2016, Bialystok, Poland. ⟨hal-01377655⟩