411 search results - page 57 / 83 » Automating the Dependency Pair Method |
ENTCS
2007
13 years 10 months ago
2007
Several model-checker based methods to automated test-case generation have been proposed recently. The performance and applicability largely depends on the complexity of the model...
BMCBI
2010
2010
On the use of resampling tests for evaluating statistical significance of binding-site co-occurrence
13 years 10 months ago
Background: In eukaryotes, most DNA-binding proteins exert their action as members of large effector complexes. The presence of these complexes are revealed in high-throughput gen...
COMPSAC
2002
IEEE
14 years 3 months ago
2002
IEEE
Achievement of quality in software design, while never easy, is made more difficult by the inherent complexity of hard real-time (HRT) design. Furthermore, timing requirements in...
BIRTHDAY
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. Loops and other unbound control structures constitute a major bottleneck in formal software verification, because correctness proofs over such control structures generall...
ACL
2006
14 years 1 days ago
2006
The integration of sophisticated inference-based techniques into natural language processing applications first requires a reliable method of encoding the predicate-argument struc...