Results 1 - 10 of 1,681

Inductive Verification of Hybrid Automata with Strongest Postcondition Calculus

by Daisuke Ishii, Guillaume Melquiond, Shin Nakajima
"... Abstract. Safety verification of hybrid systems is a key technique in developing embedded systems that have a strong coupling with the physical environment. We propose an automated logical analytic method for verifying a class of hybrid automata. The problems are more general than those solved by th ..."
Abstract - Add to MetaCart
, these logic formulas are discharged by state-of-the-art arithmetic solvers (e.g., Mathematica). Our proposed algorithm efficiently performs inductive reasoning by unrolling the execution for some steps and generating loop invariants from verification failures. Our experimental results along with examples

A Fast Linear-Arithmetic Solver for DPLL(T)

by Bruno Dutertre, Leonardo de Moura , 2006
"... We present a new Simplex-based linear arithmetic solver that can be integrated efficiently in the DPLL(T) framework. The new solver improves over existing approaches by enabling fast backtracking, supporting a priori simplification to reduce the problem size, and providing an efficient form of the ..."
Abstract - Cited by 289 (13 self) - Add to MetaCart
of theory propagation. We also present a new and simple approach for solving strict inequalities. Experimental results show substantial performance improvements over existing tools that use other Simplex-based solvers in DPLL(T) decision procedures. The new solver is even competitive with state-of-the-art

Efficient Conflict Driven Learning in a Boolean Satisfiability Solver

by Lintao Zhang, Conor F. Madigan, Matthew H. Moskewicz - In ICCAD , 2001
"... One of the most important features of current state-of-the-art SAT solvers is the use of conflict based backtracking and learning techniques. In this paper, we generalize various conflict driven learning strategies in terms of different partitioning schemes of the implication graph. We re-examine th ..."
Abstract - Cited by 348 (8 self) - Add to MetaCart
One of the most important features of current state-of-the-art SAT solvers is the use of conflict based backtracking and learning techniques. In this paper, we generalize various conflict driven learning strategies in terms of different partitioning schemes of the implication graph. We re

Planning as heuristic search,

by Blai Bonet , Héctor Geffner - 5 – 33, ISSN , 2001
"... Abstract In the AIPS98 Planning Contest, the HSP planner showed that heuristic search planners can be competitive with state-of-the-art Graphplan and SAT planners. Heuristic search planners like HSP transform planning problems into problems of heuristic search by automatically extracting heuristics ..."
Abstract - Cited by 421 (33 self) - Add to MetaCart
Abstract In the AIPS98 Planning Contest, the HSP planner showed that heuristic search planners can be competitive with state-of-the-art Graphplan and SAT planners. Heuristic search planners like HSP transform planning problems into problems of heuristic search by automatically extracting

Building State-of-the-Art SAT Solvers

by Inês Lynce , João Marques-Silva , 2002
"... Abstract. The area of Propositional Satisfiability (SAT) has been the subject of intensive research in recent years, with significant theoretical and practical contributions. From a practical perspective, a large number of very effective SAT solvers have recently been proposed, most of which based ..."
Abstract - Cited by 10 (1 self) - Add to MetaCart
on improvements made to the original Davis-Putnam-Logemann-Loveland (DPLL) backtrack search SAT algorithm. The new solvers are capable of solving very large, very hard real-world problem instances, which more traditional SAT solvers are totally incapable of. Despite the significant improvements in state-of-the-art

Stencil computation optimization and autotuning on state-of-the-art multicore architectures

by Kaushik Datta, Mark Murphy, Vasily Volkov, Samuel Williams, Jonathan Carter, Leonid Oliker, David Patterson, John Shalf, Katherine Yelick - In (submitted to) Proc. SC2008: High performance computing, networking, and storage conference , 2008
"... Understanding the most efficient design and utilization of emerging multicore systems is one of the most challenging questions faced by the mainstream and scientific computing industries in several decades. Our work explores multicore stencil (nearest-neighbor) computations — a class of algorithms a ..."
Abstract - Cited by 136 (16 self) - Add to MetaCart
at the heart of many structured grid codes, including PDE solvers. We develop a number of effective optimization strategies, and build an auto-tuning environment that searches over our optimizations and their parameters to minimize runtime, while maximizing performance portability. To evaluate

Building State-of-the-Art SAT Solvers

by unknown authors
"... Abstract. The area of Propositional Satisfiability (SAT) has been the subject of intensive research in recent years, with significant theoretical and practical contributions. From a practical perspective, a large number of very effective SAT solvers have recently been proposed, most of which based o ..."
Abstract - Add to MetaCart
on improvements made to the original Davis-Putnam-Logemann-Loveland (DPLL) backtrack search SAT algorithm. The new solvers are capable of solving very large, very hard real-world problem instances, which more traditional SAT solvers are totally incapable of. Despite the significant improvements in state-of-the-art

Linear Algebra Operators for GPU Implementation of Numerical Algorithms

by Jens Krüger, Rüdiger Westermann - ACM Transactions on Graphics , 2003
"... In this work, the emphasis is on the development of strategies to realize techniques of numerical computing on the graphics chip. In particular, the focus is on the acceleration of techniques for solving sets of algebraic equations as they occur in numerical simulation. We introduce a framework for ..."
Abstract - Cited by 324 (9 self) - Add to MetaCart
for the implementation of linear algebra operators on programmable graphics processors (GPUs), thus providing the building blocks for the design of more complex numerical algorithms. In particular, we propose a stream model for arithmetic operations on vectors and matrices that exploits the intrinsic parallelism

ASSAT: Computing Answer Sets of a Logic Program by SAT Solvers

by Fangzhen Lin, Yuting Zhao - Artificial Intelligence , 2002
"... We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by adding, for each loop in the program, a corresponding loop formula to the program’s completion, we obtain a one-to-one corresp ..."
Abstract - Cited by 260 (7 self) - Add to MetaCart
experimental results show that in these domains, for the task of generating one answer set of a normal logic program, our system has a clear edge over the state-of-art answer set programming systems Smodels and DLV. 1 1

A Fast Pseudo-Boolean Constraint Solver

by Donald Chai, Andreas Kuehlmann , 2003
"... Linear Pseudo-Boolean (LPB) constraints denote inequalities between arithmetic sums of weighted Boolean functions and provide a significant extension of the modeling power of purely propositional constraints. They can be used to compactly describe many discrete EDA problems with constraints on linea ..."
Abstract - Cited by 115 (1 self) - Add to MetaCart
present a comparison with other, state-of-the-art LPB solvers which demonstrates the overall efficiency of our method.
Results 1 - 10 of 1,681