75 search results - page 5 / 15 » Certification of Automated Termination Proofs |
IANDC
2008
14 years 11 months ago
2008
The main goal of this paper is to apply rewriting termination technology --enjoying a quite mature set of termination results and tools-- to the problem of proving automatically t...
98
Voted
CL
2000
Springer
15 years 3 months ago
2000
Springer
We use Kleene algebra with tests to verify a wide assortment of common compiler optimizations, including dead code elimination, common subexpression elimination, copy propagation,...
89
Voted
LPAR
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. The main goal of this paper is to apply rewriting termination technology —enjoying a quite mature set of termination results and tools— to the problem of proving auto...
106
Voted
CADE
2006
Springer
15 years 12 months ago
2006
Springer
Abstract. Based on inductive definitions, we develop an automated tool for defining partial recursive functions in Higher-Order Logic and providing appropriate reasoning tools for ...
109
click to vote
CADE
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We describe a system for the automated certification of safety properties of NASA software. The system uses Hoare-style program verification technology to generate proof ...