1795 search results - page 280 / 359 » On the Complexity of Circuit Satisfiability |
EDCC
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. We present the PathCrawler prototype tool for the automatic generation of test-cases satisfying the rigorous all-paths criterion, with a user-defined limit on the number...
FASE
2005
Springer
14 years 4 months ago
2005
Springer
This work defines several control-flow coverage criteria for testing the interactions among a set of collaborating objects. The criteria are based on UML sequence diagrams that a...
JCDL
2004
ACM
14 years 4 months ago
2004
ACM
Archaeologists have to deal with vast quantities of information, generated both in the field and laboratory. That information is heterogeneous in nature, and different projects ha...
GECCO
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. The current trend in Embedded Systems (ES) design is moving towards the integration of increasingly complex applications on a single chip. An Embedded System has to satis...
ICALP
2004
Springer
14 years 4 months ago
2004
Springer
We present a domain-theoretic version of Picard’s theorem for solving classical initial value problems in Rn . For the case of vector fields that satisfy a Lipschitz condition, ...