46 search results - page 1 / 10 » Satisfiability Modulo the Theory of Costs: Foundations and A... |
133
click to vote
TACAS
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
106
click to vote
CODES
2010
IEEE
14 years 10 months ago
2010
IEEE
Due to the ever increasing system complexity, deciding whether a given platform is sufficient to implement a set of applications under given constraints becomes a serious bottlene...
141
Voted
CAV
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Solvers for satisfiability modulo theories (SMT) check the satisfiability of first-order formulas containing operations from various theories such as the Booleans, bit-ve...
100
Voted
ICFEM
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We study the problem of generating a database and parameters for a given parameterized SQL query satisfying a given test condition. We introduce a formal background theor...
124
click to vote
ENTCS
2007
15 years 21 days ago
2007
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both ...