Results 1 to 10 of about 169 (168)
Testing refinements by refining tests [PDF]
, 1998 One of the potential benefits of formal methods is that they offer the possibility of reducing the costs of testing. A specification acts as both the benchmark against which any implementation is tested, and also as the means by which tests are generated.
John Derrick, Eerke A. Boiten
openaire +1 more source
Reduction and Refinement [PDF]
Electronic Notes in Theoretical Computer Science, 2008 In this paper we explore the relation between refinement and reduction, especially as it is used in the context of cryptography. We show how refinement is a special case of reduction, and more interestingly, how reduction is an instance of a novel generalisation, ''refinement with context''.
Eerke A. Boiten, Dan Grundy
openaire +1 more source
ALTEX, 2014 The ultimate goal of the Three Rs is the full replacement of animals used in biomedical research and testing. However, replacement is unlikely to occur in the near future; therefore the scientific community as a whole must continue to devote considerable effort to ensure optimal animal welfare for the benefit of the science and the animals, i.e., the R
Joanne, Zurlo, Eric, Hutchinson
openaire +3 more sources
Refinement of Intentions [PDF]
, 2016 According to Bratman, future-directed intentions are high-level plans. We view such plans as high-level actions that can typically not be executed directly: they have to be progressively refined until executable basic actions are obtained. Higher- and lower-level actions are linked by the means-end relation, alias instrumentality relation.
Herzig, Andreas +3 more
openaire +3 more sources
Relational Concurrent Refinement: Timed Refinement [PDF]
, 2011 Data refinement in a state-based language such as Z is defined using a relational model in terms of the behaviour of abstract programs. Downward and upward simulation conditions form a sound and jointly complete methodology to verify relational data refinements, which can be checked on an event-by-event basis rather than per trace.
John Derrick, Eerke A. Boiten
openaire +1 more source
Data Refinement Refined. [PDF]
, 1986 We consider the original work of Hoare and Jones on data refinement in the light of Dijkstra and Smyth's treatment of nondeterminism and of Milner and Park's definition of the simulation of Communicating Systems. Two proof methods are suggested which we hope are simpler and more general than those in current use.
Jifeng He 0001 +2 more
openaire +2 more sources
Theoretical Computer Science, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
IEEE Transactions on Information TheoryWe show that for a wide range of channels and code ensembles with pairwise-independent codewords, with probability tending to 1 with the code length, expurgating an arbitrarily small fraction of codewords from a randomly selected code results in a code attaining the expurgated exponent.
Cocco, Giuseppe +2 more
openaire +5 more sources
Clinics in Plastic Surgery, 2002 When performing traditional abdominoplasty, three fundamental defects of the abdominal wall must always be addressed by the plastic surgeon. They include redundant skin, excess fat, and musculofascial laxity. Plastic surgeons have found that this procedure consists of dermolipectomy and rectus plication, extremely effective in restoring the abdomen to ...
Division of Plastic Surgery, University of Miami School of Medicine,Miami, Florida, USA ( host institution ) +2 more
openaire +3 more sources
, 2010 We study re nement in the setting of local reasoning. In particular, we explore general translations that preserve and that break locality.
Dinsdale-Young, T +2 more
openaire +3 more sources