Sciweavers

212 search results - page 4 / 43
» Activating refactorings faster
Sort
View
101
Voted
ISSTA
2004
ACM
15 years 5 months ago
Faster constraint solving with subtypes
Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...
Jonathan Edwards, Daniel Jackson, Emina Torlak, Vi...
130
Voted
PETRA
2009
ACM
15 years 7 months ago
Towards faster activity search using embedding-based subsequence matching
Event search is the problem of identifying events or activity of interest in a large database storing long sequences of activity. In this paper, our topic is the problem of identi...
Panagiotis Papapetrou, Paul Doliotis, Vassilis Ath...
103
Voted
WCRE
2002
IEEE
15 years 5 months ago
Knowledge-Based Library Re-Factoring for an Open Source Project
Software miniaturization is a form of software refactoring focused on reducing an application to the bare bone. Porting an application on a hand-held device is very likely to requ...
Massimiliano Di Penta, Markus Neteler, Giuliano An...
FASE
2008
Springer
15 years 2 months ago
Verification of Architectural Refactorings by Rule Extraction
With the success of model-driven development as well as component-based and service-oriented systems, models of software architecture are key artefacts in the development process. ...
Dénes Bisztray, Reiko Heckel, Hartmut Ehrig
CLA
2006
15 years 1 months ago
Using FCA to Suggest Refactorings to Correct Design Defects
Abstract. Design defects are poor design choices resulting in a hard-tomaintain software, hence their detection and correction are key steps of a disciplined software process aimed...
Naouel Moha, Jihene Rezgui, Yann-Gaël Gu&eacu...