Results 11  20
of
7,267
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
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
A MaximumFlow Formulation of the Ncamera Stereo Correspondence Problem
, 1998
"... This paper describes a new algorithm for solving the Ncamera stereo correspondence problem by transforming it into a maximumflow problem. Once solved, the minimumcut associated to the maximumflow yields a disparity surface for the whole image at once. This global approach to stereo analysis provi ..."
Abstract

Cited by 258 (4 self)
 Add to MetaCart
This paper describes a new algorithm for solving the Ncamera stereo correspondence problem by transforming it into a maximumflow problem. Once solved, the minimumcut associated to the maximumflow yields a disparity surface for the whole image at once. This global approach to stereo analysis
LUSTRE: A declarative language for programming synchronous systems
 In 14th Symposium on Principles of Programming Languages (POPL’87). ACM
, 1987
"... LUSTRE is a synchronous dataflow language for programming syetema which interact. with their environments in realtime. After an informal presentation of the language, we describe its semantics by means of structural inference rules. Moreover, we ehow how to use this semantics in order to generate ..."
Abstract

Cited by 284 (19 self)
 Add to MetaCart
LUSTRE is a synchronous dataflow language for programming syetema which interact. with their environments in realtime. After an informal presentation of the language, we describe its semantics by means of structural inference rules. Moreover, we ehow how to use this semantics in order to generate
Dataflow transformations to maximize the use of carrysave representation in arithmetic circuits
 IEEE Transactions on ComputerAided Design of Integrated Circuits and Systems
, 2008
"... Abstract—The increasing importance of datapath circuits in complex systemsonchip calls for special arithmetic optimizations. The goal is to automatically achieve the handcrafted results which escape classic logic optimizations. Some work has been done in the recent years to infer the use of the ca ..."
Abstract

Cited by 16 (11 self)
 Add to MetaCart
Abstract—The increasing importance of datapath circuits in complex systemsonchip calls for special arithmetic optimizations. The goal is to automatically achieve the handcrafted results which escape classic logic optimizations. Some work has been done in the recent years to infer the use of the carrysave representation in the synthesis of arithmetic circuits. Yet, many cases of practical interest cannot be handled due to the scattering of logic operations among the arithmetic ones—particularly in arithmetic computations which are originally described at the bit level in highlevel languages such as C. We therefore introduce an algorithm to restructure dataflow graphs so that they can be synthesized as highquality arithmetic circuits, close to those that an expert designer would conceive. On typical embedded software benchmarks which could be advantageously implemented with hardware accelerators, our technique always reduces tangibly the
Automating High Level Control Flow Transformations For DSP Memory Management
, 1992
"... Silage code corresponding to original procedural code written by system designer [4]. (right) Procural code as generated by the control flow optimization tool. tangent diff mean grid_diff path 64  64 8.404.992  64 131.328  1 131.328  1 511  1 i x 64 511 511 dif ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
Silage code corresponding to original procedural code written by system designer [4]. (right) Procural code as generated by the control flow optimization tool. tangent diff mean grid_diff path 64  64 8.404.992  64 131.328  1 131.328  1 511  1 i x 64 511 511
An “Control of highfrequency AC link electronic advanced IPFC model to reuseNewton power flow transformer
 IEE Proc. Elect. Power Appl., May codes,” IEEE Trans. Power Syst
, 2009
"... transformer ..."
Transforming out Timing Leaks
 IN PROC. 27TH ACM SYMP. ON PRINCIPLES OF PROGRAMMING LANGUAGES (POPL
, 2000
"... One aspect of security in mobile code is privacy: private (or secret) data should not be leaked to unauthorised agents. Most of the work on secure information flow has until recently only been concerned with detecting direct and indirect flows. Secret information can however be leaked to the att ..."
Abstract

Cited by 203 (2 self)
 Add to MetaCart
One aspect of security in mobile code is privacy: private (or secret) data should not be leaked to unauthorised agents. Most of the work on secure information flow has until recently only been concerned with detecting direct and indirect flows. Secret information can however be leaked
Composing sourcetosource dataflow transformations with rewriting strategies and dependent dynamic rewrite rules
 14TH INTERNATIONAL CONFERENCE ON COMPILER CONSTRUCTION (CC’05), VOLUME 3443 OF LECTURE NOTES IN COMPUTER SCIENCE
, 2004
"... Dataflow transformations used in optimizing compilers are also useful in other programming tools such as code generators, aspect weavers, domain and applicationspecific optimizers, and refactoring tools. These applications require sourcetosource transformations rather than transformations on ..."
Abstract

Cited by 17 (8 self)
 Add to MetaCart
Dataflow transformations used in optimizing compilers are also useful in other programming tools such as code generators, aspect weavers, domain and applicationspecific optimizers, and refactoring tools. These applications require sourcetosource transformations rather than transformations
Bottleneck flow control
 IEEE Transactions on Communications
, 1981
"... AbstractThe problem of optimally choosing message rates for users of a storeandforward network is analyzed. Multiple users sharing the links of the network each attempt to adjust their message rates to achieve an ideal network operating point or an “ideal tradeoff point between high throughput an ..."
Abstract

Cited by 202 (0 self)
 Add to MetaCart
. With this definition, the network may accommodate users with different types of message traffic. A transformation technique reduces the problem of optimizing this performance measure to the problem of optimizing the basic measure. V I.
SystemLevel Power Optimizing DataFlow Transformations for Multimedia Applications Realized on Programmable Multimedia Processors
"... In this paper a methodology is presented for the application of a class of power optimizing code transformations based on data flow modifications. The target domain consists of multimedia applications realized on (embedded) programmable processors. In this important context, the application of data ..."
Abstract
 Add to MetaCart
In this paper a methodology is presented for the application of a class of power optimizing code transformations based on data flow modifications. The target domain consists of multimedia applications realized on (embedded) programmable processors. In this important context, the application of data
Results 11  20
of
7,267