3889 search results - page 103 / 778 » The Use of Program Dependence Graphs in Software Engineering |
148
click to vote
FSTTCS
2008
Springer
15 years 7 months ago
2008
Springer
We consider the isomorphism and canonization problem for 3-connected planar graphs. The problem was known to be L -hard and in UL ∩ coUL [TW08]. In this paper, we give a determin...
211
click to vote
IWPSE
2003
IEEE
15 years 11 months ago
2003
IEEE
One of the issues in software evolution is debugging. Debugging large and complex software systems evolved requires a lot of effort since it is very difficult to localize and ide...
217
click to vote
SEMCO
2009
IEEE
16 years 1 months ago
2009
IEEE
— In this paper we present an automated support for software model evolution using a formal language constructs. For this, we extended Object Constraint Language (OCL) with actio...
160
click to vote
APPML
2011
15 years 1 months ago
2011
The k-domination number of a graph is the cardinality of a smallest set of vertices such that every vertex not in the set is adjacent to at least k vertices of the set. We prove t...
180
click to vote
SERA
2005
Springer
15 years 11 months ago
2005
Springer
Requirements specifications often make use of a number of scenarios that are interrelated and that depend on each other in many ways. However, they are often treated separately, o...