Sciweavers

3595 search results - page 535 / 719
» Roles of Program Extension
Sort
View
DLS
2005
176views Languages» more  DLS 2005»
15 years 6 months ago
Dynamic data polyvariance using source-tagged classes
The DDP (Demand-driven/Pruning) analysis algorithm allows us to perform data-flow analyses of programming languages that are dynamically typed and have higher-order control flow...
S. Alexander Spoon, Olin Shivers
SIGMOD
2010
ACM
191views Database» more  SIGMOD 2010»
15 years 4 months ago
Data conflict resolution using trust mappings
In massively collaborative projects such as scientific or community databases, users often need to agree or disagree on the content of individual data items. On the other hand, tr...
Wolfgang Gatterbauer, Dan Suciu
138
Voted
JFP
2008
72views more  JFP 2008»
15 years 4 months ago
Dynamic rebinding for marshalling and update, via redex-time and destruct-time reduction
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...
Peter Sewell, Gareth Stoyle, Michael Hicks, Gavin ...
TOSEM
2008
168views more  TOSEM 2008»
15 years 4 months ago
Developing and debugging algebraic specifications for Java classes
Modern programs make extensive use of reusable software libraries. For example, a study of a number of large Java applications shows that between 17% and 30% of the classes in tho...
Johannes Henkel, Christoph Reichenbach, Amer Diwan
CORR
2004
Springer
176views Education» more  CORR 2004»
15 years 4 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
Viktor Kuncak, Martin C. Rinard