644 search results - page 49 / 129 » Graph structured program evolution |
107
click to vote
FM
2006
Springer
15 years 3 months ago
2006
Springer
Formal modeling is a crucial first step in the analysis of safety critical communication protocols such as IP Telephony. These protocols are notoriously resistant to formal modelin...
ICALP
2003
Springer
15 years 5 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
103
click to vote
ICSM
2008
IEEE
15 years 6 months ago
2008
IEEE
There exist numerous software visualization techniques that aim to facilitate program comprehension. One of the main concerns in every such software visualization is to identify r...
ADAEUROPE
2004
Springer
15 years 5 months ago
2004
Springer
The tree width of a graph G measures how close G is to being a tree or a series-parallel graph. Many well-known problems that are otherwise NP-complete can be solved efficiently if...
102
click to vote
PPDP
2009
Springer
15 years 6 months ago
2009
Springer
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...