203 search results - page 17 / 41 » Datatype-Generic Termination Proofs |
102
click to vote
ENTCS
2007
15 years 1 months ago
2007
The dependency pairs method is one of the most powerful technique for proving termination of rewriting and it is currently central in most automatic termination provers. Recently,...
138
click to vote
ICFP
2005
ACM
16 years 1 months ago
2005
ACM
Proof-carrying code (PCC) is a general framework that can, in principle, verify safety properties of arbitrary machine-language programs. Existing PCC systems and typed assembly l...
POPL
2012
ACM
13 years 9 months ago
2012
ACM
We develop logical mechanisms and decision procedures to facilitate the verification of full functional properties of inductive tree data-structures using recursion that are soun...
114
click to vote
APLAS
2009
ACM
15 years 6 months ago
2009
ACM
Type and effect systems are a tool to analyse statically the behaviour of programs with effects. We present a proof based on the so called reducibility candidates that a suitable ...
122
click to vote
RTA
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...