FLOPS
2004
Springer
13 years 10 months ago
2004
Springer
FLOPS
2004
Springer
13 years 10 months ago
2004
Springer
FLOPS
2004
Springer
13 years 10 months ago
2004
Springer
Sharing among program variables is vital information when analyzing logic programs. This information is often expressed either as sets or as pairs of program variables that (may) s...
FLOPS
2004
Springer
13 years 10 months ago
2004
Springer
This paper presents a complete (infinite) axiomatization for an algebraic construction of graphs, in which a finite fragment denotes the class of graphs with bounded tree width.
FLOPS
2004
Springer
13 years 10 months ago
2004
Springer
This paper presents a backward sharing analysis for logic programs. The analysis computes pre-conditions for a query that guarantee a given post-condition is satisfied after the q...