772 search results - page 15 / 155 » From Graph Transformation to Software Engineering and Back |
104
click to vote
VISSOFT
2005
IEEE
15 years 7 months ago
2005
IEEE
Dominance analysis from graph theory allows one to locate subordinated software elements in a rooted dependency graph. It identifies the nesting structure for a dependency graph ...
IH
2007
Springer
15 years 8 months ago
2007
Springer
We present a probabilistic program-transformation algorithm to render a given program tamper-resistant. In addition, we suggest a model to estimate the required effort for an atta...
135
Voted
FSTTCS
2010
Springer
14 years 11 months ago
2010
Springer
This paper focuses on first-order logic (FO) extended by reachability predicates such that the expressiveness and hence decidability properties lie between FO and monadic second-o...
161
click to vote
CORR
2010
Springer
15 years 12 days ago
2010
Springer
Graphs and graph transformation systems are a frequently used modelling technique for a wide range of different domains, covering areas as diverse as refactorings, network topolog...
117
click to vote
ICSE
2008
IEEE-ACM
16 years 1 months ago
2008
IEEE-ACM
We have developed software tools that aim to support the cooperative software engineering tasks and promote an awareness of social dependencies that is essential to successful coo...