Sciweavers

4719 search results - page 62 / 944
» Newtonian program analysis
Sort
View
ESOP
1998
Springer
13 years 12 months ago
A Polyvariant Binding-Time Analysis for Off-line Partial Deduction
Abstract. We study the notion of binding-time analysis for logic programs. We formalise the unfolding aspect of an on-line partial deduction s a Prolog program. Using abstract inte...
Maurice Bruynooghe, Michael Leuschel, Konstantinos...
JSA
2000
175views more  JSA 2000»
13 years 7 months ago
Complete worst-case execution time analysis of straight-line hard real-time programs
In this article, the problem of finding a tight estimate on the worst-case execution time (WCET) of a real-time program is addressed. The analysis is focused on straight-line code...
Friedhelm Stappert, Peter Altenbernd
CORR
2007
Springer
132views Education» more  CORR 2007»
13 years 7 months ago
Probabilistic Analysis of Linear Programming Decoding
Abstract—We initiate the probabilistic analysis of linear programming (LP) decoding of low-density parity-check (LDPC) codes. Specifically, we show that for a random LDPC code e...
Constantinos Daskalakis, Alexandros G. Dimakis, Ri...
LPAR
2001
Springer
14 years 3 days ago
Inferring Termination Conditions for Logic Programs Using Backwards Analysis
This paper focuses on the inference of modes for which a logic program is guaranteed to terminate. This generalizes traditional termination analysis where an analyzer tries to veri...
Samir Genaim, Michael Codish
DBPL
2007
Springer
136views Database» more  DBPL 2007»
14 years 1 months ago
Analysis of Imperative XML Programs
The widespread adoption of XML has led to programming languages that support XML as a first class construct. In this paper, we present a method for analyzing and optimizing impera...
Michael G. Burke, Igor Peshansky, Mukund Raghavach...