Sciweavers

1173 search results - page 95 / 235
» Program Derivation Using Analogy
Sort
View
145
Voted
CP
2005
Springer
15 years 10 months ago
Bounds of Graph Characteristics
Abstract. This report presents a basic scheme for deriving systematically a filtering algorithm from the graph properties based representation of global constraints. This scheme i...
Nicolas Beldiceanu, Thierry Petit, Guillaume Rocha...
FM
1999
Springer
88views Formal Methods» more  FM 1999»
15 years 9 months ago
Refinement Semantics and Loop Rules
Refinement semantics is an alternative to least fixpoint semantics that is more useful for programming. From it we derive a variety of rules for w h i l e-loops, for-loops, and loo...
Eric C. R. Hehner, Andrew M. Gravell
ACMMSP
2006
ACM
226views Hardware» more  ACMMSP 2006»
15 years 8 months ago
Smarter garbage collection with simplifiers
We introduce a method for providing lightweight daemons, called simplifiers, that attach themselves to program data. If a data item has a simplifier, the simplifier may be run aut...
Melissa E. O'Neill, F. Warren Burton
METRICS
1999
IEEE
15 years 9 months ago
Measurements Should Generate Value, Rather than Data
Success factors for measurement programs as identified in the literature typically focus on the `internals' of the measurement program: incremental implementation, support fr...
Frank Niessink, Hans van Vliet
LPNMR
1993
Springer
15 years 9 months ago
An Assumption-Based Framework for Non-Monotonic Reasoning
The notion of assumption-based framework generalises and re nes the use of abduction to give a formalisation of non-monotonic reasoning. In this framework, a sentence is a non-mon...
Andrei Bondarenko, Francesca Toni, Robert A. Kowal...