Sciweavers

LOPSTR
2004
Springer
13 years 10 months ago
Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
J. B. Wells, Boris Yakobowski
LOPSTR
2004
Springer
13 years 10 months ago
On Termination of Binary CLP Programs
Abstract. Termination of binary CLP programs has recently become an important question in the termination analysis community. The reason for this is due to that a number of approac...
Alexander Serebrenik, Frédéric Mesna...
LOPSTR
2004
Springer
13 years 10 months ago
A Generic Framework for Context-Sensitive Analysis of Modular Programs
Abstract. Context-sensitive analysis provides information which is potentially more accurate than that provided by context-free analysis. Such information can then be applied in or...
Germán Puebla, Jesús Correas, Manuel...
LOPSTR
2004
Springer
13 years 10 months ago
Logical Mobility and Locality Types
Jonathan Moody
LOPSTR
2004
Springer
13 years 10 months ago
Determinacy Analysis for Logic Programs Using Mode and Type Information
We propose an analysis for detecting procedures and goals that are deterministic (i.e. that produce at most one solution), or predicates whose clause tests are mutually exclusive (...
Pedro López-García, Francisco Bueno,...
LOPSTR
2004
Springer
13 years 10 months ago
Proving Termination for Logic Programs by the Query-Mapping Pairs Approach
This paper describes a method for proving termination of to logic programs based on abstract interpretation. The method ry-mapping pairs to abstract the relation between calls in t...
Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Ser...
LOPSTR
2004
Springer
13 years 10 months ago
Unwinding Conditions for Security in Imperative Languages
Annalisa Bossi, Carla Piazza, Sabina Rossi
LOPSTR
2004
Springer
13 years 10 months ago
Declarative Semantics of Input Consuming Logic Programs
Most logic programming languages actually provide some kind of dynamic scheduling to increase the expressive power and to control execution. Input consuming derivations have been i...
Annalisa Bossi, Nicoletta Cocco, Sandro Etalle, Sa...
LOPSTR
2004
Springer
13 years 10 months ago
Natural Rewriting for General Term Rewriting Systems
We address the problem of an efficient rewriting strategy for general term rewriting systems. Several strategies have been proposed over the last two decades for rewriting, the mos...
Santiago Escobar, José Meseguer, Prasanna T...
LOPSTR
2004
Springer
13 years 10 months ago
Fully Automatic Binding-Time Analysis for Prolog
Offline partial evaluation techniques rely on an annotated version of the source program to control the specialisation process. These annotations guide the specialisation and have ...
Stephen-John Craig, John P. Gallagher, Michael Leu...