- -

SAT modulo linear arithmetic for Solving Polynomial Constraints

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by


SAT modulo linear arithmetic for Solving Polynomial Constraints

Show full item record

Borralleras, C.; Lucas Alba, S.; Oliveras ., A.; Rodriguez-Carbonell, E.; Rubio ., A. (2012). SAT modulo linear arithmetic for Solving Polynomial Constraints. Journal of Automated Reasoning. 48(1):107-131. doi:10.1007/s10817-010-9196-8

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/37666

Files in this item

Item Metadata

Title: SAT modulo linear arithmetic for Solving Polynomial Constraints
UPV Unit: Universitat Politècnica de València. Departamento de Sistemas Informáticos y Computación - Departament de Sistemes Informàtics i Computació
Issued date:
Polynomial constraint solving plays a prominent role in several areas of hardware and software analysis and verification, e.g.; termination proving, program invariant generation and hybrid system verification, to name a ...[+]
Subjects: Constraint solving , Non-linear arithmetic , Polynomial constraints , SAT modulo theories , System verification , Termination , Hardware and software , Linear arithmetic , Non-linear constraints , Program invariants , Satisfiability , System verifications , Unsatisfiable core , Formal logic , Hybrid systems , Polynomials , Verification
Copyrigths: Reserva de todos los derechos
Journal of Automated Reasoning. (issn: 0168-7433 ) (eissn: 1573-0670 )
DOI: 10.1007/s10817-010-9196-8
Springer Netherlands
Publisher version: http://link.springer.com/article/10.1007%2Fs10817-010-9196-8
This work has been partially supported by the EU (FEDER) and the Spanish MEC/MICINN, under grants TIN 2007-68093-C02-01 and TIN 2007-68093-C02-02.
Type: Artículo

This item appears in the following Collection(s)

Show full item record