Sciweavers

811 search results - page 23 / 163
» Refactoring Using Type Constraints
Sort
View
CP
2003
Springer
14 years 1 months ago
An Algebraic Approach to Multi-sorted Constraints
Abstract. Most previous theoretical study of the complexity of the constraint satisfaction problem has considered a simplified version of the problem in which all variables have t...
Andrei A. Bulatov, Peter Jeavons
PLDI
2005
ACM
14 years 2 months ago
Essential language support for generic programming
Concepts are an essential language feature for generic programming in the large. Concepts allow for succinct expression of constraints on type parameters of generic algorithms, en...
Jeremy G. Siek, Andrew Lumsdaine
MSR
2006
ACM
14 years 2 months ago
Detecting similar Java classes using tree algorithms
Similarity analysis of source code is helpful during development to provide, for instance, better support for code reuse. Consider a development environment that analyzes code whi...
Tobias Sager, Abraham Bernstein, Martin Pinzger, C...
WIOPT
2010
IEEE
13 years 6 months ago
Delay efficient scheduling via redundant constraints in multihop networks
Abstract--We consider the problem of delay-efficient scheduling in general multihop networks. While the class of max-weight type algorithms are known to be throughput optimal for t...
Longbo Huang, Michael J. Neely
ECOOP
2011
Springer
12 years 8 months ago
Tunable Static Inference for Generic Universe Types
Object ownership is useful for many applications, including program verification, thread synchronization, and memory management. However, the annotation overhead of ownership type...
Werner Dietl, Michael D. Ernst, Peter Müller