1100 search results - page 80 / 220 » An Approach to Test Aspect-oriented Programs |
150
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...
126
Voted
SNPD
2008
15 years 4 months ago
2008
Testing cannot cover all execution schedules in concurrent software. Model checking, however, is capable of verifying the outcome of all possible executions. It has been applied s...
129
Voted
ATMOS
2007
15 years 5 months ago
2007
The Train Timetabling Problem (TTP) consists in finding a train schedule on a railway network that satisfies some operational constraints and maximizes a profit function which c...
154
click to vote
IJNSEC
2006
15 years 3 months ago
2006
The widespread use of the Internet has caused computer security to become an important issue. Currently, antivirus software is the primary mechanism that prevents computers from t...
238
Voted
AADEBUG
2005
Springer
15 years 9 months ago
2005
Springer
Code coverage analysis, the process of finding code exercised by a particular set of test inputs, is an important component of software development and verification. Most tradit...