5624 search results - page 400 / 1125 » On Conditional Covering Problem |
179
click to vote
ISSTA
2006
ACM
16 years 24 days ago
2006
ACM
There are several problem areas that must be addressed when applying randomization to unit testing. As yet no general, fully automated solution that works for all units has been p...
148
click to vote
IAT
2005
IEEE
16 years 14 days ago
2005
IEEE
Our previous research presents a methodology of cooperative problem solving for BDI systems, based on a complete formal theory. This covers both a static part, defining individua...
160
click to vote
VLSID
2005
IEEE
2005
IEEE
Formal Methods for Analyzing the Completeness of an Assertion Suite against a High-Level Fault Model
16 years 12 days ago
One of the emerging challenges in formal property verification (FPV) technology is the problem of deciding whether sufficient properties have been written to cover the design in...
156
click to vote
CAV
2005
Springer
16 years 11 days ago
2005
Springer
Abstract. The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symb...
206
click to vote
EMO
2005
Springer
16 years 11 days ago
2005
Springer
Abstract. The hypervolume measure is one of the most frequently applied measures for comparing the results of evolutionary multiobjective optimization algorithms (EMOA). The idea t...