Sciweavers

61 search results - page 8 / 13
» Testing, abstraction, theorem proving: better together!
Sort
View
IFM
2004
Springer
14 years 26 days ago
Verifying Controlled Components
Recent work on combining CSP and B has provided ways of describing systems comprised of components described in both B (to express requirements on state) and CSP (to express intera...
Steve Schneider, Helen Treharne
KBSE
2007
IEEE
14 years 1 months ago
Directed test generation using symbolic grammars
We present CESE, a tool that combines exhaustive enumeration of test inputs from a structured domain with symbolic execution driven test generation. We target programs whose valid...
Rupak Majumdar, Ru-Gang Xu
ICIP
2010
IEEE
13 years 5 months ago
Patch confidence k-nearest neighbors denoising
Recently, patch-based denoising techniques have proved to be very effective. Indeed, they account for the correlations that exist among patches of natural images. Taking a variati...
Cesario Vincenzo Angelino, Eric Debreuve, Michel B...
STOC
2007
ACM
111views Algorithms» more  STOC 2007»
14 years 7 months ago
Low-end uniform hardness vs. randomness tradeoffs for AM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
Ronen Shaltiel, Christopher Umans
SAS
2007
Springer
124views Formal Methods» more  SAS 2007»
14 years 1 months ago
Arithmetic Strengthening for Shape Analysis
Abstract. Shape analyses are often imprecise in their numerical reasoning, whereas numerical static analyses are often largely unaware of the shape of a program’s heap. In this p...
Stephen Magill, Josh Berdine, Edmund M. Clarke, By...