2905 search results - page 262 / 581 » Formal Memetic Algorithms |
DAC
2009
ACM
16 years 1 days ago
2009
ACM
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
TACAS
2009
Springer
15 years 5 months ago
2009
Springer
We introduce the All-Termination(T) problem: given a termination solver, T, and a program (a set of functions), find every set of formal arguments whose consideration is sufficie...
94
Voted
CIKM
2009
Springer
15 years 5 months ago
2009
Springer
Graph data are subject to uncertainties in many applications due to incompleteness and imprecision of data. Mining uncertain graph data is semantically different from and computat...
107
click to vote
FM
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. Predictive analysis aims at detecting concurrency errors during runtime by monitoring a concrete execution trace of a concurrent program. In recent years, various models ...
CAV
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. STP is a decision procedure for the satisfiability of quantifier-free formulas in the theory of bit-vectors and arrays that has been optimized for large problems encoun...