Sciweavers

81 search results - page 2 / 17
» On the verification of polynomial system solvers
Sort
View
ENTCS
2008
85views more  ENTCS 2008»
13 years 5 months ago
Comparing CSP and SAT Solvers for Polynomial Constraints in Termination Provers
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
Salvador Lucas, Rafael Navarro-Marset
FMCAD
2006
Springer
13 years 9 months ago
Ario: A Linear Integer Arithmetic Logic Solver
Ario is a solver for systems of linear integer arithmetic logic. Such systems are commonly used in design verification applications and are classified under Satisfiability Modulo T...
Hossein M. Sheini, Karem A. Sakallah
EUROPAR
2001
Springer
13 years 10 months ago
Polynomial Preconditioning for Specially Structured Linear Systems of Equations
For the solution of the SID (Symmetric InDefinite) linear systems, the use of the GLS (Generalized Least-Squares) polynomial preconditioner can improve the execution efficiency of...
Y. Liang, Jim Weston, Marek Szularz
STTT
2008
134views more  STTT 2008»
13 years 5 months ago
Automated verification of access control policies using a SAT solver
Abstract. Managing access control policies in modern computer systems can be challenging and error-prone. Combining multiple disparate access policies can introduce unintended cons...
Graham Hughes, Tevfik Bultan
ATAL
2010
Springer
13 years 6 months ago
Agents towards vehicle routing problems
A multi-agent VRP solver is presented in this paper. It utilizes the contract-net protocol based allocation and several improvement strategies. It provides the solution with the q...
Jirí Vokrínek, Antonín Komend...