203 search results - page 7 / 41 » Datatype-Generic Termination Proofs |
111
click to vote
CLEIEJ
2007
15 years 1 months ago
2007
This work presents proof rules for termination and non-termination for a subset of a C-like language that consists of the statements : assignation, composition, if, skip and while...
113
Voted
FROCOS
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Nowadays, formal methods rely on tools of different kinds: proof assistants with which the user interacts to discover a proof step by step; and fully automated tools whic...
144
click to vote
ICLP
2010
Springer
15 years 12 days ago
2010
Springer
Abductive Logic Programming is a computationally founded representation of abductive reasoning. In most ALP frameworks, integrity constraints express domainspecific logical relati...
116
Voted
SAS
2010
Springer
15 years 8 days ago
2010
Springer
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as a component of proving more general termination an...
104
click to vote
LPAR
2005
Springer
15 years 7 months ago
2005
Springer
In this paper the Recursive Path Ordering is adapted for proving termination of rewriting incrementally. The new ordering, called Recursive Path Ordering with Modules, has as ingre...