3889 search results - page 505 / 778 » The Use of Program Dependence Graphs in Software Engineering |
248
Voted
SIAMCOMP
2011
14 years 7 months ago
2011
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
129
Voted
ENTCS
2010
15 years 2 months ago
2010
d Set Abstraction using SAT Edd Barrett Andy King School of Computing, University of Kent, CT2 7NF, UK Symbolic decision trees are not the only way to correlate the relationship b...
136
Voted
ICSE
2001
IEEE-ACM
15 years 9 months ago
2001
IEEE-ACM
Mocha is a model checker based on the theme of exploiting design modularity: instead of manipulating unstructured state-transition graphs, it supports the hierarchical modeling fra...
158
click to vote
ISSTA
2009
ACM
15 years 11 months ago
2009
ACM
Code coverage is a common aid in the testing process. It is generally used for marking the source code segments that were executed and, more importantly, those that were not execu...
149
Voted
EUROSPI
2004
Springer
15 years 10 months ago
2004
Springer
Post-mortem project reviews often yield useful lessons learned. These project reviews are mostly recorded in plain text. This makes it difficult to derive useful overall findings ...