390 search results - page 24 / 78 » Using Graph Transformations and Graph Abstractions for Softw... |
ICSM
2003
IEEE
14 years 2 months ago
2003
IEEE
This paper is a summary of the author’s thesis that presents a model and an environment for recovering the high level design of legacy software systems based on user defined ar...
ECEASST
2008
13 years 8 months ago
2008
Abstract: In several rule-based applications using graph transformation as underlying modeling technique the following questions arise: How can one be sure that a specific sequence...
CAV
2006
Springer
14 years 13 days ago
2006
Springer
Abstract. Many software model checkers are based on predicate abstraction. If the verification goal depends on pointer structures, the approach does not work well, because it is di...
FSTTCS
2010
Springer
13 years 6 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...
LCPC
1999
Springer
14 years 29 days ago
1999
Springer
Since the C language imposes little restriction on the use of function pointers, the task of call graph construction for a C program is far more di cult than what the algorithms d...