DSpace Repository

SAT Modulo Linear Arithmetic for Solving Polynomial

Show simple item record

dc.contributor Universitat de Vic. Escola Politècnica Superior
dc.contributor Universitat de Vic. Grup de Recerca en Tecnologies Digitals
dc.contributor.author Borralleras Andreu, Cristina
dc.contributor.author Lucas, Salvador
dc.contributor.author Oliveras, Albert
dc.contributor.author Rodríguez-Carbonell, Enric
dc.contributor.author Rubio, Albert
dc.date.accessioned 2012-10-04T11:45:38Z
dc.date.available 2012-10-04T11:45:38Z
dc.date.created 2012
dc.date.issued 2012-10-04
dc.identifier.citation BORRALLERAS ANDREU, Cristina i altres . "SAT Modulo Linear Arithmetic for Solving Polynomial Constraints". A: Journal of Automated Reasoning, 2012, vol. 48, núm. 1, pàg. 107-131. DOI: 10.1007/s10817-010-9196-8
dc.identifier.issn 0168-7433
dc.identifier.uri http://hdl.handle.net/10854/1887
dc.description.abstract 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 few. In this paper we propose a new method for solving non-linear constraints based on encoding the problem into an SMT problem considering only linear arithmetic. Unlike other existing methods, our method focuses on proving satisfiability of the constraints rather than on proving unsatisfiability, which is more relevant in several applications as we illustrate with several examples. Nevertheless, we also present new techniques based on the analysis of unsatisfiable cores that allow one to efficiently prove unsatisfiability too for a broad class of problems. The power of our approach is demonstrated by means of extensive experiments comparing our prototype with state-of-the-art tools on benchmarks taken both from the academic and the industrial world. ca_ES
dc.format application/pdf
dc.format.extent 23 p. ca_ES
dc.language.iso eng ca_ES
dc.rights (c) Springer (The original publication is available at www.springerlink.com)
dc.rights Tots els drets reservats ca_ES
dc.subject.other Aritmètica ca_ES
dc.title SAT Modulo Linear Arithmetic for Solving Polynomial ca_ES
dc.type info:eu-repo/semantics/article ca_ES
dc.identifier.doi https://doi.org/10.1007/s10817-010-9196-8
dc.rights.accesRights info:eu-repo/semantics/openAccess
dc.type.version info:eu-repo/semantics/acceptedVersion
dc.indexacio Indexat a SCOPUS
dc.indexacio Indexat a WOS/JCR ca_ES

Files in this item

Show simple item record

Search RIUVic

Advanced Search