Undecidability of context-sensitive data-dependence analysis
نویسندگان
چکیده
منابع مشابه
Undecidability of Context-Sensitive Data-Dependence Analysis
A number of program-analysis problems can be tackled by transforming them into certain kinds of graph-reachability problems in labeled directed graphs. The edge labels can be used to filter out paths that are not of interest: A path P from vertex s to vertex t only counts as a “valid connection” between s and t if the word spelled out by P is in a certain language. Often the languages used for ...
متن کاملContext-Sensitive Regression Analysis for Distributed Data
A precondition of existing ensemble-based distributed data mining techniques is the assumption that contributing data are identically and independently distributed. However, this assumption is not valid in many virtual organization contexts because contextual heterogeneity exists. Focusing on regression tasks, this paper proposes a contextbased meta-learning technique for horizontally partition...
متن کاملConditional Dependence in Longitudinal Data Analysis
Mixed models are widely used to analyze longitudinal data. In their conventional formulation as linear mixed models (LMMs) and generalized LMMs (GLMMs), a commonly indispensable assumption in settings involving longitudinal non-Gaussian data is that the longitudinal observations from subjects are conditionally independent, given subject-specific random effects. Although conventional Gaussian...
متن کاملWarning! Context-sensitive data.
or 300 years, from the time of William Harvey and tephan Hales (1) until Braunwald, Ross, and Sonnenblick 2), physicians and investigators focused their attention on he pumping function of the heart with great success. uring the past 50 years, however, a steadily growing body f evidence has awakened us to another critical role of the eart in the homeostasis of the milieu interieur, the reguatio...
متن کاملData Structure Analysis: An Efficient Context-Sensitive Heap Analysis
This paper presents an efficient context-sensitive heap analysis algorithm called Data Structure Analysis designed to enable analyses and transformations on entire disjoint recursive data structures. The analysis has several challenging properties needed to enable such transformations: context-sensitivity with cloning (essential for proving disjointness), field-sensitivity, and the use of an ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Programming Languages and Systems
سال: 2000
ISSN: 0164-0925,1558-4593
DOI: 10.1145/345099.345137