407 search results - page 61 / 82 » Automatic Correctness Proofs for Logic Program Transformatio... |
ICFP
2005
ACM
14 years 1 months ago
2005
ACM
Narrowing-driven partial evaluation is a powerful technique for the specialization of (first-order) functional and functional logic programs. However, although it gives good resu...
KBSE
2005
IEEE
14 years 1 months ago
2005
IEEE
Current formal software engineering methodologies provide a vast array of languages for specifying correctness properties, as well as a wide assortment automated tools that aid in...
CSL
2010
Springer
13 years 8 months ago
2010
Springer
Deduction modulo consists in presenting a theory through rewrite rules to support automatic and interactive proof search. It induces proof search methods based on narrowing, such a...
CADE
2005
Springer
14 years 8 months ago
2005
Springer
In today's society, people have very little control over what kinds of personal data are collected and stored by various agencies in both the private and public sectors. We de...
IWMM
2009
Springer
14 years 2 months ago
2009
Springer
This paper presents an analysis that derives a formula describing the worst-case live heap space usage of programs in a functional language with automated memory management (garba...