14 search results - page 3 / 3 » Encoding First Order Proofs in SAT |
TACAS
2010
Springer
13 years 2 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 ...
LOBJET
2008
13 years 4 months ago
2008
Self-adapting software adapts its behavior in an autonomic way, by dynamically adding, suppressing and recomposing components, and by the use of computational reflection. One way t...
IFIP
2004
Springer
13 years 10 months ago
2004
Springer
Pure Pattern Type Systems (P2 TS) combine in a unified setting the capabilities of rewriting and λ-calculus. Their type systems, adapted from Barendregt’s λ-cube, are especial...
CAV
2006
Springer
13 years 8 months ago
2006
Springer
Many multithreaded programs employ concurrent data types to safely share data among threads. However, highly-concurrent algorithms for even seemingly simple data types are difficul...