Sciweavers

1410 search results - page 34 / 282
» Proving theorems by reuse
Sort
View
ECOOP
1998
Springer
14 years 2 months ago
A Study of The Fragile Base Class Problem
In this paper we study the fragile base class problem. This problem occurs in open object-oriented systems employing code inheritance as an implementation reuse mechanism. System d...
Leonid Mikhajlov, Emil Sekerinski
COCO
2006
Springer
100views Algorithms» more  COCO 2006»
14 years 1 months ago
How to Get More Mileage from Randomness Extractors
Let C be a class of distributions over {0, 1}n . A deterministic randomness extractor for C is a function E : {0, 1}n {0, 1}m such that for any X in C the distribution E(X) is sta...
Ronen Shaltiel
EXACT
2007
14 years 7 days ago
PML 2: A Modular Explanation Interlingua
In the past five years, we have designed and evolved an interlingua for sharing explanations generated by various automated systems such as hybrid web-based question answering sys...
Deborah L. McGuinness, Li Ding, Paulo Pinheiro da ...
AMAI
2007
Springer
13 years 10 months ago
Decision procedures for extensions of the theory of arrays
The theory of arrays, introduced by McCarthy in his seminal paper “Toward a mathematical science of computation”, is central to Computer Science. Unfortunately, the theory alo...
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, D...
ICSM
2000
IEEE
14 years 2 months ago
ConSIT: A Conditioned Program Slicer
Conditioned slicing is a powerful generalisation of static and dynamic slicing which has applications to many problems in software maintenance and evolution, including re-use, ree...
Chris Fox, Mark Harman, Robert M. Hierons, Sebasti...