Sciweavers

1700 search results - page 334 / 340
» Specifying and implementing refactorings
Sort
View
PVLDB
2008
182views more  PVLDB 2008»
13 years 9 months ago
SCOPE: easy and efficient parallel processing of massive data sets
Companies providing cloud-scale services have an increasing need to store and analyze massive data sets such as search logs and click streams. For cost and performance reasons, pr...
Ronnie Chaiken, Bob Jenkins, Per-Åke Larson,...
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 8 months ago
Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis
The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure ...
Silvio Ghilardi, Silvio Ranise
ICSOC
2010
Springer
13 years 8 months ago
A Requirement-Centric Approach to Web Service Modeling, Discovery, and Selection
Service-Oriented Computing (SOC) has gained considerable popularity for implementing Service-Based Applications (SBAs) in a flexible and effective manner. The basic idea of SOC i...
Maha Driss, Naouel Moha, Yassine Jamoussi, Jean-Ma...
TMC
2008
159views more  TMC 2008»
13 years 8 months ago
Protecting Location Privacy with Personalized k-Anonymity: Architecture and Algorithms
Continued advances in mobile networks and positioning technologies have created a strong market push for location-based applications. Examples include location-aware emergency resp...
Bugra Gedik, Ling Liu
KBSE
2010
IEEE
13 years 8 months ago
Solving string constraints lazily
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
Pieter Hooimeijer, Westley Weimer