Sciweavers

29908 search results - page 5909 / 5982
» On the complexity of communication complexity
Sort
View
SAC
2010
ACM
13 years 8 months ago
A formal approach to reuse successful traceability practices in SPL projects
Software Product Line (SPL) Engineering has to deal with interrelated, complex models such as feature and architecture models, hence traceability is fundamental to keep them consi...
Angelina Espinoza, Goetz Botterweck, Juan Garbajos...
SAMOS
2010
Springer
13 years 8 months ago
OpenCL-based design methodology for application-specific processors
OpenCL is a programming language standard which enables the programmer to express the application by structuring its computation as kernels. The OpenCL compiler is given the explic...
Pekka O. Jaskelainen, Carlos S. de La Lama, Pablo ...
SIGSOFT
2010
ACM
13 years 8 months ago
Language-based replay via data flow cut
A replay tool aiming to reproduce a program's execution interposes itself at an appropriate replay interface between the program and the environment. During recording, it log...
Ming Wu, Fan Long, Xi Wang, Zhilei Xu, Haoxiang Li...
SP
2010
IEEE
152views Security Privacy» more  SP 2010»
13 years 8 months ago
Scalable Parametric Verification of Secure Systems: How to Verify Reference Monitors without Worrying about Data Structure Size
The security of systems such as operating systems, hypervisors, and web browsers depend critically on reference monitors to correctly enforce their desired security policy in the ...
Jason Franklin, Sagar Chaki, Anupam Datta, Arvind ...
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
13 years 8 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...
« Prev « First page 5909 / 5982 Last » Next »