390 search results - page 15 / 78 » Using Graph Transformations and Graph Abstractions for Softw... |
ECSA
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. In this paper, we report on the development of a methodology for the evolution of software towards new architectures. In our approach, we represent source code as graphs....
AGTIVE
2007
Springer
14 years 22 days ago
2007
Springer
On the basis of a case-study, we demonstrate the usefulness of topology invariants for model-driven systems development. Considering a graph grammar semantics for a relevant fragme...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Graph transformation is concerned with the manipulation of graphs by means of rules. Graph grammars have been traditionally studied using techniques from category theory. In previ...
DAC
2009
ACM
14 years 9 months ago
2009
ACM
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
FSTTCS
2008
Springer
13 years 9 months ago
2008
Springer
ABSTRACT. We study the problem of space-efficient polynomial-time algorithms for directed stconnectivity (STCON). Given a directed graph G, and a pair of vertices s, t, the STCON ...