Search
Now showing items 11-20 of 20
Shonan challenge for generative programming: short position paper
(ACM, 2013)
The appeal of generative programming is "abstraction without guilt": eliminating the vexing trade-off between writing high-level code and highly-performant code. Generative programming also promises to formally capture the ...
VISOR: A fast image processing pipeline with scaling and translation invariance for test oracle automation of visual output systems
(The ACM Digital Library, 2018-02)
A test oracle automation approach proposed for systems that produce visual output.Root causes of accuracy issues analyzed for test oracles based on image comparison.Image processing techniques employed to improve the ...
Relating Staged Computation to the Record Calculus
(Özyeğin University, 06.09.2010)
It has been previously shown that there is a close relation between record calculus and program generation (e.g. Lisp-like quasiquotations): A translation has been defined to convert staged expressions to record calculus ...
Fast and efficient implementation of lightweight crypto algorithm PRESENT on FPGA through processor instruction set extension
(IEEE, 2019)
As Internet of Things (IoT) technology becomes widespread, the importance of information security increases. PRESENT algorithm is a major lightweight symmetric-key encryption algorithm for IoT devices. Compared to the ...
A sparse matrix‐vector multiplication method with low preprocessing cost
(Wiley, 2018-11-10)
Sparse matrix-vector multiplication (SpMV) is a crucial operation used for solving many engineering and scientific problems. In general, there is no single SpMV method that gives high performance for all sparse matrices. ...
Optimization by runtime specialization for sparse matrix-vector multiplication
(ACM, 2014)
Runtime specialization optimizes programs based on partial information available only at run time. It is applicable when some input data is used repeatedly while other input data varies. This technique has the potential ...
Preface
(2011)
Autotuning runtime specialization for sparse matrix-vector multiplication
(ACM, 2016-04)
Runtime specialization is used for optimizing programs based on partial information available only at runtime. In this paper we apply autotuning on runtime specialization of Sparse Matrix-Vector Multiplication to predict ...
ADVISOR: An adjustable framework for test oracle automation of visual output systems
(IEEE, 2020-09)
Test oracles differentiate between the correct and incorrect system behavior. Automation of test oracles for visual output systems mainly involves image comparison, where a snapshot of the output is compared with respect ...
Software UART: A use case for VSCPU worst-case execution time analyzer
(IEEE, 2019)
This paper presents our early results of the development of a Worst-Case Execution Time (WCET) analyzer for VSCPU by implementing a software UART system. Our WCET analyzer takes a C program as input and gives the time taken ...
Share this page