2302 search results - page 65 / 461 » Testing as Abstraction |
184
click to vote
EDCC
2005
Springer
15 years 11 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...
136
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
URL for the abstract in place of http://abstract.citation (the square brackets will take care of linking). Remember that we decided to omit the journal details from the list in fav...
200
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
195
click to vote
EWSN
2008
Springer
16 years 5 months ago
2008
Springer
Abstract. By using Elliptic Curve Cryptography (ECC), it has been recently shown that Public-Key Cryptography (PKC) is indeed feasible on resource-constrained nodes. This feasibili...
152
click to vote
TACAS
2009
Springer
16 years 1 months ago
2009
Springer
We describe the design and implementation of an automatic invariant generator for imperative programs. While automatic invariant generation through constraint solving has been exte...