Sciweavers

2957 search results - page 490 / 592
» Code analysis and CS-XML
Sort
View
STOC
2004
ACM
177views Algorithms» more  STOC 2004»
16 years 4 months ago
Lower bounds for linear degeneracy testing
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
Nir Ailon, Bernard Chazelle
ICSE
2007
IEEE-ACM
16 years 4 months ago
Path-Sensitive Inference of Function Precedence Protocols
Function precedence protocols define ordering relations among function calls in a program. In some instances, precedence protocols are well-understood (e.g., a call to pthread mut...
Murali Krishna Ramanathan, Ananth Grama, Suresh Ja...
ICSE
2007
IEEE-ACM
16 years 4 months ago
Supporting Heterogeneous Architecture Descriptions in an Extensible Toolset
Many architecture description languages (ADLs) have been proposed to model, analyze, configure, and deploy complex software systems. To face this diversity, extensible ADLs (or AD...
Ali Erdem Özcan, Jean-Bernard Stefani, Matthi...
PERCOM
2003
ACM
16 years 3 months ago
Self-Routing in Pervasive Computing Environments Using Smart Messages
Smart Messages (SMs) are dynamic collections of code and data that migrate to nodes of interest in the network and execute on these nodes. A key challenge in programming pervasive...
Cristian Borcea, Chalermek Intanagonwiwat, Akhiles...
DCC
2008
IEEE
16 years 3 months ago
From graph states to two-graph states
The name `graph state' is used to describe a certain class of pure quantum state which models a physical structure on which one can perform measurement-based quantum computin...
Constanza Riera, Stéphane Jacob, Matthew G. Parke...