Sciweavers

4281 search results - page 134 / 857
» How to Disembed a Program
Sort
View
JAPLL
2007
125views more  JAPLL 2007»
15 years 2 months ago
Preferential theory revision
Employing a logic program approach, this paper focuses on applying preferential reasoning to theory revision, both by means of preferences among existing theory rules, and by means...
Pierangelo Dell'Acqua, Luís Moniz Pereira
113
Voted
ENTCS
2002
106views more  ENTCS 2002»
15 years 2 months ago
Refactoring by Transformation
In this paper we present how refactoring of object-oriented programs can be accomplished by using refinement. Our approach is based on algebraic laws of an object-oriented languag...
Márcio Cornélio, Ana Cavalcanti, Aug...
JFP
2002
116views more  JFP 2002»
15 years 2 months ago
Recursive subtyping revealed
Algorithms for checking subtyping between recursive types lie at the core of many programming language implementations. But the fundamental theory of these algorithms and how they...
Vladimir Gapeyev, Michael Y. Levin, Benjamin C. Pi...
STVR
2002
80views more  STVR 2002»
15 years 2 months ago
Conditioned slicing supports partition testing
This paper describes the use of conditioned slicing to assist partition testing, illustrating this with a case study. The paper shows how a conditioned slicing tool can be used to...
Robert M. Hierons, Mark Harman, Chris Fox, Lahcen ...
JMLR
2012
13 years 4 months ago
On Bisubmodular Maximization
Bisubmodularity extends the concept of submodularity to set functions with two arguments. We show how bisubmodular maximization leads to richer value-of-information problems, usin...
Ajit Singh, Andrew Guillory, Jeff Bilmes