280 search results - page 28 / 56 » Termination Tools in Ordered Completion |
AAAI
1994
13 years 9 months ago
1994
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
TYPES
1998
Springer
14 years 20 days ago
1998
Springer
Investigating soundness and completeness of verification calculi for imperative programming languages is a challenging task. Incorrect results have been published in the past. We t...
ENTCS
2006
13 years 8 months ago
2006
This paper presents a novel profiling approach, which is entirely based on program transformation techniques in order to enable exact profiling, preserving complete call stacks, m...
ITC
1997
IEEE
14 years 20 days ago
1997
IEEE
As the sizes of general and special purpose processors increase rapidly, generating high quality manufacturing tests for them is becoming a serious problem in industry. This paper...
ENTCS
2002
13 years 8 months ago
2002
A program analysis is compositional when the analysis result for a particular program fragment is obtained solely from the results for its immediate subfragments via some composit...