Sciweavers

192 search results - page 3 / 39
» Using Call Exit Analysis for Logic Program Transformation
Sort
View
CORR
2010
Springer
140views Education» more  CORR 2010»
13 years 7 months ago
Automated Termination Analysis for Logic Programs with Cut
Termination is an important and well-studied property for logic programs. However, almost all approaches for automated termination analysis focus on definite logic programs, where...
Peter Schneider-Kamp, Jürgen Giesl, Thomas St...
PLDI
2005
ACM
14 years 1 months ago
Checking type safety of foreign function calls
We present a multi-lingual type inference system for checking type safety across a foreign function interface. The goal of our system is to prevent foreign function calls from int...
Michael Furr, Jeffrey S. Foster
CC
1998
Springer
134views System Software» more  CC 1998»
13 years 12 months ago
Flow Logics for Constraint Based Analysis
Abstract. Flow logic offers a compact and versatile notation for expressing the acceptability of solutions to program analysis problems. In contrast to previous logical formulation...
Hanne Riis Nielson, Flemming Nielson
JLP
2000
109views more  JLP 2000»
13 years 7 months ago
Demand Transformation Analysis for Concurrent Constraint Programs
interpretation. In the context of stream parallelism, this analysis identi es an amount of input data for which predicate execution can safely wait without danger of introducing de...
Moreno Falaschi, Patrick Hicks, William H. Winsbor...
ENTCS
2007
124views more  ENTCS 2007»
13 years 7 months ago
Structuring Optimizing Transformations and Proving Them Sound
A compiler optimization is sound if the optimized program that it produces is semantically equivalent to the input program. The proofs of semantic equivalence are usually tedious....
Aditya Kanade, Amitabha Sanyal, Uday P. Khedker