Sciweavers

1700 search results - page 167 / 340
» Specifying and implementing refactorings
Sort
View
DAC
2005
ACM
16 years 7 months ago
Minimising buffer requirements of synchronous dataflow graphs with model checking
Signal processing and multimedia applications are often implemented on resource constrained embedded systems. It is therefore important to find implementations that use as little ...
Marc Geilen, Twan Basten, Sander Stuijk
WWW
2007
ACM
16 years 7 months ago
A fault model and mutation testing of access control policies
To increase confidence in the correctness of specified policies, policy developers can conduct policy testing by supplying typical test inputs (requests) and subsequently checking...
Evan Martin, Tao Xie
WWW
2001
ACM
16 years 6 months ago
Designing personalized web applications
The goal of this paper is to argue the need to approach the personalization issues in Web applications from the very beginning in the application's development cycle. Since p...
Daniel Schwabe, Gustavo Rossi, Robson Guimar&atild...
POPL
2009
ACM
16 years 6 months ago
Proving that non-blocking algorithms don't block
A concurrent data-structure implementation is considered nonblocking if it meets one of three following liveness criteria: waitfreedom, lock-freedom, or obstruction-freedom. Devel...
Alexey Gotsman, Byron Cook, Matthew J. Parkinson, ...
HPCA
2008
IEEE
16 years 6 months ago
FlexiTaint: A programmable accelerator for dynamic taint propagation
This paper presents FlexiTaint, a hardware accelerator for dynamic taint propagation. FlexiTaint is implemented as an in-order addition to the back-end of the processor pipeline, ...
Guru Venkataramani, Ioannis Doudalis, Yan Solihin,...