Satisfiability Checking and Symbolic Computation

Thomas Sturm (1, 2, 3) , Erika Abraham (4) , John A. Abbott (5) , Bern W. Becker (6) , Anna Maria Bigatti (7) , Martin Brain (8) , Bruno Buchberger (9) , Alessandro Cimatti (10) , James Davenport (11) , Matthew England (12) , Pascal Fontaine (2) , Stephen Forrest (13) , Alberto Griggio (10) , Daniel Kroening (8) , Werner M. Seiler (5)

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

Symbolic Computation and Satisfiability Checking are viewed as individual research areas, but they share common interests in the development, implementation and application of decision procedures for arithmetic theories. Despite these commonalities, the two communities are currently only weakly connected. We introduce a new project SC 2 to build a joint community in this area, supported by a newly accepted EU (H2020-FETOPEN-CSA) project of the same name. We aim to strengthen the connection between these communities by creating common platforms, initiating interaction and exchange, identifying common challenges, and developing a common roadmap. This abstract and accompanying poster describes the motivation and aims for the project, and reports on the first activities.

Domaines: Informatique [cs]

Thomas Sturm, Erika Abraham, John A. Abbott, Bern W. Becker, Anna Maria Bigatti, et al.. Satisfiability Checking and Symbolic Computation. ACM Communications in Computer Algebra, 2016, 50 (4), pp.145-147. ⟨10.1145/3055282.3055285⟩. ⟨hal-01648695⟩