SC2: Satisfiability Checking Meets Symbolic Computation (Project Paper)

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [56 references]  Display  Hide  Download

https://hal.inria.fr/hal-01648696
Contributor : Thomas Sturm <>
Submitted on : Wednesday, November 29, 2017 - 7:49:37 PM
Last modification on : Wednesday, July 3, 2019 - 10:34:21 AM

Identifiers

Collections

Citation

Thomas Sturm, Erika Ábrahám, John Abbott, Bernd Becker, Anna Bigatti, et al.. SC2: Satisfiability Checking Meets Symbolic Computation (Project Paper). Proc. CICM 2016, Jul 2016, Bialystok, Poland. pp.28 - 43, ⟨10.1007/978-3-319-42547-4⟩. ⟨hal-01648696⟩

Share

Metrics

Record views

205