Sciweavers

445 search results - page 24 / 89
» A Systematic Construction of Abstract Domains
Sort
View
FAW
2008
Springer
127views Algorithms» more  FAW 2008»
13 years 10 months ago
Visiting a Polygon on the Optimal Way to a Query Point
Abstract. We study a constrained version of the shortest path problem in polygonal domains, in which the path must visit a given target polygon. We provide an efficient algorithm f...
Ramtin Khosravi, Mohammad Ghodsi
UPP
2004
Springer
14 years 2 months ago
Overview of Generative Software Development
Abstract. System family engineering seeks to exploit the commonalities among systems from a given problem domain while managing the variabilities among them in a systematic way. In...
Krzysztof Czarnecki
VL
2003
IEEE
134views Visual Languages» more  VL 2003»
14 years 2 months ago
End-user programming as translation: an experimental framework and study
One of the reputed advantages of end-user programming languages is that they support a given problem doh a set of programming abstractions that are “just right” for the end-us...
Christopher D. Hundhausen, Ravikiran Vatrapu, Josh...
IICS
2010
Springer
14 years 24 days ago
Rearchitecting DNS
Abstract. The Domain Name System (DNS) has been the naming service of the Internet for more than 20 years. It is the foundation of virtually all other distributed service. The de...
Gert Pfeifer, Christof Fetzer, Martin Steuer
ICDT
1997
ACM
138views Database» more  ICDT 1997»
14 years 1 months ago
Tractable Iteration Mechanisms for Bag Languages
Abstract. The goal of this paper is to study tractable iteration mechanisms for bags. The presence of duplicates in bags prevents iteration mechanisms developed in the context of s...
Latha S. Colby, Leonid Libkin