Equality detection for linear arithmetic constraints

Satisfiability modulo theories （SMT） play a key role in verification applications. A crucial SMT problem is to com- bine separate theory solvers for the union of theories. In previous work, the simplex method is used to determine the solvability of constraint systems and the equalities implied by co...

Full description

Saved in:
Bibliographic Details
Published inJournal of Zhejiang University. A. Science Vol. 10; no. 12; pp. 1784 - 1789
Main Authors Li, Li, He, Kai-duo, Gu, Ming, Song, Xiao-yu
Format Journal Article
LanguageEnglish
Published Hangzhou Zhejiang University Press 01.12.2009
Subjects
Civil Engineering
Classical and Continuum Physics
COM
Engineering
Industrial Chemistry/Chemical Engineering
Mechanical Engineering
SMT
单纯形表
对偶单纯形法
模理论
线性算法
表面贴装
Satisfiability modulo theories (SMT)
Model checking
Linear arithmetic
TP31
Online AccessGet full text

Cover

More Information
Summary:Satisfiability modulo theories （SMT） play a key role in verification applications. A crucial SMT problem is to com- bine separate theory solvers for the union of theories. In previous work, the simplex method is used to determine the solvability of constraint systems and the equalities implied by constraint systems are detected by a multitude of applications of the dual simplex method. We present an effective simplex tableau-based method to identify all implicit equalities such that the simplex method is harnessed to an irreducible minimum. Experimental results show that the method is feasible and effective.
Bibliography:TP391.41
O221.1
33-1236/O4
Model checking, Satisfiability modulo theories （SMT）, Linear arithmetic
ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1673-565X
1862-1775
DOI:10.1631/jzus.A0820812