Sciweavers

LOPSTR
2004
Springer
14 years 3 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
14 years 3 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
14 years 3 months ago
Unwinding Conditions for Security in Imperative Languages
Annalisa Bossi, Carla Piazza, Sabina Rossi
LOPSTR
2004
Springer
14 years 3 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...
LOPSTR
2004
Springer
14 years 3 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...
Automated Reasoning
Top of PageReset Settings