Results 1  10
of
196
Finding Fixpoints in Finite Function Spaces Using Neededness Analysis and Chaotic Iteration
 In SAS'94
, 1994
"... A new and efficient algorithm for computing the least fixpoint of a functional on a finite function space is defined. The algorithm applies to the computation of the least fixpoint (global or local) induced by an arbitrary system of functional equations in a certain formalism. The algorithm employs ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
employs a variant of Cousot and Cousot s chaotic iteration [2], and uses neededness (or dependency) information to guide the fixpoint iteration, as for instance in Kildall s early algorithm [11]. The neededness analysis is as in the algorithms proposed by Muthukumar and Hermenegildo [6] and Le Charlier
Perspectives on Program Analysis
, 1996
"... eing analysed. On the negative side, the semantic correctness of the analysis is seldom established and therefore there is often no formal justification for the program transformations for which the information is used. The semantics based approach [1; 5] is often based on domain theory in the form ..."
Abstract

Cited by 676 (34 self)
 Add to MetaCart
, and for neededness analysis it might perform a strictness analysis and use the strictness information for neededness (or make use of the "absence" notion from projection analysis and attempt to discover the di#erence). On the positive side, this usually gives rise to provably correct analyses, although
Lecture Notes on Dataflow Analysis 15411: Compiler Design
, 2008
"... In this lecture we first extend liveness analysis to handle memory references and then consider neededness analysis which is similar to liveness and used to discover dead code. Both liveness and neededness are backwards dataflow analyses. We then describe reaching definitions, a forwards ..."
Abstract
 Add to MetaCart
In this lecture we first extend liveness analysis to handle memory references and then consider neededness analysis which is similar to liveness and used to discover dead code. Both liveness and neededness are backwards dataflow analyses. We then describe reaching definitions, a forwards
A Compact and Efficient SAT Encoding for Planning
"... In the planningasSAT paradigm there have been numerous recent developments towards improving the speed and scalability of planning at the cost of finding a stepoptimal parallel plan. These developments have been towards: (1) Query strategies that efficiently yield approximately optimal plans, and ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
and neededness analysis of the plangraph. Our encoding also captures statedependent mutex constraints computed during that analysis. Because we adopt a lifted action representation, our encoding cannot generally support full action parallelism. Thus, our approach could be termed approximate, planning for a
Derivation of Static Analysers of Functional Programs From Path Properties of a Natural Semantics
, 1995
"... We advocate the use of operational semantics as a basis for specifying program analyses for functional languages. We put forward a methodology for defining a static analysis by successive refinements of the natural semantics of the language. We use paths as the abstract representation of proof tree ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
We advocate the use of operational semantics as a basis for specifying program analyses for functional languages. We put forward a methodology for defining a static analysis by successive refinements of the natural semantics of the language. We use paths as the abstract representation of proof
Relative Normalization in Orthogonal Expression Reduction Systems
 In: Proc. of the 4 th International workshop on Conditional (and Typed) Term Rewriting Systems, CTRS'94, Springer LNCS
, 1994
"... . We study reductions in orthogonal (leftlinear and nonambiguous) Expression Reduction Systems, a formalism for Term Rewriting Systems with bound variables and substitutions. To generalise the normalization theory of Huet and L'evy, we introduce the notion of neededness with respect to a set ..."
Abstract

Cited by 13 (10 self)
 Add to MetaCart
. We study reductions in orthogonal (leftlinear and nonambiguous) Expression Reduction Systems, a formalism for Term Rewriting Systems with bound variables and substitutions. To generalise the normalization theory of Huet and L'evy, we introduce the notion of neededness with respect to a
ContextSensitive Computations in Functional and Functional Logic Programs
 JOURNAL OF FUNCTIONAL AND LOGIC PROGRAMMING
, 1998
"... ..."
DemandDriven HigherOrder Fixpoint Iteration
"... Abstract. Our aim is to show that techniques from higherorder strictness analysis may be used as a general algorithmic principle in a functional programming language. Certain problems may be expressed as the search for the least solution that satisfy certain given properties. This is often done u ..."
Abstract
 Add to MetaCart
Abstract. Our aim is to show that techniques from higherorder strictness analysis may be used as a general algorithmic principle in a functional programming language. Certain problems may be expressed as the search for the least solution that satisfy certain given properties. This is often done
Annotated Type Systems for Program Analysis
, 1995
"... Interpretation Table 1.2: Annotations in the Thesis In Chapter 2 we present a combined strictness and totality analysis.We are specifying the analysis as an annotated type system. The type system allows conjunctions of annotated types, but only at the toplevel. The analysis is somewhat more powerf ..."
Abstract

Cited by 19 (2 self)
 Add to MetaCart
Interpretation Table 1.2: Annotations in the Thesis In Chapter 2 we present a combined strictness and totality analysis.We are specifying the analysis as an annotated type system. The type system allows conjunctions of annotated types, but only at the toplevel. The analysis is somewhat more
Strictness and Totality Analysis
 In Static Analysis, LNCS 864
, 1994
"... We definea novel inference system for strictness and totality analysis for the simplytyped lazy lambdacalculus with constants and fixpoints. Strictness information identifies those terms that definitely denote bottom (i.e. do not evaluate to WHNF) whereas totality information identifies those terms ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
We definea novel inference system for strictness and totality analysis for the simplytyped lazy lambdacalculus with constants and fixpoints. Strictness information identifies those terms that definitely denote bottom (i.e. do not evaluate to WHNF) whereas totality information identifies those
Results 1  10
of
196