407 search results - page 43 / 82 » Automatic Correctness Proofs for Logic Program Transformatio... |
ESOP
2004
Springer
14 years 1 months ago
2004
Springer
We present an Abstract Interpretation-based framework for automatically analyzing programs containing digital filters. Our framework allows refining existing analyses so that the...
ICLP
2003
Springer
14 years 27 days ago
2003
Springer
Abstract. In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination...
ICFP
2003
ACM
14 years 7 months ago
2003
ACM
The task of designing and implementing a compiler can be a difficult and error-prone process. In this paper, we present proach based on the use of higher-order abstract syntax and...
CADE
2010
Springer
13 years 8 months ago
2010
Springer
In order to support the verification of programs, verification tools such as ACL2 or Isabelle try to extract suitable induction axioms from the definitions of terminating, recursiv...
FOSSACS
2001
Springer
14 years 6 days ago
2001
Springer
Garbage collection relieves the programmer of the burden of managing dynamically allocated memory, by providing an automatic way to reclaim unneeded storage. This eliminates or les...