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.
Type de document :
Communication dans un congrès
Proc. CICM 2016, Jul 2016, Bialystok, Poland. pp.28 - 43, 2016, 〈10.1007/978-3-319-42547-4〉
Liste complète des métadonnées

Littérature citée [56 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01648696
Contributeur : Thomas Sturm <>
Soumis le : mercredi 29 novembre 2017 - 19:49:37
Dernière modification le : jeudi 20 septembre 2018 - 07:54:02

Identifiants

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, 2016, 〈10.1007/978-3-319-42547-4〉. 〈hal-01648696〉

Partager

Métriques

Consultations de la notice

190