MENU

Publications

Department research publications may have multiple locations and may be found using a variety of search tools. Below is an alphabetical list of the current computer science faculty and links to the location(s) of their research publications. At the bottom of the page is an archive of department technical reports.

Research Publications

Technical Reports Archive

Technical reports are listed in descending date order.

  • 20-101
    “Delay-based Identification of Internet Block Movement”
    Manaf Gharaibeh, Christos Papadopoulos, John Heidemann, and Craig Partridge
    April 7, 2020
  • 18-101
    “Synthetic Lung Nodule 3D Image Generation Using Autoencoders”
    Steve Kommrusch and Louis-Noel Pouchet
    November 8, 2018
  • 16-101
    “BotDigger: Detecting DGA Bots in a Single Network”
    Han Zhang, Manaf Gharaibeh, Spiros Thanasoulas, Christos Papadopoulos
    January 21, 2016
  • 15-104
    “Characterizing International BGP Detours”
    Anant Shah, Christos Papadopoulos
    November 18, 2015
  • 15-103
    “Assessing Co-Locality of IP Blocks”
    Manaf Gharaibeh, Han Zhang, Christos Papadopoulos, John Heidemann
    November 20, 2015
  • 15-102
    “Echo State Networks for Modeling and Classification of EEG Signals in Mental-Task Brain-Computer Interfaces”
    Elliott M. Forney, Charles W. Anderson, William J. Gavin, Patricia L. Davies, Marla C. Roll, Brittany K. Taylor
    November 17, 2015
  • 15-101
    “Mitigating Poisoned Content with Forwarding Strategy”
    Steve DiBenedetto and Christos Papadopoulos
    August 13, 2015
  • 14-102
    “Activity Theory Language as a Visual Studio 2013 Tool Extension”
    Geri Georg
    November, 2014
  • 14-101
    “Cache efficient parallelizations for Uniform Dependence Computations”
    Yun Zou and Sanjay Rajopadhye
    May 1, 201413-109
    “An Approach for Code Generation in the Sparse Polyhedral Framework”
    Michelle Mills Strout, Alan LaMielle, Larry Carter, Jeanne Ferrante, Barbara Kreaseck, and Catherine Olschanowksy
    December 24, 2013
  • 13-108
    “Analysing Requirements to Detect Latent Security Vulnerabilities”
    Curtis C.R. Busby-Earle and Robert France
    November 11, 2013
  • 13-107
    “Folklore Confirmed: Compiling for Speed = Compiling for Energy”
    Tomofumi Yuki and Sanjay Rajopadhye
    August 27, 2013
  • 13-106
    “Using Machine Learning Techniques to Detect Metamorphic Relations for Programs without Test Oracles”
    Upulee Kanewala and James M. Bieman
    June 4, 2013
  • 13-105
    “Parametrically Tiled Distributed Memory Parallelization of Polyhedral Programs”
    Tomofumi Yuki and Sanjay Rajopadhye
    June 10, 2013
  • 13-104
    “Analyzing Behavioral Refactoring of Class Models”
    Wuliang Sun, Robert B. France, and Indrakshi Ray
    May 30, 2013
  • 13-103
    “The Stencil Processing Unit: GPGPU Done Right”
    Sanjay Rajopadhye, Guillaume Iooss, Tomofumi Yuki, and Dan Connors
    March 1, 2013
  • 13-102
    “USE Tool Analysis of Activity Theory Models”
    Geri Georg and Gunter Mussbacher
    March 13, 2013
  • 13-101
    “An Activity Theory Language: USE Implementation”
    Geri Georg and Robert France
    January 15, 2013
  • 12-102
    “Systematic Implementation of fast-i-loop in UNAfold using AlphaZ”
    Tomofumi Yuki, Tanveer Patahan, Gautam Gupta, and Sanjay Rajopadhye
    May 31, 2012
  • 12-101
    “AlphaZ: A System for Analysis, Transformation, and Code Generation in the Polyhedral Equational Model”
    Tomofumi Yuki, Vamshi Basupalli, Gautam Gupta, Guillaume Iooss, DaeGon Kim, Tanveer Pathan, Pradeep Srinivasa, Yun Zou and Sanjay Rajopadhye
    May 31, 2012
  • 11-106
    “Canonic Multi-Projection: Memory Allocation for Distributed Memory Parallelization”
    Tomofumi Yuki and Sanjay Rajopadhye
    September 20, 2011
  • 11-105
    “Requirements Definition Document for a Software Product Line of Car Crash Management Systems”
    Alfredo Capozucca, Betty H.C. Cheng, Geri Georg, Nicolas Guelfi, Paul Istoan, Gunter Mussbacher
    June 9, 2011
  • 11-104
    “Modeling Approach Comparison Criteria for MODELS 2011 CMA Workshop”
    Geri Georg, Gunter Mussbacher, Betty Cheng, Ana Moreira, Robert France
    September 15, 2011
  • 11-103
    “The CGPOP Miniapp, Version 1.0”
    Andrew Stone, John M. Dennis, Michelle Mills Strout
    July 11, 2011
  • 11-102
    “Automatic Parallelization of ‘Inherently Sequential’ Nested Loop Programs”
    Yun Zou and Sanjay Rajopadhye
    March 28, 2011
  • 11-101
    “Activity Theory and its Applications in Software Engineering and Technology — Literature Search Results and Observations”
    Geri Georg
    January 28, 2011
  • 10-104
    “Computing the moments of k-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time”
    Andrew M. Sutton, L. Darrell Whitley, Adele E. Howe
    June 24, 2010
  • 10-103
    “Simulating Internet Scale Topologies with Metarouting”
    Steve DiBenedetto, Andrew Stone, Michelle Strout, Dan Massey
    March 31, 2010
  • 10-102
    “Enabling Code Generationwithin the Sparse Polyhedral Framework”
    Alan LaMielle, Michelle Strout
    March 16, 2010
  • 10-101
    “On Parameterized Tiled Loop Generation and Its Parallelization”
    DaeGon Kim and Sanjay V. Rajopadhye
    January 22, 2010
  • 09-101
    “Parameterized Tiling for Imperfectly Nested Loops”
    DaeGon Kim and Sanjay V. Rajopadhye
    February 27, 2009
  • 08-100
    “Value-based Dependence Analysis for the Z-Polyhedral Model”
    DaeGon Kim, Gautam and Sanjay V. Rajopadhye
    April 15, 2008
  • 06-104
    “Scheduling in the Z-Polyhedral Model”
    Gautam, DaeGon Kim and S. Rajopadhye
  • 06-103
    “The Z-Polyhedral Model”
    Gautam and S. Rajopadhye
    Orginally received August 30, 2006
    Modified September 28, 2006
  • 05-102
    “Simplifying Reductions”
    (revised version of TR 04-107)
    Gautam and S. Rajopadhye
  • 04-110
    “Adequate Testing of Aspect-Oriented Programs”
    Michael Mortensen and Roger T. Alexander
  • 04-107
    “Simplifying Reductions”
    Gautam and S. Rajopadhye
  • 04-102
    “On the Common Factors in a Set of Linear Orders”
    Ross M McConnell and Fabien de Montgolfier
  • 04-101
    “Introduction to Computational Neural Modeling for Computer Scientists and Mathematicians”
    Keith A. Bush and Charles W. Anderson
  • 00-101
    “Approximating a Policy Can be Easier Than Approximating a Value Function”
    Charles W. Anderson
  • 99-101
    “Fast Generation of NURBS Surfaces from Polygonal Mesh Models of Human Anatomy”
    Charles W. Anderson and Stewart Crawford-Hines
  • 98-101
    “Antirandom Test Patterns Generation Tool”
    Yuifang Yin
  • 98-102
    MTEAC ’98 Conference Proceedings
    W. Bohm and W. Najjar (eds.)
  • 98-103
    “Antirandom Testing: Beyond Random Testing”
    ShenHui Wu, Yashwant K. Malaiya, and A. P. Jayasumana
  • 98-104
    “Estimating Defect Density Using Test Coverage”
    Yashwant K. Malaiya and Jason Denton
  • 98-105
    “Adaptive Distributed Dynamic Channel Allocation for Wireless Networks”
    Anurag Kahol, Sumit Khurana, Sandeep K. Gupta and Pradip K. Srimani
  • 98-106
    “Mutual Exclusion Between Neighboring Nodes in a Tree that Stabilizes Using Read/Write Atomicity”
    Gheorghe Antonoiu and Pradip K. Srimani
  • 98-107
    “Node-to-Set Vertex Disjoint Paths in Hypercube Networks”
    Shahram Latifi, Hyosun Ko, and Pradip K. Srimani
  • 98-108
    “A 3D Visualisation System for the Image Understanding Environment”
    Karthik Balasubramaniam
  • 98-110
    “Simulating a General Purpose Mobile Computing Environment”
    Anurag Kahol, Sumit Khurana, Sandeep Gupta and Pradip Srimani
  • 98-112
    “Decision Tree Function Approximation in Reinforcement Learning”
    Larry D. Pyeatt and Adele H. Howe
  • 98-113
    “A Multigrid Form of Value Iteration Applied to a Markov Decision Problem”
    Robert B. Heckendorn and Charles W. Anderson
  • 97-103
    “Job Scheduling for Torus Connected Networks”
    Sandeep K. S. Gupta and Pradip K. Srimani
  • 97-104
    “A Physically-Realistic Simulation of Vehicle Traffic Flow”
    Thomas L. Thorpe
  • 97-105
    “Evaluation of a Split Scalar/Array Cache Architecture”
    Michelle Tomasko, Simos Hadjiyiannis and Walid A. Najjar
  • 97-106
    “Visualizing Multisensor Model-Based Object Recognition”
    Mark R. Stevens, J. Ross Beveridge, and Michael E. Goss
  • 97-107
    “A Coregistration Approach to Multisensor Target Recognition with Extensions to Exploit Digital Elevation Map Data”
    J. Ross Beveridge, Bruce A. Draper, Mark R. Stevens, Allen Hanson, and Kris Siejko
  • 97-108
    “Experimental Evaluation of Blocking and Non-Blocking Multithreaded Code Execution”
    Murali Annavaram, Walid A. Najjar, and Lucas Roh
  • 97-109
    “CORBA Based HLA/RTI Design Approach”
    Klaus Schug, Anura Jayasumana, Sandeep K. S. Gupta, and Pradip K. Srimani
  • 97-110
    “Distributed Self-Stabilizing Algorithm for Minimum Spanning Tree Construction”
    Gheorghe Antonoiu and Pradip K. Srimani
  • 97-111
    “Near-optimal Path-based Wormhole Broadcast in Hypercubes”
    Shahram Latifi, Myung Hoon Lee and Pradip K. Srimani
  • 97-112
    “Characterizing Domain Specific Effects in Flaw Selection for Partial Order Planners”
    Adele E. Howe and Eric Dahlman
  • 97-113
    “Measuring Class Cohesion in Java”
    Martin F. Shumway
  • 97-114
    “Compiling Java to SUIF: Incorporating Support for Object-Oriented Languages”
    Sumith Mathew, Eric Dahlman and Sandeep Gupta
  • 97-115
    “What Do the Software Reliability Growth Model Parameters Represent?”
    Yashwant K. Malaiya and Jason Denton
  • 97-116
    “Automatic Test Generation using Checkpoint Encoding and Antirandom Testing”
    Huifang Yin, Zemen Lebne-Dengel and Yashwant K. Malaiya
  • 97-117
    “Comparing Random Starts Local Search with Key Feature Matching”
    J. Ross Beveridge, Christopher R. Graves, and Jim Steinborn
  • 97-120
    “Self-Stabilization: A New Paradigm for Fault Tolerance in Distributed Algorithm Design”Gheorghe Antonoiu and Pradip
    K. Srimani
  • 97-121
    “A Tutorial on a Sliding Window Target Detection Algorithm Implemented in the DARPA Image Understanding Environment”
    J. Ross Beveridge and Jim Steinborn
  • 97-122
    “LiME Users Guide”
    J. Ross Beveridge
  • 96-101
    “A Bipartite, Differential IDDQ Testable Status RAM Design”
    Waleed K. Al-Assadi, Anura P. Jayasumana, and Yashwant K. Malaiya
  • 96-102
    “Differential IDDQ Testable Static RAM Architecture”
    W. K. Al-Assadi, A. P. Jayasumana, and Y. K. Malaiya
  • 96-103
    “Using Design Cohesion to Visualize, Quantify, and Restructure Software”
    Byung-Kyoo Kang and James M. Bieman
  • 96-104
    “Design-level Cohesion Measures: Derivation, Comparison, and Applications”
    Byung-Kyoo Kang and James M. Bieman
  • 96-105
    “Toward Target Verification Through 3-D Model-Based Sensor Fusion”
    J. Ross Beveridge, Mark R. Stevens, and Anthony N.A. Schwickerath
  • 96-106
    “Progress on Target and Terrain Recognition Research at Colorado State University”
    J. Ross Beveridge, Bruce A. Draper, and Kris Siejko
  • 96-107
    “Interleaving 3D Model Feature Prediction and Matching to Support Multi-Sensor Object Recognition”
    Mark R. Stevens and J. Ross Beveridge
  • 96-108
    “Coregistering 3D Models, Range, and Optical Imagery Using Least-Median Squares Fitting”
    Anthony N. A. Schwickerath and J. Ross Beveridge
  • 96-109
    “Local Search as a Tool for Horizon Line Matching”
    J. Ross Beveridge, Christopher Graves and Christopher E. Lesher
  • 96-110
    “Optical Linear Feature Detection Based on Model Pose”
    Mark R. Stevens and J. Ross Beveridge
  • 96-111
    “An Information Gathering Agent for Querying Web Search Engines”
    Daniel Dreilinger and Adele Howe
  • 96-112
    “Approximate Image Mappings Between Nearly Boresight Aligned Optical and Range Sensors”
    J. Ross Beveridge, Zhongfei Zhang, Mike Goss, Mark R. Stevens and A. Schwickerath
  • 96-113
    “Fault Tolerant Ring Embedding in Tetravalent Cayley Network Graphs”
    Premkumar Vadapalli and Pradip K. Srimani
  • 96-114
    “Optimal Routing in Trivalent Cayley Graph Network”
    Premkumar Vadapalli and Pradip K. Srimani
  • 96-115
    “A Self-Stabilizing Leader Election Algorithm for Tree Graphs”
    Gheorghe Antonoiu and Pradip K. Srimani
  • 96-116
    “Super Rotator: Incrementally Extensible Directed Network Graph of Sublogarithmic Diameter”
    Pradip K. Srimani
  • 96-117
    “How Easy is Matching 2D Line Models Using Local Search?”
    J. Ross Beveridge and Edward M. Riseman
  • 96-119
    “Preemptive Job Scheduling in Star Graph Networks”
    Shahram Latifi and Pradip K. Srimani
  • 96-120
    “Using Z as a Substrate for an Architectural Style Description Language”
    Michael D. Rice and Stephen B. Seidman
  • 96-121
    “Describing the PGM Architectural Style”
    Michael D. Rice and Stephen B. Seidman
  • 96-122
    “Precise Matching of 3-D Target Models to Multisensor Data”
    Mark R. Stevens and J. Ross Beveridge
  • 96-123
    <“Describing a Top-Down Architectural Style: the PARSE Process Graph Notation”
    Michael D. Rice and Stephen B. Seidman
  • 96-124
    “Using Large Neural Networks as an Efficient Indexing Method for ATR Template Matching”
    Mark R. Stevens, Charles W. Anderson, and J. Ross Beveridge
  • 96-125
    “Some Lessons Learned from Coding the Burns Line Extraction Algorithm in the DARPA Image Understanding Environment”
    J. Ross Beveridge, Chris Graves, and Chris Lesher
  • 96-126
    “A New Fixed Degree Regular Network for Parallel Processing”
    Shahram Latifi and Pradip K. Srimani
  • 96-128
    <“Software Test Coverage and Reliability”
    Yashwant K. Malaiya, Naixin Li, James M. Bieman, Rick Karcich, and Bob Skibbe
  • 96-129
    “Antirandom Testing: Getting the Most Out of Black-Box Testing”
    Yashwant K. Malaiya
  • 96-130
    “Fault Exposure Ratio Estimation and Applications”
    Li Naixin and Yashwant K. Malaiya
  • 95-101
    “Combinatorial Analysis of Star Graph Networks”
    Y. Rouskov, S. Latifi and P. K. Srimani
  • 95-102
    “Code Generations, Evaluations, and Optimizations in Multithreaded Executions”
    Lucas J. Roh
  • 95-103
    “New Methods for plan selection and refinement in a partial-order planner”
    Raghavan Srinivasan and Adele E. Howe
  • 95-104
    “Transposition Networks as a Class of Fault-Tolerant Robust Networks”
    S. Latifi and Pradip K. Srimani
  • 95-105
    “Locating Shadows in Aerial Photographs Using Imprecise Elevation Data”
    Mark R. Stevens, Larry D. Pyeatt, David J. Houlton, and Michael E. Goss
  • 95-106
    “A Self-Stabilizing Distributed Algorithm to Construct An Arbitrary Spanning Tree of a Connected Graph”
    Gheorghe Antonoiu and Pradip K. Srimani
  • 95-107
    “A New Family of Cayley Graph InterconnectionNetworks of Constant Degree Four”
    Premkumar Vadapalli and Pradip Srimani
  • 94-101
    “Remapping Subpartitions of Hyperspace Using Iterative Genetic Search”
    Keith Mathias and Darrell Whitley
  • 94-102
    “VLC Tries”
    Karl W. Glander and Karl P. Durre
  • 94-103
    “Sleuth User’s Guide – Version 1.2”
    Jeffrey J. Walls
  • 94-104
    “Domain Based Testing : A Reuse Oriented Test Method”
    Richard T. Mraz
  • 94-105
    “Analytical Models of Adaptive Routing Strategies”
    W. A. Najjar, A. Lagman, S. Sur and P. K. Srimani
  • 94-106
    <“Input Pattern Classification for Transistor Level Testing of BiCMOS Circuits*”
    Sankaran M. Menon, Anura P. Jayasumana, Yashwant K. Malaiya
  • 94-107
    “Gate Level Representation of ECL Circuits for Fault Modeling”
    Sankaran M. Menon, Anura P. Jayasumana, Yashwant K. Malaiya
  • 94-108
    “Fault Modeling and Design for Testability of Emitter Coupled Logic (ECL)*”
    Sankaran M. Menon, Yashwant K. Malaiya, Anura P. Jayasumana
  • 94-109
    “On Input Profile Selection For Software Testing*”
    Naixin Li and Yashwant K. Malaiya
  • 94-110
    “The Relationship Between Test Coverage and Reliability”
    Yashwant K. Malaiya, Naixin Li, Jim Bieman, Rick Karcich, Bob Skibbe
  • 94-111
    “Classification of EEG Signals Using a Sparse Polynomial Builder”
    Edward S. Orosz and Charles W. Anderson
  • 94-112
    “Human-Computer Interface Specifications for People with Blindness”
    Jeffrey Glenn Snyder
  • 94-113
    “Uniqueness and Completeness Analysis of Array Comprehensions”
    David Garza and Wim Bohm
  • 94-114
    “Estimating Bounds on the Size of Compressed Tries”
    Karl W. Glander and Karl P. Durre
  • 94-115
    “Integrating Statistical Methods for Characterizing Causal Influences on Planner Behavior over Time”
    Adele E. Howe, Robert St. Amant and Paul R. Cohen
  • 94-116
    “Evaluating Planning Through Simulation: An Example Using Phoenix”
    Adele E. Howe
  • 94-117
    “Integrating Failure Recovery with Planner Debugging”
    Adele E. Howe
  • 94-118
    “PDF Program Understanding — A Survey”
    A. von Mayrhauser and A. M. Vans
  • 94-121
    “Multigrid Q-Learning”
    Charles W. Anderson and Stewart G. Crawford-Hines
  • 93-101
    “Differential Editors”
    Titus D. M. Purdin and Alan L. Wendt
  • 93-102
    “The VISA User’s Guide”
    Matthew Haines and Wim Bohm
  • 93-103
    “A Genetic Algorithm Tutorial (revised November 10, 1993)”
    Darrell Whitley
  • 93-104
    “A Comparison of Explicit and Implicit Programming Styles for Distributed Memory Multiprocessors”
    Matthew Haines and Wim Bohm
  • 93-105
    “An Adjustable Gradient Filter for Volume Visualization”
    Michael E. Goss
  • 93-106
    “A Functional Implementation of the Jacobi Eigen-Solver”
    A.P.W. Bohm and R. E. Hiromoto
  • 93-107
    “NAS parallel benchmark integer sort (IS) performance on MINT”
    S. Sur and W. Bohm
  • 93-108
    “A Note on the Performance of Genetic Algorithms on Zero-One Knapsack Problems”
    Scott Gordon, A. P. Wim Bohm and Darrell Whitley
  • 93-109
    “Measuring Functional Cohesion”
    James M. Bieman and Linda M. Ott
  • 93-110
    “Distributed Runtime Support for Task and Data Management (PhD Dissertation)”
    Matthew Dennis Haines
  • 93-111
    “C-Patrol: Design and Usage”
    Hwei Yin and James M. Bieman
  • 93-112
    “Enhancing Accuracy of Software Reliability Prediction”
    Naixin Li and Yashwant K. Malaiya
  • 93-113
    “Empirical Estimation of Fault Exposure Ratio”
    Naixin Li and Yashwant K. Malaiya
  • 93-114
    “Serial and Parallel Genetic Algorithms as Function Optimizers”
    V. Scott Gordon and Darrell Whitley
  • 93-115
    <“The Effect of Correlated Faults on Software Reliability”
    Kang Wu and Yashwant K. Malaiya
  • 93-116
    “A Survey of Distributed Mutual Exclusion Algorithms”
    Martin G. Velazquez
  • 93-117
    “Faulty Behavior of Asynchronous Storage Elements”
    Waleed K. Al-Assadi, Ding Lu, Anura P. Jayasumana, Yashwant K. Malaiya and Carol Q. Tong
  • 93-118
    “Modeling of Intra-Cell Defects in CMOS SRAM”
    W. K. Al-Assadi, Y. K. Malaiya, and A. P. Jayasumana
  • 93-119
    “Detection of Feed-Through Faults in CMOS Storage Elements”
    Waleed K. Al-Assadi, Yashwant K. Malaiya and Anura P. Jayasumana
  • 93-120
    “Data-feed-through Faults in Asynchronous Circuits”
    Waleed K. Al-Assadi, Ding Lu, Carol Q. Tong, Anura P. Jayasumana, Yashwant K. Malaiya
  • 93-121
    “Limitations of Built-In Current Sensors (BICS) for IDDQ Testing”
    Sankaran M. Menon, Yashwant K. Malaiya, Anura P. Jayasumana, Carol Q. Tong
  • 93-122
    “A Detailed Analysis on the Manifestations of Faults in Single and Double BJT BiCMOS Logic Gates”
    Sankaran M. Menon, Anura P. Jayasumana, Yashwant K. Malaiya
  • 93-123
    “The Effect of Built-In Current Sensors (BICS) on Operational and Test Performance”
    Sankaran M. Menon, Yashwant K. Malaiya, Anura P. Jayasumana, Carol Q. Tong
  • 93-124
    “Analysis of Bridging faults in Double BJT BiCMOS Circuit”
    Sankaran M. Menon, Yashwant K. Malaiya, Anura P. Jayasumana
  • 93-125
    “Measuring Software Reuse in Object Oriented Systems and Ada Software”
    Santhi Karunanithi and James M. Bieman
  • 93-126
    “The Purdue Parallel Benchmarks in FP”
    Randolph Bentson
  • 93-127
    “Uniqueness Analysis of Array Comprehensions Using the Omega Test”
    David Garza and Wim Bohm
  • 93-128
    “Efficient Declarative Programs: Experience in Implementing NAS Benchmark FT”
    S. Sur and W. Bohm
  • 93-129
    “Competencies of Exceptional and Non-Exceptional Software Engineers”
    Richard T. Turley and James M. Bieman
  • 93-130
    “Analytical Models of Adaptive Routing Strategies”
    W. A. Najjer, A. Lagman, S. Sur and P. K. Srimani
  • 93-131
    “Domain Based Testing : Increasing Test Case Reuse”
    Anneliese von Mayrhauser, Richard Mraz, Jeff Walls, and Peter Ocken
  • 93-132
    “Uniqueness and Completeness Analysis of Array Comprehensions”
    David Garza and Wim Bohm