3889 search results - page 103 / 778 » The Use of Program Dependence Graphs in Software Engineering |
114
click to vote
FSTTCS
2008
Springer
15 years 4 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...
176
Voted
IWPSE
2003
IEEE
15 years 8 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...
150
Voted
SEMCO
2009
IEEE
15 years 10 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...
128
Voted
APPML
2011
14 years 10 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...
144
Voted
SERA
2005
Springer
15 years 9 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...