Sciweavers

336 search results - page 23 / 68
» Monitoring modulo theories
Sort
View
ISMVL
2009
IEEE
96views Hardware» more  ISMVL 2009»
14 years 4 months ago
Evaluation of Cardinality Constraints on SMT-Based Debugging
For formal verification of hardware Satisfiability Modulo Theory (SMT) solvers are increasingly applied. Today’s state-of-the-art SMT solvers use different techniques like ter...
André Sülflow, Robert Wille, Görs...
CP
2007
Springer
14 years 4 months ago
Propagation = Lazy Clause Generation
Finite domain propagation solvers effectively represent the possible values of variables by a set of choices which can be naturally modelled as Boolean variables. In this paper we...
Olga Ohrimenko, Peter J. Stuckey, Michael Codish
TACAS
2009
Springer
144views Algorithms» more  TACAS 2009»
14 years 2 months ago
Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints
Abstract. We present a method which computes optimized representations for non-convex polyhedra. Our method detects so-called redundant linear constraints in these representations ...
Christoph Scholl, Stefan Disch, Florian Pigorsch, ...
CCL
1994
Springer
14 years 1 months ago
On Modularity in Term Rewriting and Narrowing
We introduce a modular property of equational proofs, called modularity of normalization, for the union of term rewrite systems with shared symbols. The idea is, that every normali...
Christian Prehofer
POPL
1994
ACM
14 years 1 months ago
A Needed Narrowing Strategy
Abstract: The narrowing relation over terms constitutes the basis of the most important operational semantics of languages that integrate functional and logic programming paradigms...
Sergio Antoy, Rachid Echahed, Michael Hanus