159 search results - page 8 / 32 » Semantics of Termination |
CADE
2007
Springer
14 years 8 months ago
2007
Springer
This paper combines predictive labeling with dependency pairs and reports on its implementation. Our starting point is the method of proving termination of rewrite systems using se...
TABLEAUX
2009
Springer
14 years 2 months ago
2009
Springer
This paper presents a method for synthesising sound and complete tableau calculi. Given a specification of the formal semantics of a logic, the method generates a set of tableau i...
TIME
1997
IEEE
14 years 4 days ago
1997
IEEE
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, allows the derivation of the maximal validity intervals (MVIs) o...
TCS
2010
13 years 6 months ago
2010
We define a program semantics that is preserved by dependence-based slicing algorithms. It is a natural extension, to non-terminating programs, of the semantics introduced by Wei...
FAC
2006
13 years 8 months ago
2006
A formal relationship between program slicing and partial evaluation is established. It is proved that for terminating programs, a residual program produced by partial evaluation i...