Results 1  10
of
8,730
Termination Analysis for Partial Functions
 IN PROCEEDINGS OF THE THIRD INTERNATIONAL STATIC ANALYSIS SYMPOSIUM (SAS'96
, 1996
"... This paper deals with automated termination analysis for partial functional programs, i.e. for functional programs which do not terminate for each input. We present a method to determine their domains (resp. nontrivial subsets of their domains) automatically. More precisely, for each functional p ..."
Abstract

Cited by 12 (6 self)
 Add to MetaCart
This paper deals with automated termination analysis for partial functional programs, i.e. for functional programs which do not terminate for each input. We present a method to determine their domains (resp. nontrivial subsets of their domains) automatically. More precisely, for each functional
Automatic Termination Analysis for Partial Functions Using Polynomial Orderings
 In Proc. 4th SAS
, 1997
"... . We present a method for automatically determining the input data for which functional programs terminate. In particular, we consider functional programs which do not terminate for each input thus defining partial functions. To characterize the domains of such partial functions, termination predica ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
. We present a method for automatically determining the input data for which functional programs terminate. In particular, we consider functional programs which do not terminate for each input thus defining partial functions. To characterize the domains of such partial functions, termination
Performance Analysis of the IEEE 802.11 Distributed Coordination Function
, 2000
"... Recently, the IEEE has standardized the 802.11 protocol for Wireless Local Area Networks. The primary medium access control (MAC) technique of 802.11 is called distributed coordination function (DCF). DCF is a carrier sense multiple access with collision avoidance (CSMA/CA) scheme with binary slott ..."
Abstract

Cited by 1869 (1 self)
 Add to MetaCart
slotted exponential backoff. This paper provides a simple, but nevertheless extremely accurate, analytical model to compute the 802.11 DCF throughput, in the assumption of finite number of terminals and ideal channel conditions. The proposed analysis applies to both the packet transmission schemes
Efficient ContextSensitive Pointer Analysis for C Programs
, 1995
"... This paper proposes an efficient technique for contextsensitive pointer analysis that is applicable to real C programs. For efficiency, we summarize the effects of procedures using partial transfer functions. A partial transfer function (PTF) describes the behavior of a procedure assuming that certa ..."
Abstract

Cited by 433 (7 self)
 Add to MetaCart
This paper proposes an efficient technique for contextsensitive pointer analysis that is applicable to real C programs. For efficiency, we summarize the effects of procedures using partial transfer functions. A partial transfer function (PTF) describes the behavior of a procedure assuming
A mammalian microRNA expression atlas based on small RNA library sequencing.
 Cell,
, 2007
"... SUMMARY MicroRNAs (miRNAs) are small noncoding regulatory RNAs that reduce stability and/or translation of fully or partially sequencecomplementary target mRNAs. In order to identify miRNAs and to assess their expression patterns, we sequenced over 250 small RNA libraries from 26 different organ sy ..."
Abstract

Cited by 418 (4 self)
 Add to MetaCart
SUMMARY MicroRNAs (miRNAs) are small noncoding regulatory RNAs that reduce stability and/or translation of fully or partially sequencecomplementary target mRNAs. In order to identify miRNAs and to assess their expression patterns, we sequenced over 250 small RNA libraries from 26 different organ
KEGG: Kyoto Encyclopedia of Genes and Genomes
 Nucl. Acids Res
, 1999
"... Kyoto Encyclopedia of Genes and Genomes (KEGG) is a knowledge base for systematic analysis of gene functions in terms of the networks of genes and molecules. The major component of KEGG is the PATHWAY database that consists of graphical diagrams of biochemical pathways including most of the known me ..."
Abstract

Cited by 408 (0 self)
 Add to MetaCart
Kyoto Encyclopedia of Genes and Genomes (KEGG) is a knowledge base for systematic analysis of gene functions in terms of the networks of genes and molecules. The major component of KEGG is the PATHWAY database that consists of graphical diagrams of biochemical pathways including most of the known
Abstract interpretation and application to logic programs
, 1992
"... Abstract interpretation is a theory of semantics approximation which is usedfor the construction of semanticsbasedprogram analysis algorithms (sometimes called“data flow analysis”), the comparison of formal semantics (e.g., construction of a denotational semantics from an operational one), the des ..."
Abstract

Cited by 317 (14 self)
 Add to MetaCart
collection, useless occurcheck elimination), program transformation (e.g., partial evaluation, parallelization), andeven program correctness proofs (e.g., termination proof). After a few simple introductory examples, we recall the classical framework for abstract interpretation of programs. Starting from a
Functional Reactive Animation
, 1997
"... Fran (Functional Reactive Animation) is a collection of data types and functions for composing richly interactive, multimedia animations. The key ideas in Fran are its notions of behaviors and events. Behaviors are timevarying, reactive values, while events are sets of arbitrarily complex condition ..."
Abstract

Cited by 284 (30 self)
 Add to MetaCart
proper treatment of real time, to guide reasoning and implementation. A method to e#ectively and efficiently perform event detection using interval analysis is also described, which relies on the partial information structure on the domain of event times. Fran has been implemented in Hugs, yielding
No Free Lunch Theorems for Search
, 1995
"... We show that all algorithms that search for an extremum of a cost function perform exactly the same, when averaged over all possible cost functions. In particular, if algorithm A outperforms algorithm B on some cost functions, then loosely speaking there must exist exactly as many other functions wh ..."
Abstract

Cited by 292 (2 self)
 Add to MetaCart
. We also investigate minimax aspects of the search problem, the validity of using characteristics of a partial search over a cost function to predict future behavior of the search algorithm on that cost function, and timevarying cost functions. We conclude with some discussion of the justifiability
The Asymptotic Elasticity of Utility Functions and Optimal Investment in Incomplete Markets
 Annals of Applied Probability
, 1997
"... . The paper studies the problem of maximizing the expected utility of terminal wealth in the framework of a general incomplete semimartingale model of a financial market. We show that the necessary and sufficient condition on a utility function for the validity of several key assertions of the theor ..."
Abstract

Cited by 264 (19 self)
 Add to MetaCart
. The paper studies the problem of maximizing the expected utility of terminal wealth in the framework of a general incomplete semimartingale model of a financial market. We show that the necessary and sufficient condition on a utility function for the validity of several key assertions
Results 1  10
of
8,730