492 search results - page 16 / 99 » XML graphs in program analysis |
PLDI
2006
ACM
14 years 3 months ago
2006
ACM
Dependence graphs and memoization can be used to efficiently update the output of a program as the input changes dynamically. Recent work has studied techniques for combining the...
VL
1991
IEEE
14 years 1 months ago
1991
IEEE
The Conceptual Programming environment, CP, being developed at the Computing Research Laboratory (CRL), is a complete knowledge representation visual programming environment for u...
CSMR
1999
IEEE
14 years 2 months ago
1999
IEEE
Maintenance activities are made more difficult when pointers are heavily used in source code: the programmer needs to build a mental model of memory locations and of the way they ...
IOR
2011
13 years 4 months ago
2011
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...
JCSC
1998
13 years 9 months ago
1998
: Continuous and hybrid Petri nets can be seen as relaxation of discrete nets, in which the firing of some or of all transitions is approximated with a fluid model. Several analysi...