96 search results - page 2 / 20 » Analyzing recursive programs using a fixed-point calculus |
AAECC
2007
Springer
13 years 4 months ago
2007
Springer
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
ICFP
2003
ACM
14 years 4 months ago
2003
ACM
Program analysis is the heart of modern compilers. Most control flow analyses are reduced to the problem of finding a fixed point in a certain transition system, and such fixed po...
FM
1994
Springer
13 years 8 months ago
1994
Springer
OPUS is an elementary calculus that models object-orientation. It expresses in a direct way the crucial features of object-oriented programming such as objects, encapsulation, mess...
FLOPS
2008
Springer
13 years 6 months ago
2008
Springer
In this paper, we present an extension of the scheme HH(C) (Hereditary Harrop formulas with Constraints) with a suitable formulation of negation in order to obtain a constraint ded...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Many semantical aspects of programming languages are specified through calculi for constructing proofs: consider, for example, the specification of structured operational semantic...