644 search results - page 76 / 129 » Graph structured program evolution |
138
click to vote
ICALP
2009
Springer
16 years 3 days ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
112
click to vote
PLDI
2009
ACM
15 years 6 months ago
2009
ACM
We present the first machine-checked correctness proof for information flow control (IFC) based on program dependence graphs (PDGs). IFC based on slicing and PDGs is flow-sensi...
SIGSOFT
1995
ACM
15 years 3 months ago
1995
ACM
The notion of a program slice, originally introduced by Mark Weiser, is a fundamental operation for addressing many software-engineering problems, including program understanding,...
ENTCS
2008
14 years 12 months ago
2008
In this paper, we present the implementation in Tom of a de Bruijn indices generalization allowing the representation of term-graphs over an algebraic signature. By adding pattern...
128
click to vote
POPL
2012
ACM
13 years 7 months ago
2012
ACM
Gradual typing lets programmers evolve their dynamically typed programs by gradually adding explicit type annotations, which confer benefits like improved performance and fewer r...