Katalog Plus
Bibliothek der Frankfurt UAS
Bald neuer Katalog: sichern Sie sich schon vorab Ihre persönlichen Merklisten im Nutzerkonto: Anleitung.
Dieses Ergebnis aus BASE kann Gästen nicht angezeigt werden.  Login für vollen Zugriff.

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

Title: SC 2 : Satisfiability Checking meets Symbolic Computation (Project Paper)
Authors: Abrahám, Eriká, H; Abbott, John; Becker, Bernd; Bigatti, Anna, M; Brain, Martin, M; Buchberger, Bruno; Cimatti, Alessandro; Davenport, James, H; England, Matthew, M; Fontaine, Pascal; Forrest, Stephen, M; Griggio, Alberto; Kroening, Daniel; Seiler, Werner, M; Sturm, Thomas
Contributors: RWTH Aachen University = Rheinisch-Westfälische Technische Hochschule Aachen (RWTH Aachen); University of Kassel; Albert-Ludwigs-Universität Freiburg = University of Freiburg; Università degli studi di Genova = University of Genoa = Université de Gênes (UniGe); Computing Laboratory; University of Oxford; University of Linz - Johannes Kepler Universität Linz (JKU); Fondazione Bruno Kessler Trento, Italy (FBK); University of Bath Bath; Coventry University; Modeling and Verification of Distributed Algorithms and Systems (VERIDIS); Max-Planck-Institut für Informatik (MPII); Max-Planck-Gesellschaft-Max-Planck-Gesellschaft-Centre Inria de l'Université de Lorraine; Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Formal Methods (LORIA - FM); Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA); Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA); Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-CentraleSupélec-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS); Maplesoft Europe Ltd; Max-Planck-Gesellschaft; Proof-oriented development of computer-based systems (MOSEL); Department of Formal Methods (LORIA - FM); Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS); ANR-13-IS02-0001,SMArT,Satisfaisabilité Modulo Arithmétique et Théories(2013); European Project: 712689,H2020-FETOPEN-2014-2015,H2020-FETOPEN-2015-CSA,SC-square(2016)
Source: Intelligent Computer Mathematics ; https://inria.hal.science/hal-01377655 ; Intelligent Computer Mathematics, Jul 2016, Bialystok, Poland ; http://www.cicm-conference.org/2016/cicm.php
Publisher Information: CCSD
Publication Year: 2016
Subject Terms: Satisfiability Modulo Theories; Satisfiability Checking; Computer Algebra Systems; Symbolic Computation; Logical Problems; [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]
Subject Geographic: Bialystok; Poland
Time: Bialystok, Poland
Description: International audience ; 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 object
Language: English
Relation: info:eu-repo/grantAgreement//712689/EU/SC-square - Satisfiability Checking and Symbolic Computation: uniting two communities to solve real problems/SC-square
Availability: https://inria.hal.science/hal-01377655; https://inria.hal.science/hal-01377655v1/document; https://inria.hal.science/hal-01377655v1/file/SCSC-CICM16.pdf
Rights: info:eu-repo/semantics/OpenAccess
Accession Number: edsbas.7AF6C0A0
Database: BASE