Sciweavers

143 search results - page 17 / 29
» Termination of Well-Typed Logic Programs
Sort
View
ICFP
2005
ACM
14 years 29 days ago
Fast narrowing-driven partial evaluation for inductively sequential programs
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...
J. Guadalupe Ramos, Josep Silva, Germán Vid...
CADE
2009
Springer
14 years 8 months ago
Complexity of Fractran and Productivity
Abstract. In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarant...
Clemens Grabmayer, Dimitri Hendriks, Jörg End...
FSTTCS
2004
Springer
14 years 24 days ago
A Decidable Fragment of Separation Logic
We present a fragment of separation logic oriented to linked lists, and study decision procedures for validity of entailments. The restrictions in the fragment are motivated by the...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn
CADE
2010
Springer
13 years 8 months ago
Automated Synthesis of Induction Axioms for Programs with Second-Order Recursion
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...
Markus Aderhold
SIGMOD
1997
ACM
107views Database» more  SIGMOD 1997»
13 years 11 months ago
Picture Programming Project
Visual Language (VL) system development is getting increasingly sophisticated in part due to the arduous nature of user interface (UI) code development. This typically involves id...
Nita Goyal, Charles Hoch, Ravi Krishnamurthy, Bria...