417 search results - page 15 / 84 » Constructing Call Multigraphs Using Dependence Graphs |
MFCS
2007
Springer
14 years 2 months ago
2007
Springer
We investigate algorithmic properties of infinite transition graphs that are generated by rewriting systems over unranked trees. Two kinds of such rewriting systems are studied. ...
ICSM
2007
IEEE
14 years 2 months ago
2007
IEEE
Uncovering, modelling, and understanding architectural level dependencies of software systems is a key task for software maintainers. However, current dependency analysis techniqu...
DAM
2008
13 years 8 months ago
2008
In this paper, we address the following problem: given a synchronous digital circuit, is it possible to construct a new circuit computing the same function as the original one but...
GM
1999
Springer
14 years 22 days ago
1999
Springer
In many applications one is concerned with the approximation of functions from a finite set of scattered data sites with associated function values. We describe a scheme for cons...
ASWEC
2005
IEEE
14 years 2 months ago
2005
IEEE
Program slicing is a well-known program analysis technique that extracts the elements of a program related to a particular computation. Based on modular monadic semantics of a pro...