106 search results - page 13 / 22 » Termination Analysis of Logic Programs Based on Dependency G... |
LOPSTR
2007
Springer
14 years 1 months ago
2007
Springer
Static analyses of object-oriented programs usually rely on intermediate representations that respect the original semantics while having a more uniform and basic syntax. Most of t...
MKM
2004
Springer
14 years 27 days ago
2004
Springer
As the amount of online formal mathematical content grows, for example through active efforts such as the Mathweb [21], MOWGLI [4], Formal Digital Library, or FDL [1], and others, ...
ERSHOV
2009
Springer
13 years 11 months ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
SIGSOFT
2002
ACM
14 years 8 months ago
2002
ACM
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise poi...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...