• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 24
Next 10 →

Weighted pushdown systems and their application to interprocedural dataflow analysis

by Thomas Reps, Stefan Schwoon, Somesh Jha - Sci. of Comp. Prog , 2003
"... Abstract. Recently, pushdown systems (PDSs) have been extended to weighted PDSs, in which each transition is labeled with a value, and the goal is to determine the meet-over-allpaths value (for paths that meet a certain criterion). This paper shows how weighted PDSs yield new algorithms for certain ..."
Abstract - Cited by 140 (31 self) - Add to MetaCart
Abstract. Recently, pushdown systems (PDSs) have been extended to weighted PDSs, in which each transition is labeled with a value, and the goal is to determine the meet-over-allpaths value (for paths that meet a certain criterion). This paper shows how weighted PDSs yield new algorithms for certain

Path-sensitive dataflow analysis with iterative refinement

by Dinakar Dhurjati, Manuvir Das, Yue Yang , 2006
"... In this paper, we present a new method for supporting abstraction refinement in path-sensitive dataflow analysis. We show how an adjustable merge criterion can be used as an interface to control the degree of abstraction. In particular, we partition the merge criterion with two sets of predicates | ..."
Abstract - Cited by 16 (0 self) - Add to MetaCart
In this paper, we present a new method for supporting abstraction refinement in path-sensitive dataflow analysis. We show how an adjustable merge criterion can be used as an interface to control the degree of abstraction. In particular, we partition the merge criterion with two sets of predicates

BPF+: Exploiting Global Data-flow Optimization in a Generalized Packet Filter Architecture

by Andrew Begel, Steven Mccanne, Susan L. Graham - In SIGCOMM , 1999
"... A packet filter is a programmable selection criterion for classifying or selecting packets from a packet stream in a generic, reusable fashion. Previous work on packet filters falls roughly into two categories, namely those efforts that investigate flexible and extensible filter abstractions but sac ..."
Abstract - Cited by 79 (0 self) - Add to MetaCart
A packet filter is a programmable selection criterion for classifying or selecting packets from a packet stream in a generic, reusable fashion. Previous work on packet filters falls roughly into two categories, namely those efforts that investigate flexible and extensible filter abstractions

A Communication Placement Framework with Unified Dependence and Data-flow Analysis

by Ken Kennedy, Ajay Sethi - In 3rd International Conference on High Performance Computing, Trivandrum , 1996
"... Communication placement analysis is an important step in the compilation of data-parallel programs for multiprocessor systems. This paper presents a communication placement framework that minimizes frequency of communication, eliminates redundant communication, and maximizes communication latency hi ..."
Abstract - Cited by 8 (2 self) - Add to MetaCart
placement criterion. This structure allows the framework to support vector message pipelining -- an important optimization for programs with loop-carried dependences -- but, that was not supported by any previous data-flow framework. The paper also describes how other optimizations, such as partially

Weighted Pushdown Systems and their Application toInterprocedural Dataflow Analysis

by unknown authors
"... Abstract. Recently, pushdown systems (PDSs) have been extended to weighted PDSs, inwhich each transition is labeled with a value, and the goal is to determine the meet-over-allpaths value (for paths that meet a certain criterion). This paper shows how weighted PDSsyield new algorithms for certain cl ..."
Abstract - Add to MetaCart
Abstract. Recently, pushdown systems (PDSs) have been extended to weighted PDSs, inwhich each transition is labeled with a value, and the goal is to determine the meet-over-allpaths value (for paths that meet a certain criterion). This paper shows how weighted PDSsyield new algorithms for certain

Unit Level Test Adequacy Criteria for Visual Dataflow Languages and a Testing Methodology

by Marcel R. Karam, Trevor J. Smedley, Sergiu M. Dascalu
"... Visual dataflow languages (VDFLs), which include commercial and research systems, have had a substantial impact on end-user programming. Like any other programming languages, be they visual or textual, VDFLs often contain faults. Providing programmers of these languages with some of the benefits of ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Visual dataflow languages (VDFLs), which include commercial and research systems, have had a substantial impact on end-user programming. Like any other programming languages, be they visual or textual, VDFLs often contain faults. Providing programmers of these languages with some of the benefits

A bi-criteria scheduling heuristics for distributed embedded systems under reliability and real-time constraints

by Ismail Assayad, Alain Girault, Hamoudi Kalla - In Int. Conf. on Dependable Systems and Networks, DSN’04 , 2004
"... Multi-criteria scheduling problems, involving optimiza-tion of more than one criterion, are subject to a growing interest. In this paper, we present a new bi-criteria schedul-ing heuristic for scheduling data-flow graphs of operations onto parallel heterogeneous architectures according to two criter ..."
Abstract - Cited by 40 (6 self) - Add to MetaCart
Multi-criteria scheduling problems, involving optimiza-tion of more than one criterion, are subject to a growing interest. In this paper, we present a new bi-criteria schedul-ing heuristic for scheduling data-flow graphs of operations onto parallel heterogeneous architectures according to two

Specifying and Generating Test Cases Using Observer Automata

by Johan Blom, Anders Hessel, Bengt Jonsson, Paul Pettersson - Proc. 4 th International Workshop on Formal Approaches to Testing of Software 2004 (FATES’04), volume 3395 of Lecture Notes in Computer Science , 2005
"... Abstract. We present a technique for specifying coverage criteria and a method for generating test suites for systems whose behaviours can be described as extended finite state machines (EFSM). To specify coverage criteria we use observer automata with parameters, which monitor and accept traces tha ..."
Abstract - Cited by 19 (7 self) - Add to MetaCart
that cover a given test criterion of an EFSM. The flexibility of the technique is demonstrated by specifying a number of well-known coverage criteria based on control- and data-flow information using observer automata with parameters. We also develop a method for generating test cases from coverage criteria

to the Multiparadigm World of Commercial Spreadsheets

by Marc Randall, Fisher Ii, Gregg Rothermel, Tyler Creelan, Margaret Burnett, Marc Fisher Ii, Gregg Rothermel, Tyler Creelan, Margaret Burnett
"... Spreadsheets are widely used but often contain faults. Thus, in prior work we presented a dataflow testing methodology for use with spreadsheets, which studies have shown can be used cost-effectively by enduser programmers. To date, however, the methodology has been investigated across a limited set ..."
Abstract - Add to MetaCart
approaches. We show how to handle these two issues with a new dataflow adequacy criterion and automated detection of areas of replicated formulas, and report results of a controlled experiment investigating the feasibility of our approach. 1.

Determining the order of processor transactions in statically scheduled multiprocessors

by S. Sriram, Edward A. Lee - VLSI Signal Processing , 1997
"... This paper addresses embedded multiprocessor implementation of iterative, real-time applications, such as digital signal and image processing, that are specified as dataflow graphs. Scheduling dataflow graphs on multiple processors involves assigning tasks to processors (processor assignment), order ..."
Abstract - Cited by 21 (0 self) - Add to MetaCart
This paper addresses embedded multiprocessor implementation of iterative, real-time applications, such as digital signal and image processing, that are specified as dataflow graphs. Scheduling dataflow graphs on multiple processors involves assigning tasks to processors (processor assignment
Next 10 →
Results 1 - 10 of 24
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University