Sciweavers

412 search results - page 82 / 83
» Refactoring
Sort
View
ERLANG
2008
ACM
13 years 11 months ago
Gradual typing of erlang programs: a wrangler experience
Currently most Erlang programs contain no or very little type information. This sometimes makes them unreliable, hard to use, and difficult to understand and maintain. In this pap...
Konstantinos F. Sagonas, Daniel Luna
CIDR
2009
167views Algorithms» more  CIDR 2009»
13 years 11 months ago
Unbundling Transaction Services in the Cloud
The traditional architecture for a DBMS engine has the recovery, concurrency control and access method code tightly bound together in a storage engine for records. We propose a di...
David B. Lomet, Alan Fekete, Gerhard Weikum, Micha...
CCR
2005
131views more  CCR 2005»
13 years 9 months ago
A clean slate 4D approach to network control and management
Today's data networks are surprisingly fragile and difficult to manage. We argue that the root of these problems lies in the complexity of the control and management planes--...
Albert G. Greenberg, Gísli Hjálmt&ya...
VL
2010
IEEE
209views Visual Languages» more  VL 2010»
13 years 8 months ago
Automatically Inferring ClassSheet Models from Spreadsheets
Many errors in spreadsheet formulas can be avoided if spreadsheets are built automatically from higher-level models that can encode and enforce consistency constraints. However, d...
Jacome Cunha, Martin Erwig, Joao Saraiva
SOFTVIS
2010
ACM
13 years 7 months ago
Dependence cluster visualization
Large clusters of mutual dependence have long been regarded as a problem impeding comprehension, testing, maintenance, and reverse engineering. An effective visualization can aid ...
Syed S. Islam, Jens Krinke, David Binkley